/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1231a_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 40ef5092 Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1231a_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ed1a983a62dc687cc3536bbaef83cafda1519f0d ........................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1231a_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ed1a983a62dc687cc3536bbaef83cafda1519f0d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_30 term size 40 --- Real Ultimate output --- This is Ultimate 0.1.23-40ef509 [2018-09-20 15:05:44,000 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 15:05:44,002 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 15:05:44,017 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 15:05:44,018 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 15:05:44,020 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 15:05:44,023 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 15:05:44,026 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 15:05:44,028 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 15:05:44,029 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 15:05:44,030 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 15:05:44,031 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 15:05:44,032 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 15:05:44,033 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 15:05:44,034 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 15:05:44,035 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 15:05:44,036 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 15:05:44,038 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 15:05:44,041 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 15:05:44,043 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 15:05:44,044 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 15:05:44,045 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 15:05:44,048 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 15:05:44,048 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 15:05:44,049 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 15:05:44,050 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 15:05:44,051 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 15:05:44,052 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 15:05:44,053 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 15:05:44,057 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 15:05:44,058 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 15:05:44,060 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 15:05:44,060 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 15:05:44,061 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 15:05:44,063 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 15:05:44,064 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 15:05:44,064 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-20 15:05:44,095 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 15:05:44,096 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 15:05:44,097 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 15:05:44,097 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 15:05:44,097 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 15:05:44,098 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 15:05:44,098 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 15:05:44,098 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 15:05:44,098 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 15:05:44,099 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-20 15:05:44,099 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 15:05:44,100 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 15:05:44,100 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 15:05:44,100 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 15:05:44,100 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 15:05:44,100 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 15:05:44,100 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 15:05:44,101 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 15:05:44,101 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 15:05:44,101 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 15:05:44,101 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 15:05:44,103 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 15:05:44,103 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:05:44,103 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 15:05:44,103 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 15:05:44,104 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 15:05:44,104 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-20 15:05:44,104 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 15:05:44,104 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-20 15:05:44,105 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ed1a983a62dc687cc3536bbaef83cafda1519f0d [2018-09-20 15:05:44,183 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 15:05:44,204 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 15:05:44,210 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 15:05:44,212 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 15:05:44,214 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 15:05:44,215 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1231a_true-unreach-call.c [2018-09-20 15:05:44,556 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee4e0a04a/a213c751d6954cab9c9bde25d69e01a8/FLAGa07dc546f [2018-09-20 15:05:44,702 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 15:05:44,703 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1231a_true-unreach-call.c [2018-09-20 15:05:44,710 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee4e0a04a/a213c751d6954cab9c9bde25d69e01a8/FLAGa07dc546f [2018-09-20 15:05:44,732 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee4e0a04a/a213c751d6954cab9c9bde25d69e01a8 [2018-09-20 15:05:44,736 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 15:05:44,740 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 15:05:44,741 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 15:05:44,741 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 15:05:44,748 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 15:05:44,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:05:44" (1/1) ... [2018-09-20 15:05:44,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@470a4409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:44, skipping insertion in model container [2018-09-20 15:05:44,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:05:44" (1/1) ... [2018-09-20 15:05:44,765 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 15:05:45,055 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:05:45,077 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 15:05:45,106 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:05:45,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:45 WrapperNode [2018-09-20 15:05:45,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 15:05:45,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 15:05:45,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 15:05:45,144 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 15:05:45,157 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:45" (1/1) ... [2018-09-20 15:05:45,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:45" (1/1) ... [2018-09-20 15:05:45,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:45" (1/1) ... [2018-09-20 15:05:45,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:45" (1/1) ... [2018-09-20 15:05:45,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:45" (1/1) ... [2018-09-20 15:05:45,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:45" (1/1) ... [2018-09-20 15:05:45,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:45" (1/1) ... [2018-09-20 15:05:45,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 15:05:45,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 15:05:45,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 15:05:45,186 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 15:05:45,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:05:45,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 15:05:45,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 15:05:45,258 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-09-20 15:05:45,258 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-09-20 15:05:45,258 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_double [2018-09-20 15:05:45,258 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 15:05:45,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 15:05:45,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-20 15:05:45,259 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-09-20 15:05:45,260 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-09-20 15:05:45,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 15:05:45,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-09-20 15:05:45,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-09-20 15:05:45,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 15:05:45,260 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_double [2018-09-20 15:05:45,262 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 15:05:45,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 15:05:45,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 15:05:45,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-09-20 15:05:45,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-09-20 15:05:45,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2018-09-20 15:05:45,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-09-20 15:05:45,883 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 15:05:45,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:05:45 BoogieIcfgContainer [2018-09-20 15:05:45,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 15:05:45,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 15:05:45,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 15:05:45,889 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 15:05:45,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 03:05:44" (1/3) ... [2018-09-20 15:05:45,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ba1d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:05:45, skipping insertion in model container [2018-09-20 15:05:45,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:45" (2/3) ... [2018-09-20 15:05:45,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ba1d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:05:45, skipping insertion in model container [2018-09-20 15:05:45,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:05:45" (3/3) ... [2018-09-20 15:05:45,893 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231a_true-unreach-call.c [2018-09-20 15:05:45,904 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 15:05:45,915 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 15:05:45,971 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 15:05:45,972 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 15:05:45,972 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 15:05:45,973 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 15:05:45,973 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 15:05:45,973 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 15:05:45,973 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 15:05:45,973 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 15:05:45,973 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 15:05:45,995 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-09-20 15:05:46,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-20 15:05:46,005 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:46,007 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:05:46,010 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:46,015 INFO L82 PathProgramCache]: Analyzing trace with hash -770504903, now seen corresponding path program 1 times [2018-09-20 15:05:46,018 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:05:46,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:05:46,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:05:46,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:05:46,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:05:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:05:46,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:05:46,176 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:05:46,177 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 15:05:46,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 15:05:46,196 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 15:05:46,197 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:05:46,199 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-09-20 15:05:46,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:05:46,227 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2018-09-20 15:05:46,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 15:05:46,229 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-09-20 15:05:46,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:05:46,240 INFO L225 Difference]: With dead ends: 93 [2018-09-20 15:05:46,240 INFO L226 Difference]: Without dead ends: 49 [2018-09-20 15:05:46,244 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:05:46,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-20 15:05:46,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-20 15:05:46,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-20 15:05:46,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-09-20 15:05:46,293 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 27 [2018-09-20 15:05:46,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:05:46,294 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-09-20 15:05:46,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 15:05:46,294 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-09-20 15:05:46,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-20 15:05:46,297 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:46,297 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:05:46,298 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:46,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1107593466, now seen corresponding path program 1 times [2018-09-20 15:05:46,298 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:05:46,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:05:46,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:05:46,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:05:46,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:05:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:05:46,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:05:46,485 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:05:46,485 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:05:46,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:05:46,489 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:05:46,489 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:05:46,490 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 4 states. [2018-09-20 15:05:46,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:05:46,588 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-09-20 15:05:46,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:05:46,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-09-20 15:05:46,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:05:46,592 INFO L225 Difference]: With dead ends: 59 [2018-09-20 15:05:46,592 INFO L226 Difference]: Without dead ends: 53 [2018-09-20 15:05:46,593 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:05:46,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-20 15:05:46,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-20 15:05:46,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-20 15:05:46,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-09-20 15:05:46,606 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 40 [2018-09-20 15:05:46,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:05:46,606 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-09-20 15:05:46,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:05:46,606 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-09-20 15:05:46,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-20 15:05:46,608 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:46,608 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:05:46,608 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:46,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1793310220, now seen corresponding path program 1 times [2018-09-20 15:05:46,609 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:05:46,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:05:46,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:05:46,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:05:46,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:05:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:05:46,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:05:46,722 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:05:46,722 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:05:46,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:05:46,723 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:05:46,723 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:05:46,724 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 4 states. [2018-09-20 15:05:46,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:05:46,849 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-09-20 15:05:46,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:05:46,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-09-20 15:05:46,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:05:46,853 INFO L225 Difference]: With dead ends: 63 [2018-09-20 15:05:46,853 INFO L226 Difference]: Without dead ends: 57 [2018-09-20 15:05:46,854 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:05:46,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-20 15:05:46,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-09-20 15:05:46,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-20 15:05:46,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-09-20 15:05:46,864 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 43 [2018-09-20 15:05:46,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:05:46,865 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-09-20 15:05:46,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:05:46,865 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-09-20 15:05:46,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-20 15:05:46,867 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:46,867 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:05:46,867 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:46,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1596796715, now seen corresponding path program 1 times [2018-09-20 15:05:46,869 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:05:46,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:05:46,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:05:46,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:05:46,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:05:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 15:05:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 15:05:46,956 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-20 15:05:46,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 03:05:46 BoogieIcfgContainer [2018-09-20 15:05:46,995 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 15:05:46,995 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 15:05:46,996 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 15:05:46,996 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 15:05:46,996 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:05:45" (3/4) ... [2018-09-20 15:05:47,000 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-09-20 15:05:47,000 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 15:05:47,001 INFO L168 Benchmark]: Toolchain (without parser) took 2264.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 953.2 MB in the beginning and 1.1 GB in the end (delta: -113.5 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. [2018-09-20 15:05:47,003 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:05:47,004 INFO L168 Benchmark]: CACSL2BoogieTranslator took 402.02 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-09-20 15:05:47,005 INFO L168 Benchmark]: Boogie Preprocessor took 41.56 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:05:47,005 INFO L168 Benchmark]: RCFGBuilder took 698.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -178.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. [2018-09-20 15:05:47,006 INFO L168 Benchmark]: TraceAbstraction took 1109.27 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: 47.8 MB). Peak memory consumption was 47.8 MB. Max. memory is 11.5 GB. [2018-09-20 15:05:47,007 INFO L168 Benchmark]: Witness Printer took 4.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:05:47,011 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 402.02 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.56 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 698.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -178.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1109.27 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: 47.8 MB). Peak memory consumption was 47.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 67]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryArithmeticDOUBLEoperation at line 60. Possible FailurePath: [L60] double x = 0.0 / 0.0; [L61] double y = __VERIFIER_nondet_double(); [L62] CALL, EXPR isnan_double(y) VAL [\old(x)=4294967300] [L16] RET return x != x; VAL [\old(x)=4294967300, \result=0, x=4294967300] [L62] EXPR isnan_double(y) VAL [isnan_double(y)=0, y=4294967300] [L62] COND TRUE !isnan_double(y) [L64] CALL, EXPR fmin_double(x, y) VAL [\old(x)=4294967301, \old(y)=4294967300] [L45] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967301] [L18] __uint32_t msw, lsw; VAL [\old(x)=4294967301, x=4294967301] [L21] FCALL ieee_double_shape_type ew_u; VAL [\old(x)=4294967301, ew_u={4294967299:0}, x=4294967301] [L22] FCALL ew_u.value = (x) VAL [\old(x)=4294967301, ew_u={4294967299:0}, x=4294967301] [L23] EXPR, FCALL ew_u.parts.msw VAL [\old(x)=4294967301, ew_u={4294967299:0}, ew_u.parts.msw=4293918721, x=4294967301] [L23] (msw) = ew_u.parts.msw VAL [\old(x)=4294967301, ew_u={4294967299:0}, ew_u.parts.msw=4293918721, msw=4293918721, x=4294967301] [L23] FCALL (msw) = ew_u.parts.msw VAL [(msw) = ew_u.parts.msw=4294967302, \old(x)=4294967301, ew_u={4294967299:0}, ew_u.parts.msw=4293918721, msw=4293918721, x=4294967301] [L24] EXPR, FCALL ew_u.parts.lsw VAL [\old(x)=4294967301, ew_u={4294967299:0}, ew_u.parts.lsw=4294967297, msw=4293918721, x=4294967301] [L24] (lsw) = ew_u.parts.lsw VAL [\old(x)=4294967301, ew_u={4294967299:0}, ew_u.parts.lsw=4294967297, lsw=4294967297, msw=4293918721, x=4294967301] [L24] FCALL (lsw) = ew_u.parts.lsw VAL [(lsw) = ew_u.parts.lsw=4294967304, \old(x)=4294967301, ew_u={4294967299:0}, ew_u.parts.lsw=4294967297, lsw=4294967297, msw=4293918721, x=4294967301] [L25] COND FALSE !(0) VAL [\old(x)=4294967301, lsw=4294967297, msw=4293918721, x=4294967301] [L27-L28] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967301, lsw=4294967297, msw=4293918721, x=4294967301] [L30-L31] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967301, lsw=4294967297, msw=4293918721, x=4294967301] [L33-L34] COND FALSE !((msw >= 0x00000000 && msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967301, lsw=4294967297, msw=4293918721, x=4294967301] [L37-L38] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L41] RET return 0; VAL [\old(x)=4294967301, \result=0, lsw=4294967297, msw=4293918721, x=4294967301] [L45] EXPR __fpclassify_double(x) VAL [\old(x)=4294967301, \old(y)=4294967300, __fpclassify_double(x)=0, x=4294967301, y=4294967300] [L45] COND TRUE __fpclassify_double(x) == 0 [L46] RET return y; VAL [\old(x)=4294967301, \old(y)=4294967300, \result=4294967300, x=4294967301, y=4294967300] [L64] EXPR fmin_double(x, y) VAL [fmin_double(x, y)=4294967300, x=4294967301, y=4294967300] [L64] double res = fmin_double(x, y); [L66] COND TRUE res != y VAL [res=4294967300, x=4294967301, y=4294967300] [L67] __VERIFIER_error() VAL [res=4294967300, x=4294967301, y=4294967300] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 54 locations, 1 error locations. UNSAFE Result, 1.0s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 175 SDtfs, 0 SDslu, 210 SDs, 0 SdLazy, 21 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 4609 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-40ef509 [2018-09-20 15:05:49,309 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 15:05:49,312 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 15:05:49,331 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 15:05:49,332 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 15:05:49,333 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 15:05:49,335 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 15:05:49,337 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 15:05:49,339 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 15:05:49,340 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 15:05:49,341 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 15:05:49,341 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 15:05:49,342 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 15:05:49,344 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 15:05:49,345 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 15:05:49,346 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 15:05:49,347 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 15:05:49,348 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 15:05:49,351 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 15:05:49,352 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 15:05:49,353 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 15:05:49,355 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 15:05:49,357 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 15:05:49,358 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 15:05:49,358 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 15:05:49,359 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 15:05:49,360 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 15:05:49,361 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 15:05:49,362 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 15:05:49,363 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 15:05:49,364 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 15:05:49,364 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 15:05:49,365 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 15:05:49,365 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 15:05:49,366 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 15:05:49,367 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 15:05:49,368 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-20 15:05:49,383 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 15:05:49,383 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 15:05:49,384 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 15:05:49,384 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 15:05:49,384 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 15:05:49,385 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 15:05:49,385 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 15:05:49,385 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 15:05:49,386 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 15:05:49,386 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 15:05:49,387 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 15:05:49,387 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 15:05:49,387 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 15:05:49,387 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 15:05:49,387 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-20 15:05:49,387 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-20 15:05:49,388 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 15:05:49,388 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 15:05:49,388 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 15:05:49,388 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 15:05:49,390 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 15:05:49,390 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 15:05:49,390 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 15:05:49,390 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:05:49,390 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 15:05:49,391 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 15:05:49,391 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 15:05:49,391 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-20 15:05:49,391 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 15:05:49,391 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-20 15:05:49,392 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-20 15:05:49,393 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ed1a983a62dc687cc3536bbaef83cafda1519f0d [2018-09-20 15:05:49,442 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 15:05:49,456 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 15:05:49,462 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 15:05:49,465 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 15:05:49,465 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 15:05:49,466 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1231a_true-unreach-call.c [2018-09-20 15:05:49,815 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b63d95fc/6fa4610ba9e54239953f0add96554d17/FLAG254160dc0 [2018-09-20 15:05:49,947 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 15:05:49,948 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1231a_true-unreach-call.c [2018-09-20 15:05:49,955 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b63d95fc/6fa4610ba9e54239953f0add96554d17/FLAG254160dc0 [2018-09-20 15:05:49,971 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b63d95fc/6fa4610ba9e54239953f0add96554d17 [2018-09-20 15:05:49,977 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 15:05:49,981 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 15:05:49,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 15:05:49,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 15:05:49,991 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 15:05:49,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:05:49" (1/1) ... [2018-09-20 15:05:49,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1664520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:49, skipping insertion in model container [2018-09-20 15:05:49,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:05:49" (1/1) ... [2018-09-20 15:05:50,009 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 15:05:50,223 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:05:50,243 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 15:05:50,270 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:05:50,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:50 WrapperNode [2018-09-20 15:05:50,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 15:05:50,322 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 15:05:50,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 15:05:50,323 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 15:05:50,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:50" (1/1) ... [2018-09-20 15:05:50,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:50" (1/1) ... [2018-09-20 15:05:50,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:50" (1/1) ... [2018-09-20 15:05:50,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:50" (1/1) ... [2018-09-20 15:05:50,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:50" (1/1) ... [2018-09-20 15:05:50,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:50" (1/1) ... [2018-09-20 15:05:50,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:50" (1/1) ... [2018-09-20 15:05:50,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 15:05:50,377 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 15:05:50,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 15:05:50,378 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 15:05:50,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:05:50,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 15:05:50,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 15:05:50,585 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-09-20 15:05:50,585 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-09-20 15:05:50,585 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_double [2018-09-20 15:05:50,585 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 15:05:50,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 15:05:50,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-20 15:05:50,586 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-09-20 15:05:50,586 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-09-20 15:05:50,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 15:05:50,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-20 15:05:50,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-20 15:05:50,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 15:05:50,587 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_double [2018-09-20 15:05:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 15:05:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 15:05:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 15:05:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-20 15:05:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-20 15:05:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-20 15:05:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-20 15:05:50,977 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:05:51,008 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:05:51,030 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:05:51,192 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 15:05:51,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:05:51 BoogieIcfgContainer [2018-09-20 15:05:51,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 15:05:51,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 15:05:51,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 15:05:51,197 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 15:05:51,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 03:05:49" (1/3) ... [2018-09-20 15:05:51,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d93568a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:05:51, skipping insertion in model container [2018-09-20 15:05:51,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:50" (2/3) ... [2018-09-20 15:05:51,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d93568a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:05:51, skipping insertion in model container [2018-09-20 15:05:51,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:05:51" (3/3) ... [2018-09-20 15:05:51,202 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231a_true-unreach-call.c [2018-09-20 15:05:51,213 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 15:05:51,222 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 15:05:51,273 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 15:05:51,274 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 15:05:51,274 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 15:05:51,274 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 15:05:51,275 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 15:05:51,275 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 15:05:51,275 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 15:05:51,275 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 15:05:51,275 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 15:05:51,295 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-09-20 15:05:51,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-20 15:05:51,303 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:51,304 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:05:51,307 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:51,312 INFO L82 PathProgramCache]: Analyzing trace with hash -883733309, now seen corresponding path program 1 times [2018-09-20 15:05:51,317 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:05:51,317 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-20 15:05:51,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:05:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:05:51,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:05:51,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:05:51,422 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:05:51,439 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:05:51,439 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 15:05:51,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 15:05:51,459 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 15:05:51,460 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:05:51,463 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2018-09-20 15:05:51,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:05:51,494 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2018-09-20 15:05:51,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 15:05:51,495 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-09-20 15:05:51,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:05:51,508 INFO L225 Difference]: With dead ends: 88 [2018-09-20 15:05:51,508 INFO L226 Difference]: Without dead ends: 46 [2018-09-20 15:05:51,512 INFO L606 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-09-20 15:05:51,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-20 15:05:51,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-20 15:05:51,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-20 15:05:51,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-09-20 15:05:51,566 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 25 [2018-09-20 15:05:51,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:05:51,567 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-09-20 15:05:51,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 15:05:51,567 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-09-20 15:05:51,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-20 15:05:51,573 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:51,573 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:05:51,573 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:51,574 INFO L82 PathProgramCache]: Analyzing trace with hash -2016097883, now seen corresponding path program 1 times [2018-09-20 15:05:51,575 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:05:51,576 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 15:05:51,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-20 15:05:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:05:51,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:05:51,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:05:51,778 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:05:51,792 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:05:51,792 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:05:51,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:05:51,797 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:05:51,798 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:05:51,798 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 4 states. [2018-09-20 15:05:51,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:05:51,947 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-09-20 15:05:51,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:05:51,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-09-20 15:05:51,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:05:51,953 INFO L225 Difference]: With dead ends: 55 [2018-09-20 15:05:51,953 INFO L226 Difference]: Without dead ends: 49 [2018-09-20 15:05:51,954 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:05:51,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-20 15:05:51,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-20 15:05:51,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-20 15:05:51,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-20 15:05:51,975 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 38 [2018-09-20 15:05:51,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:05:51,977 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-20 15:05:51,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:05:51,977 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-20 15:05:51,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-20 15:05:51,980 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:51,980 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:05:51,980 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:51,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1374149908, now seen corresponding path program 1 times [2018-09-20 15:05:51,983 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:05:51,983 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-20 15:05:51,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:05:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:05:52,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:05:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:05:52,181 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:05:52,196 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:05:52,196 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:05:52,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:05:52,197 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:05:52,197 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:05:52,199 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 4 states. [2018-09-20 15:05:52,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:05:52,299 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-09-20 15:05:52,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:05:52,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-09-20 15:05:52,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:05:52,302 INFO L225 Difference]: With dead ends: 58 [2018-09-20 15:05:52,302 INFO L226 Difference]: Without dead ends: 52 [2018-09-20 15:05:52,303 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:05:52,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-20 15:05:52,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-09-20 15:05:52,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-20 15:05:52,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-20 15:05:52,312 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 39 [2018-09-20 15:05:52,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:05:52,313 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-20 15:05:52,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:05:52,313 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-20 15:05:52,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-20 15:05:52,315 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:52,315 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:05:52,315 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:52,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1588482423, now seen corresponding path program 1 times [2018-09-20 15:05:52,316 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:05:52,316 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 15:05:52,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-09-20 15:05:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:05:52,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:05:52,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:05:52,441 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:05:52,455 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:05:52,456 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:05:52,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:05:52,457 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:05:52,458 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:05:52,458 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 4 states. [2018-09-20 15:05:52,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:05:52,609 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-09-20 15:05:52,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:05:52,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-09-20 15:05:52,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:05:52,613 INFO L225 Difference]: With dead ends: 58 [2018-09-20 15:05:52,613 INFO L226 Difference]: Without dead ends: 52 [2018-09-20 15:05:52,614 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:05:52,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-20 15:05:52,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-09-20 15:05:52,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-20 15:05:52,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-20 15:05:52,622 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 40 [2018-09-20 15:05:52,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:05:52,623 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-20 15:05:52,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:05:52,623 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-20 15:05:52,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-20 15:05:52,625 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:52,625 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:05:52,625 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:52,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1717260944, now seen corresponding path program 1 times [2018-09-20 15:05:52,626 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:05:52,626 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 15:05:52,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-20 15:05:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:05:52,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:05:52,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:05:52,749 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:05:52,763 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:05:52,763 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:05:52,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:05:52,764 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:05:52,764 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:05:52,765 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 4 states. [2018-09-20 15:05:52,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:05:52,825 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-09-20 15:05:52,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:05:52,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-09-20 15:05:52,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:05:52,828 INFO L225 Difference]: With dead ends: 58 [2018-09-20 15:05:52,828 INFO L226 Difference]: Without dead ends: 52 [2018-09-20 15:05:52,828 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:05:52,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-20 15:05:52,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-09-20 15:05:52,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-20 15:05:52,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-20 15:05:52,836 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 41 [2018-09-20 15:05:52,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:05:52,837 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-20 15:05:52,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:05:52,837 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-20 15:05:52,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-20 15:05:52,839 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:52,840 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:05:52,840 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:52,840 INFO L82 PathProgramCache]: Analyzing trace with hash -90193519, now seen corresponding path program 1 times [2018-09-20 15:05:52,841 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:05:52,841 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-20 15:05:52,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:05:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:05:52,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:05:53,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:05:53,379 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:05:53,395 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:05:53,395 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-20 15:05:53,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-20 15:05:53,396 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-20 15:05:53,396 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-09-20 15:05:53,397 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 9 states. [2018-09-20 15:05:54,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:05:54,743 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-09-20 15:05:54,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-20 15:05:54,744 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-09-20 15:05:54,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:05:54,747 INFO L225 Difference]: With dead ends: 55 [2018-09-20 15:05:54,747 INFO L226 Difference]: Without dead ends: 49 [2018-09-20 15:05:54,747 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-09-20 15:05:54,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-20 15:05:54,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-09-20 15:05:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-20 15:05:54,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-09-20 15:05:54,755 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 41 [2018-09-20 15:05:54,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:05:54,755 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-09-20 15:05:54,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-20 15:05:54,756 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-09-20 15:05:54,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-20 15:05:54,757 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:54,757 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:05:54,758 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:54,758 INFO L82 PathProgramCache]: Analyzing trace with hash -429778258, now seen corresponding path program 1 times [2018-09-20 15:05:54,758 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:05:54,759 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-09-20 15:05:54,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:05:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:05:54,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:05:54,974 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-20 15:05:54,975 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:05:54,990 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:05:54,990 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:05:54,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:05:54,991 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:05:54,991 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:05:54,991 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 4 states. [2018-09-20 15:05:55,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:05:55,087 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-09-20 15:05:55,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:05:55,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-09-20 15:05:55,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:05:55,089 INFO L225 Difference]: With dead ends: 55 [2018-09-20 15:05:55,090 INFO L226 Difference]: Without dead ends: 49 [2018-09-20 15:05:55,090 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:05:55,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-20 15:05:55,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-20 15:05:55,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-20 15:05:55,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-09-20 15:05:55,098 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 58 [2018-09-20 15:05:55,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:05:55,098 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-09-20 15:05:55,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:05:55,098 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-09-20 15:05:55,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-20 15:05:55,100 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:55,100 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:05:55,100 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:55,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1152900451, now seen corresponding path program 1 times [2018-09-20 15:05:55,101 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:05:55,101 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-09-20 15:05:55,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:05:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:05:55,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:05:55,255 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-20 15:05:55,255 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:05:55,266 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:05:55,267 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:05:55,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:05:55,267 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:05:55,268 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:05:55,268 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 4 states. [2018-09-20 15:05:55,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:05:55,320 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-09-20 15:05:55,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:05:55,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-09-20 15:05:55,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:05:55,323 INFO L225 Difference]: With dead ends: 58 [2018-09-20 15:05:55,323 INFO L226 Difference]: Without dead ends: 52 [2018-09-20 15:05:55,324 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:05:55,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-20 15:05:55,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-09-20 15:05:55,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-20 15:05:55,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-09-20 15:05:55,330 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 59 [2018-09-20 15:05:55,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:05:55,331 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-09-20 15:05:55,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:05:55,331 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-09-20 15:05:55,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-20 15:05:55,332 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:55,333 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:05:55,333 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:55,333 INFO L82 PathProgramCache]: Analyzing trace with hash 831452585, now seen corresponding path program 1 times [2018-09-20 15:05:55,334 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:05:55,334 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-09-20 15:05:55,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:05:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:05:55,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:05:55,622 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-20 15:05:55,622 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:05:55,637 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:05:55,637 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-20 15:05:55,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-20 15:05:55,638 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-20 15:05:55,638 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-20 15:05:55,638 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 5 states. [2018-09-20 15:05:56,122 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-09-20 15:05:56,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:05:56,318 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-09-20 15:05:56,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-20 15:05:56,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-09-20 15:05:56,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:05:56,320 INFO L225 Difference]: With dead ends: 56 [2018-09-20 15:05:56,320 INFO L226 Difference]: Without dead ends: 49 [2018-09-20 15:05:56,321 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-20 15:05:56,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-20 15:05:56,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-20 15:05:56,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-20 15:05:56,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-09-20 15:05:56,327 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 60 [2018-09-20 15:05:56,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:05:56,328 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-09-20 15:05:56,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-20 15:05:56,328 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-09-20 15:05:56,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-20 15:05:56,330 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:56,330 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:05:56,330 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:56,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1688507349, now seen corresponding path program 1 times [2018-09-20 15:05:56,331 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:05:56,331 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-09-20 15:05:56,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:05:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:05:56,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:05:56,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 15:05:56,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 15:05:56,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:05:56,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:05:56,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:05:56,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:05:56,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 15:05:56,598 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 16 treesize of output 4 [2018-09-20 15:05:56,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:05:56,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:05:56,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:05:56,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:05:57,234 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-20 15:05:57,751 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-20 15:05:57,773 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-20 15:05:57,773 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:05:57,789 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:05:57,790 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-20 15:05:57,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-20 15:05:57,790 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-20 15:05:57,792 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-09-20 15:05:57,792 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 13 states. [2018-09-20 15:06:00,148 WARN L178 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2018-09-20 15:06:00,512 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2018-09-20 15:06:00,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:00,759 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-09-20 15:06:00,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-20 15:06:00,760 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2018-09-20 15:06:00,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:00,761 INFO L225 Difference]: With dead ends: 60 [2018-09-20 15:06:00,761 INFO L226 Difference]: Without dead ends: 51 [2018-09-20 15:06:00,763 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-09-20 15:06:00,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-20 15:06:00,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-20 15:06:00,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-20 15:06:00,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-09-20 15:06:00,770 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 60 [2018-09-20 15:06:00,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:00,770 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-09-20 15:06:00,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-20 15:06:00,770 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-09-20 15:06:00,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-20 15:06:00,773 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:00,774 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:06:00,774 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:00,774 INFO L82 PathProgramCache]: Analyzing trace with hash -734735214, now seen corresponding path program 1 times [2018-09-20 15:06:00,775 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:00,775 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 15:06:00,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:00,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:00,980 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-20 15:06:00,980 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:00,991 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:00,991 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:06:00,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:06:00,992 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:06:00,992 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:00,992 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 4 states. [2018-09-20 15:06:01,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:01,106 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-09-20 15:06:01,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:06:01,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-09-20 15:06:01,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:01,108 INFO L225 Difference]: With dead ends: 60 [2018-09-20 15:06:01,108 INFO L226 Difference]: Without dead ends: 54 [2018-09-20 15:06:01,109 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:01,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-20 15:06:01,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-09-20 15:06:01,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-20 15:06:01,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-09-20 15:06:01,115 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 60 [2018-09-20 15:06:01,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:01,116 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-09-20 15:06:01,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:06:01,116 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-09-20 15:06:01,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-20 15:06:01,119 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:01,119 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:06:01,119 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:01,120 INFO L82 PathProgramCache]: Analyzing trace with hash -824232870, now seen corresponding path program 1 times [2018-09-20 15:06:01,120 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:01,121 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:01,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:01,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:01,720 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-20 15:06:01,721 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:01,731 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:01,731 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-20 15:06:01,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-20 15:06:01,732 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-20 15:06:01,732 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-20 15:06:01,733 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 10 states. [2018-09-20 15:06:02,191 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2018-09-20 15:06:02,576 WARN L178 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2018-09-20 15:06:02,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:02,701 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-09-20 15:06:02,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-20 15:06:02,702 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2018-09-20 15:06:02,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:02,704 INFO L225 Difference]: With dead ends: 57 [2018-09-20 15:06:02,704 INFO L226 Difference]: Without dead ends: 48 [2018-09-20 15:06:02,705 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-09-20 15:06:02,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-20 15:06:02,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-09-20 15:06:02,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-20 15:06:02,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-09-20 15:06:02,712 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 61 [2018-09-20 15:06:02,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:02,713 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-09-20 15:06:02,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-20 15:06:02,713 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-09-20 15:06:02,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-20 15:06:02,716 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:02,716 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:06:02,717 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:02,717 INFO L82 PathProgramCache]: Analyzing trace with hash 703601985, now seen corresponding path program 1 times [2018-09-20 15:06:02,717 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:02,717 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:02,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:02,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:02,844 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-20 15:06:02,844 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:02,855 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:02,855 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:06:02,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:06:02,856 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:06:02,856 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:02,856 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 4 states. [2018-09-20 15:06:02,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:02,917 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-09-20 15:06:02,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:06:02,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-09-20 15:06:02,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:02,919 INFO L225 Difference]: With dead ends: 55 [2018-09-20 15:06:02,919 INFO L226 Difference]: Without dead ends: 48 [2018-09-20 15:06:02,919 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:02,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-20 15:06:02,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-09-20 15:06:02,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-20 15:06:02,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-09-20 15:06:02,926 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 61 [2018-09-20 15:06:02,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:02,928 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-09-20 15:06:02,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:06:02,928 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-09-20 15:06:02,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-20 15:06:02,930 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:02,930 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:06:02,930 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:02,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1103852478, now seen corresponding path program 1 times [2018-09-20 15:06:02,931 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:02,931 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:02,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:03,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:03,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 15:06:03,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 15:06:03,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:03,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:03,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:03,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:06:03,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 15:06:03,204 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 16 treesize of output 4 [2018-09-20 15:06:03,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:03,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:03,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:03,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:06:03,644 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-20 15:06:03,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:06:03,753 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-09-20 15:06:03,879 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-20 15:06:04,354 WARN L178 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-20 15:06:04,497 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-20 15:06:04,497 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-20 15:06:04,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:04,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:04,581 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:04,582 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:04,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-20 15:06:04,593 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:04,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-20 15:06:04,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:04,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:04,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:04,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-20 15:06:04,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-09-20 15:06:04,804 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:04,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2018-09-20 15:06:04,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:04,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:04,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:04,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:14 [2018-09-20 15:06:05,002 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-20 15:06:05,003 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:06:05,166 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-09-20 15:06:05,289 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-20 15:06:05,400 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-20 15:06:05,519 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-20 15:06:05,663 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-09-20 15:06:05,765 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-09-20 15:06:06,717 WARN L178 SmtUtils]: Spent 951.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-09-20 15:06:07,838 WARN L178 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 30 [2018-09-20 15:06:07,893 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:07,918 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:07,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 58 [2018-09-20 15:06:07,950 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:07,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-09-20 15:06:08,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:08,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-09-20 15:06:08,042 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:08,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-09-20 15:06:08,046 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:08,054 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:08,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:08,160 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:08,163 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:08,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 58 [2018-09-20 15:06:08,180 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:08,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-09-20 15:06:08,196 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:08,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-09-20 15:06:08,239 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:08,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-09-20 15:06:08,244 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:08,248 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:08,255 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:08,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-09-20 15:06:08,281 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:81, output treesize:33 [2018-09-20 15:06:08,390 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:06:08,390 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-09-20 15:06:08,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-20 15:06:08,392 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-20 15:06:08,392 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-09-20 15:06:08,392 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 11 states. [2018-09-20 15:06:09,270 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-20 15:06:10,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:10,614 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-09-20 15:06:10,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-20 15:06:10,617 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2018-09-20 15:06:10,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:10,618 INFO L225 Difference]: With dead ends: 57 [2018-09-20 15:06:10,618 INFO L226 Difference]: Without dead ends: 46 [2018-09-20 15:06:10,619 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-09-20 15:06:10,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-20 15:06:10,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-20 15:06:10,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-20 15:06:10,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-09-20 15:06:10,624 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 61 [2018-09-20 15:06:10,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:10,626 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-09-20 15:06:10,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-20 15:06:10,626 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-09-20 15:06:10,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-20 15:06:10,627 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:10,627 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:06:10,629 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:10,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1414810853, now seen corresponding path program 1 times [2018-09-20 15:06:10,630 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:10,630 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:10,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:10,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:10,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 15:06:10,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 15:06:10,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:10,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:10,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:10,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:06:10,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 15:06:10,893 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 16 treesize of output 4 [2018-09-20 15:06:10,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:10,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:10,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:10,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:06:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-20 15:06:11,209 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:06:11,439 WARN L178 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-20 15:06:11,736 WARN L178 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-09-20 15:06:12,184 WARN L178 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-09-20 15:06:12,546 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-20 15:06:12,546 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-20 15:06:12,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:12,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:12,623 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:12,624 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:12,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-20 15:06:12,640 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:12,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-20 15:06:12,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:12,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:12,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:12,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-20 15:06:12,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-09-20 15:06:12,822 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:12,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2018-09-20 15:06:12,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:12,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:12,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:12,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:14 [2018-09-20 15:06:13,082 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-20 15:06:13,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:06:13,714 WARN L178 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2018-09-20 15:06:13,963 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-20 15:06:14,218 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-20 15:06:14,269 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:14,294 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:14,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 68 [2018-09-20 15:06:14,325 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:14,428 INFO L303 Elim1Store]: Index analysis took 129 ms [2018-09-20 15:06:14,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-09-20 15:06:14,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:14,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-09-20 15:06:14,662 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:14,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-09-20 15:06:14,682 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:14,708 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:14,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:14,971 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:14,975 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:14,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 63 [2018-09-20 15:06:14,985 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:15,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-09-20 15:06:15,005 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:15,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-09-20 15:06:15,060 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:15,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-09-20 15:06:15,065 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:15,070 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:15,085 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:15,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-09-20 15:06:15,132 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:101, output treesize:43 [2018-09-20 15:06:15,239 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:06:15,239 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-09-20 15:06:15,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-20 15:06:15,240 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-20 15:06:15,240 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-09-20 15:06:15,240 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 11 states. [2018-09-20 15:06:16,233 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-09-20 15:06:17,409 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-09-20 15:06:17,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:17,956 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-09-20 15:06:17,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-20 15:06:17,958 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-09-20 15:06:17,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:17,959 INFO L225 Difference]: With dead ends: 57 [2018-09-20 15:06:17,959 INFO L226 Difference]: Without dead ends: 46 [2018-09-20 15:06:17,960 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 119 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-09-20 15:06:17,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-20 15:06:17,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-20 15:06:17,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-20 15:06:17,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-09-20 15:06:17,967 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 62 [2018-09-20 15:06:17,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:17,969 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-09-20 15:06:17,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-20 15:06:17,969 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-09-20 15:06:17,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-20 15:06:17,970 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:17,970 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:06:17,970 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:17,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1915066658, now seen corresponding path program 1 times [2018-09-20 15:06:17,971 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:17,971 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:17,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:18,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:18,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 15:06:18,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 15:06:18,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:18,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:18,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:18,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:06:18,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 15:06:18,232 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 16 treesize of output 4 [2018-09-20 15:06:18,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:18,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:18,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:18,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:06:18,541 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-20 15:06:18,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:06:18,750 WARN L178 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2018-09-20 15:06:19,078 WARN L178 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-09-20 15:06:19,207 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-20 15:06:19,609 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-20 15:06:19,609 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-20 15:06:19,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:19,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:19,675 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:19,676 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:19,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-20 15:06:19,688 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:19,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-20 15:06:19,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:19,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:19,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:19,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-20 15:06:20,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-09-20 15:06:20,026 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:20,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2018-09-20 15:06:20,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:20,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:20,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:20,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:14 [2018-09-20 15:06:20,712 WARN L178 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-09-20 15:06:21,051 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-09-20 15:06:21,328 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-20 15:06:21,328 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:06:21,796 WARN L178 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2018-09-20 15:06:22,167 WARN L178 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-09-20 15:06:22,288 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-20 15:06:22,421 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-20 15:06:22,603 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-09-20 15:06:22,725 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-09-20 15:06:22,741 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:22,745 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:22,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 63 [2018-09-20 15:06:22,767 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:22,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-09-20 15:06:22,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:22,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-09-20 15:06:22,839 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:22,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-09-20 15:06:22,845 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:22,849 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:22,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:22,953 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:22,956 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:22,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 58 [2018-09-20 15:06:22,964 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:22,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-09-20 15:06:22,983 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:23,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-09-20 15:06:23,021 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:23,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-09-20 15:06:23,026 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:23,029 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:23,036 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:23,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-09-20 15:06:23,067 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:91, output treesize:38 [2018-09-20 15:06:23,173 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:06:23,173 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 14 [2018-09-20 15:06:23,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-20 15:06:23,174 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-20 15:06:23,174 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-09-20 15:06:23,174 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 14 states. [2018-09-20 15:06:24,869 WARN L178 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-09-20 15:06:25,210 WARN L178 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-09-20 15:06:26,776 WARN L178 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2018-09-20 15:06:26,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:26,943 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-09-20 15:06:26,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-20 15:06:26,945 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2018-09-20 15:06:26,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:26,946 INFO L225 Difference]: With dead ends: 57 [2018-09-20 15:06:26,946 INFO L226 Difference]: Without dead ends: 46 [2018-09-20 15:06:26,947 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 117 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2018-09-20 15:06:26,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-20 15:06:26,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-20 15:06:26,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-20 15:06:26,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-09-20 15:06:26,953 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 63 [2018-09-20 15:06:26,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:26,953 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-09-20 15:06:26,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-20 15:06:26,958 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-09-20 15:06:26,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-20 15:06:26,958 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:26,961 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:06:26,961 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:26,962 INFO L82 PathProgramCache]: Analyzing trace with hash 306391799, now seen corresponding path program 1 times [2018-09-20 15:06:26,962 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:26,962 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:26,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:27,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:27,125 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:27,129 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:27,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-20 15:06:27,151 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:27,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-20 15:06:27,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:27,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:27,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:27,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-20 15:06:27,383 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:27,384 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:27,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-09-20 15:06:27,393 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:27,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-09-20 15:06:27,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:27,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:27,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:27,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-09-20 15:06:27,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-09-20 15:06:27,539 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:27,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-09-20 15:06:27,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:27,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:27,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:27,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-09-20 15:06:30,376 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-20 15:06:30,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:06:31,146 WARN L178 SmtUtils]: Spent 766.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-09-20 15:06:31,306 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-09-20 15:06:31,509 WARN L178 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-09-20 15:06:31,706 WARN L178 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-09-20 15:06:31,973 WARN L178 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-20 15:06:32,218 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-09-20 15:06:32,769 WARN L178 SmtUtils]: Spent 550.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-09-20 15:06:32,818 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:32,840 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:32,865 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:32,887 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:32,889 INFO L303 Elim1Store]: Index analysis took 112 ms [2018-09-20 15:06:32,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 132 [2018-09-20 15:06:33,272 WARN L178 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2018-09-20 15:06:33,285 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:33,285 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:33,286 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:33,288 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:33,290 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:33,492 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2018-09-20 15:06:33,493 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_30 term size 40 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) 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.computeBackwardSequence(IterativePredicateTransformer.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) 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:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:198) 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:430) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:313) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-09-20 15:06:33,498 INFO L168 Benchmark]: Toolchain (without parser) took 43520.24 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 309.3 MB). Free memory was 947.8 MB in the beginning and 1.3 GB in the end (delta: -337.4 MB). Peak memory consumption was 417.3 MB. Max. memory is 11.5 GB. [2018-09-20 15:06:33,499 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:06:33,499 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.68 ms. Allocated memory is still 1.0 GB. Free memory was 947.8 MB in the beginning and 937.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-09-20 15:06:33,500 INFO L168 Benchmark]: Boogie Preprocessor took 54.53 ms. Allocated memory is still 1.0 GB. Free memory was 937.1 MB in the beginning and 931.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-09-20 15:06:33,500 INFO L168 Benchmark]: RCFGBuilder took 815.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 931.7 MB in the beginning and 1.1 GB in the end (delta: -187.7 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2018-09-20 15:06:33,500 INFO L168 Benchmark]: TraceAbstraction took 42303.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 155.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -165.8 MB). Peak memory consumption was 434.8 MB. Max. memory is 11.5 GB. [2018-09-20 15:06:33,503 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 339.68 ms. Allocated memory is still 1.0 GB. Free memory was 947.8 MB in the beginning and 937.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.53 ms. Allocated memory is still 1.0 GB. Free memory was 937.1 MB in the beginning and 931.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 815.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 931.7 MB in the beginning and 1.1 GB in the end (delta: -187.7 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 42303.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 155.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -165.8 MB). Peak memory consumption was 434.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_30 term size 40 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_30 term size 40: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...