java -Xmx8000000000 -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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label46_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-14 17:15:05,862 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-14 17:15:05,864 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-14 17:15:05,876 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-14 17:15:05,876 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-14 17:15:05,877 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-14 17:15:05,879 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-14 17:15:05,881 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-14 17:15:05,882 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-14 17:15:05,883 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-14 17:15:05,884 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-14 17:15:05,884 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-14 17:15:05,885 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-14 17:15:05,886 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-14 17:15:05,887 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-14 17:15:05,888 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-14 17:15:05,893 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-14 17:15:05,894 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-14 17:15:05,897 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-14 17:15:05,899 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-14 17:15:05,901 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-14 17:15:05,904 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-14 17:15:05,911 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-14 17:15:05,912 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-14 17:15:05,912 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-14 17:15:05,913 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-14 17:15:05,916 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-14 17:15:05,917 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-14 17:15:05,918 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-14 17:15:05,921 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-14 17:15:05,921 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-14 17:15:05,922 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-14 17:15:05,922 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-14 17:15:05,922 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-14 17:15:05,923 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-14 17:15:05,924 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-14 17:15:05,924 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-14 17:15:05,956 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-14 17:15:05,957 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-14 17:15:05,958 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-14 17:15:05,958 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-14 17:15:05,958 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-14 17:15:05,958 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-14 17:15:05,958 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-14 17:15:05,959 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-14 17:15:05,959 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-14 17:15:05,959 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-14 17:15:05,959 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-14 17:15:05,960 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-14 17:15:05,960 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-14 17:15:05,960 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-14 17:15:05,961 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-14 17:15:05,961 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-14 17:15:05,961 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-14 17:15:05,961 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-14 17:15:05,961 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-14 17:15:05,962 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-14 17:15:05,962 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-14 17:15:05,962 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-14 17:15:05,962 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-14 17:15:05,962 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-14 17:15:05,963 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-14 17:15:05,963 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-14 17:15:05,963 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-14 17:15:05,963 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-14 17:15:05,963 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-14 17:15:05,964 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-14 17:15:05,964 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-14 17:15:05,964 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-14 17:15:05,964 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-14 17:15:06,027 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-14 17:15:06,040 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-14 17:15:06,045 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-14 17:15:06,047 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-14 17:15:06,047 INFO L276 PluginConnector]: CDTParser initialized [2018-09-14 17:15:06,048 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label46_true-unreach-call.c [2018-09-14 17:15:06,393 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/559a11cc1/7d1535736a804d89a37bae1a73966364/FLAG7ae44279f [2018-09-14 17:15:06,715 INFO L277 CDTParser]: Found 1 translation units. [2018-09-14 17:15:06,716 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label46_true-unreach-call.c [2018-09-14 17:15:06,742 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/559a11cc1/7d1535736a804d89a37bae1a73966364/FLAG7ae44279f [2018-09-14 17:15:06,762 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/559a11cc1/7d1535736a804d89a37bae1a73966364 [2018-09-14 17:15:06,776 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-14 17:15:06,779 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-14 17:15:06,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-14 17:15:06,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-14 17:15:06,788 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-14 17:15:06,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 05:15:06" (1/1) ... [2018-09-14 17:15:06,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fc2c2f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:15:06, skipping insertion in model container [2018-09-14 17:15:06,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 05:15:06" (1/1) ... [2018-09-14 17:15:06,804 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-14 17:15:07,436 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 17:15:07,457 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-14 17:15:07,649 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 17:15:07,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:15:07 WrapperNode [2018-09-14 17:15:07,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-14 17:15:07,736 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-14 17:15:07,736 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-14 17:15:07,736 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-14 17:15:07,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:15:07" (1/1) ... [2018-09-14 17:15:07,794 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:15:07" (1/1) ... [2018-09-14 17:15:07,919 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-14 17:15:07,919 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-14 17:15:07,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-14 17:15:07,920 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-14 17:15:08,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:15:07" (1/1) ... [2018-09-14 17:15:08,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:15:07" (1/1) ... [2018-09-14 17:15:08,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:15:07" (1/1) ... [2018-09-14 17:15:08,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:15:07" (1/1) ... [2018-09-14 17:15:08,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:15:07" (1/1) ... [2018-09-14 17:15:08,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:15:07" (1/1) ... [2018-09-14 17:15:08,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:15:07" (1/1) ... [2018-09-14 17:15:08,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-14 17:15:08,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-14 17:15:08,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-14 17:15:08,295 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-14 17:15:08,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:15:07" (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-14 17:15:08,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-14 17:15:08,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-14 17:15:08,358 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-14 17:15:08,358 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-14 17:15:08,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-14 17:15:08,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-14 17:15:08,359 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-14 17:15:08,359 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-14 17:15:13,230 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-14 17:15:13,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 05:15:13 BoogieIcfgContainer [2018-09-14 17:15:13,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-14 17:15:13,234 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-14 17:15:13,234 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-14 17:15:13,240 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-14 17:15:13,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.09 05:15:06" (1/3) ... [2018-09-14 17:15:13,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f77915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 05:15:13, skipping insertion in model container [2018-09-14 17:15:13,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:15:07" (2/3) ... [2018-09-14 17:15:13,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f77915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 05:15:13, skipping insertion in model container [2018-09-14 17:15:13,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 05:15:13" (3/3) ... [2018-09-14 17:15:13,245 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label46_true-unreach-call.c [2018-09-14 17:15:13,256 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-14 17:15:13,269 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-14 17:15:13,330 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-14 17:15:13,331 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-14 17:15:13,331 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-14 17:15:13,332 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-14 17:15:13,332 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-14 17:15:13,332 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-14 17:15:13,332 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-14 17:15:13,332 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-14 17:15:13,333 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-14 17:15:13,364 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states. [2018-09-14 17:15:13,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-14 17:15:13,376 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:15:13,377 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:15:13,378 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:15:13,384 INFO L82 PathProgramCache]: Analyzing trace with hash 992823241, now seen corresponding path program 1 times [2018-09-14 17:15:13,387 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:15:13,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:15:13,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:15:13,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:15:13,433 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:15:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:15:13,876 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-14 17:15:13,879 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 17:15:13,879 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-14 17:15:13,879 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:15:13,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 17:15:13,901 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 17:15:13,902 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 17:15:13,905 INFO L87 Difference]: Start difference. First operand 293 states. Second operand 3 states. [2018-09-14 17:15:16,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:15:16,291 INFO L93 Difference]: Finished difference Result 782 states and 1372 transitions. [2018-09-14 17:15:16,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 17:15:16,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-09-14 17:15:16,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:15:16,312 INFO L225 Difference]: With dead ends: 782 [2018-09-14 17:15:16,312 INFO L226 Difference]: Without dead ends: 487 [2018-09-14 17:15:16,321 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 17:15:16,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-09-14 17:15:16,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 482. [2018-09-14 17:15:16,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-09-14 17:15:16,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 843 transitions. [2018-09-14 17:15:16,416 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 843 transitions. Word has length 69 [2018-09-14 17:15:16,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:15:16,417 INFO L480 AbstractCegarLoop]: Abstraction has 482 states and 843 transitions. [2018-09-14 17:15:16,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 17:15:16,417 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 843 transitions. [2018-09-14 17:15:16,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-14 17:15:16,426 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:15:16,426 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-14 17:15:16,427 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:15:16,427 INFO L82 PathProgramCache]: Analyzing trace with hash 742048031, now seen corresponding path program 1 times [2018-09-14 17:15:16,427 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:15:16,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:15:16,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:15:16,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:15:16,429 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:15:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:15:17,232 WARN L178 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-14 17:15:17,733 WARN L178 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-09-14 17:15:17,852 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:15:17,852 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 17:15:17,853 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-14 17:15:17,853 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:15:17,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-14 17:15:17,855 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-14 17:15:17,856 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-09-14 17:15:17,856 INFO L87 Difference]: Start difference. First operand 482 states and 843 transitions. Second operand 7 states. [2018-09-14 17:15:24,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:15:24,721 INFO L93 Difference]: Finished difference Result 1760 states and 3239 transitions. [2018-09-14 17:15:24,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-14 17:15:24,722 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 144 [2018-09-14 17:15:24,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:15:24,739 INFO L225 Difference]: With dead ends: 1760 [2018-09-14 17:15:24,739 INFO L226 Difference]: Without dead ends: 1284 [2018-09-14 17:15:24,745 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-09-14 17:15:24,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2018-09-14 17:15:24,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1037. [2018-09-14 17:15:24,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2018-09-14 17:15:24,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1685 transitions. [2018-09-14 17:15:24,851 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1685 transitions. Word has length 144 [2018-09-14 17:15:24,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:15:24,851 INFO L480 AbstractCegarLoop]: Abstraction has 1037 states and 1685 transitions. [2018-09-14 17:15:24,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-14 17:15:24,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1685 transitions. [2018-09-14 17:15:24,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-09-14 17:15:24,858 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:15:24,859 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:15:24,859 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:15:24,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1965616979, now seen corresponding path program 1 times [2018-09-14 17:15:24,859 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:15:24,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:15:24,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:15:24,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:15:24,861 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:15:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:15:25,194 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-14 17:15:25,258 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 124 proven. 68 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-14 17:15:25,258 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:15:25,259 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:15:25,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:15:25,274 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:15:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:15:25,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:15:25,928 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-09-14 17:15:25,929 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:15:26,141 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-09-14 17:15:26,672 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 124 proven. 68 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-14 17:15:26,693 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 17:15:26,694 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2018-09-14 17:15:26,694 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:15:26,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 17:15:26,695 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 17:15:26,695 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-14 17:15:26,696 INFO L87 Difference]: Start difference. First operand 1037 states and 1685 transitions. Second operand 5 states. [2018-09-14 17:15:32,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:15:32,348 INFO L93 Difference]: Finished difference Result 3395 states and 5619 transitions. [2018-09-14 17:15:32,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-14 17:15:32,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2018-09-14 17:15:32,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:15:32,365 INFO L225 Difference]: With dead ends: 3395 [2018-09-14 17:15:32,365 INFO L226 Difference]: Without dead ends: 2364 [2018-09-14 17:15:32,372 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 429 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-09-14 17:15:32,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2364 states. [2018-09-14 17:15:32,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2364 to 2323. [2018-09-14 17:15:32,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2323 states. [2018-09-14 17:15:32,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 3627 transitions. [2018-09-14 17:15:32,508 INFO L78 Accepts]: Start accepts. Automaton has 2323 states and 3627 transitions. Word has length 217 [2018-09-14 17:15:32,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:15:32,509 INFO L480 AbstractCegarLoop]: Abstraction has 2323 states and 3627 transitions. [2018-09-14 17:15:32,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 17:15:32,510 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 3627 transitions. [2018-09-14 17:15:32,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-09-14 17:15:32,517 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:15:32,517 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-14 17:15:32,518 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:15:32,519 INFO L82 PathProgramCache]: Analyzing trace with hash -645920121, now seen corresponding path program 1 times [2018-09-14 17:15:32,519 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:15:32,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:15:32,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:15:32,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:15:32,520 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:15:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:15:33,287 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 127 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-14 17:15:33,288 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:15:33,288 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:15:33,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:15:33,306 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:15:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:15:33,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:15:35,594 WARN L1001 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_24 Int)) (let ((.cse0 (div v_prenex_24 5))) (let ((.cse1 (mod .cse0 90))) (and (< .cse0 0) (<= |c_old(~a23~0)| v_prenex_24) (= 0 (mod v_prenex_24 5)) (= (mod (+ .cse0 1) 90) 0) (<= (+ c_~a23~0 41) .cse1) (not (= 0 .cse1)))))) (exists ((v_prenex_18 Int)) (let ((.cse3 (div v_prenex_18 5))) (let ((.cse2 (+ .cse3 1))) (and (<= c_~a23~0 (+ (mod .cse2 90) 49)) (<= 0 .cse2) (< v_prenex_18 0) (<= |c_old(~a23~0)| v_prenex_18) (not (= 0 (mod v_prenex_18 5))) (<= 0 .cse3))))) (exists ((v_prenex_13 Int)) (let ((.cse5 (div v_prenex_13 5))) (let ((.cse4 (mod .cse5 90))) (and (= 0 .cse4) (<= |c_old(~a23~0)| v_prenex_13) (= 0 (mod v_prenex_13 5)) (<= 0 (+ .cse5 1)) (<= c_~a23~0 (+ .cse4 49)))))) (exists ((v_prenex_8 Int)) (let ((.cse6 (div v_prenex_8 5))) (and (<= 0 v_prenex_8) (= (mod (+ .cse6 1) 90) 0) (<= 0 .cse6) (<= |c_old(~a23~0)| v_prenex_8) (<= c_~a23~0 (+ (mod .cse6 90) 49))))) (exists ((v_prenex_17 Int)) (let ((.cse9 (div v_prenex_17 5))) (let ((.cse8 (+ .cse9 1))) (let ((.cse7 (mod .cse8 90))) (and (< v_prenex_17 0) (<= (+ c_~a23~0 41) .cse7) (< .cse8 0) (<= |c_old(~a23~0)| v_prenex_17) (not (= 0 (mod v_prenex_17 5))) (= 0 (mod .cse9 90)) (not (= .cse7 0))))))) (exists ((v_prenex_4 Int)) (let ((.cse11 (div v_prenex_4 5))) (let ((.cse10 (mod (+ .cse11 1) 90))) (and (= .cse10 0) (< v_prenex_4 0) (<= c_~a23~0 (+ .cse10 49)) (= 0 (mod .cse11 90)) (not (= 0 (mod v_prenex_4 5))) (<= |c_old(~a23~0)| v_prenex_4))))) (exists ((v_prenex_26 Int)) (let ((.cse12 (div v_prenex_26 5))) (let ((.cse13 (mod .cse12 90))) (and (<= |c_old(~a23~0)| v_prenex_26) (<= 0 (+ .cse12 1)) (<= 0 v_prenex_26) (= 0 .cse13) (<= c_~a23~0 (+ .cse13 49)))))) (exists ((v_prenex_3 Int)) (let ((.cse14 (div v_prenex_3 5))) (let ((.cse15 (+ .cse14 1))) (and (<= c_~a23~0 (+ (mod .cse14 90) 49)) (<= 0 v_prenex_3) (<= 0 .cse14) (not (= (mod .cse15 90) 0)) (<= |c_old(~a23~0)| v_prenex_3) (< .cse15 0))))) (exists ((v_prenex_6 Int)) (let ((.cse17 (div v_prenex_6 5))) (let ((.cse16 (mod .cse17 90))) (and (= 0 .cse16) (<= c_~a23~0 (+ .cse16 49)) (= (mod (+ .cse17 1) 90) 0) (<= |c_old(~a23~0)| v_prenex_6) (<= 0 v_prenex_6))))) (exists ((v_prenex_11 Int)) (let ((.cse18 (div v_prenex_11 5))) (let ((.cse19 (mod .cse18 90)) (.cse20 (+ .cse18 1))) (and (< .cse18 0) (<= (+ c_~a23~0 41) .cse19) (not (= 0 .cse19)) (<= |c_old(~a23~0)| v_prenex_11) (<= 0 v_prenex_11) (not (= (mod .cse20 90) 0)) (< .cse20 0))))) (exists ((v_prenex_14 Int)) (let ((.cse22 (div v_prenex_14 5))) (let ((.cse21 (mod .cse22 90))) (and (<= (+ c_~a23~0 41) .cse21) (<= |c_old(~a23~0)| v_prenex_14) (<= 0 (+ .cse22 1)) (not (= 0 .cse21)) (< .cse22 0) (<= 0 v_prenex_14))))) (exists ((v_~a23~0_492 Int)) (let ((.cse24 (div v_~a23~0_492 5))) (let ((.cse23 (+ .cse24 1))) (let ((.cse25 (mod .cse23 90))) (and (< .cse23 0) (<= 0 .cse24) (< v_~a23~0_492 0) (<= |c_old(~a23~0)| v_~a23~0_492) (<= (+ c_~a23~0 41) .cse25) (not (= .cse25 0)) (not (= 0 (mod v_~a23~0_492 5)))))))) (exists ((v_prenex_19 Int)) (let ((.cse26 (div v_prenex_19 5))) (let ((.cse27 (mod .cse26 90)) (.cse28 (+ .cse26 1))) (and (< .cse26 0) (not (= 0 .cse27)) (<= (+ c_~a23~0 41) .cse27) (= 0 (mod v_prenex_19 5)) (< .cse28 0) (not (= (mod .cse28 90) 0)) (<= |c_old(~a23~0)| v_prenex_19))))) (exists ((v_prenex_22 Int)) (let ((.cse29 (div v_prenex_22 5))) (and (<= |c_old(~a23~0)| v_prenex_22) (<= 0 .cse29) (<= 0 (+ .cse29 1)) (<= 0 v_prenex_22) (<= c_~a23~0 (+ (mod .cse29 90) 49))))) (exists ((v_prenex_5 Int)) (let ((.cse31 (div v_prenex_5 5))) (let ((.cse30 (mod .cse31 90))) (and (<= (+ c_~a23~0 41) .cse30) (< .cse31 0) (<= 0 v_prenex_5) (= (mod (+ .cse31 1) 90) 0) (<= |c_old(~a23~0)| v_prenex_5) (not (= 0 .cse30)))))) (exists ((v_prenex_20 Int)) (let ((.cse33 (div v_prenex_20 5))) (let ((.cse32 (+ .cse33 1))) (and (<= c_~a23~0 (+ (mod .cse32 90) 49)) (< v_prenex_20 0) (<= |c_old(~a23~0)| v_prenex_20) (not (= 0 (mod v_prenex_20 5))) (= 0 (mod .cse33 90)) (<= 0 .cse32))))) (exists ((v_prenex_15 Int)) (let ((.cse34 (div v_prenex_15 5))) (let ((.cse35 (+ .cse34 1))) (and (<= 0 .cse34) (<= c_~a23~0 (+ (mod .cse34 90) 49)) (<= |c_old(~a23~0)| v_prenex_15) (< .cse35 0) (= 0 (mod v_prenex_15 5)) (not (= (mod .cse35 90) 0)))))) (exists ((v_prenex_16 Int)) (let ((.cse37 (div v_prenex_16 5))) (let ((.cse36 (mod .cse37 90))) (and (<= |c_old(~a23~0)| v_prenex_16) (<= c_~a23~0 (+ .cse36 49)) (= 0 (mod v_prenex_16 5)) (= (mod (+ .cse37 1) 90) 0) (= 0 .cse36))))) (exists ((v_prenex_23 Int)) (let ((.cse39 (div v_prenex_23 5))) (let ((.cse38 (mod .cse39 90))) (and (not (= 0 .cse38)) (<= |c_old(~a23~0)| v_prenex_23) (<= (+ c_~a23~0 41) .cse38) (= 0 (mod v_prenex_23 5)) (< .cse39 0) (<= 0 (+ .cse39 1)))))) (exists ((v_prenex_9 Int)) (let ((.cse41 (div v_prenex_9 5))) (let ((.cse40 (mod (+ .cse41 1) 90))) (and (<= |c_old(~a23~0)| v_prenex_9) (= .cse40 0) (< v_prenex_9 0) (< .cse41 0) (<= c_~a23~0 (+ .cse40 49)) (not (= 0 (mod .cse41 90))) (not (= 0 (mod v_prenex_9 5))))))) (exists ((v_prenex_7 Int)) (let ((.cse44 (div v_prenex_7 5))) (let ((.cse42 (+ .cse44 1)) (.cse43 (mod .cse44 90))) (and (= 0 (mod v_prenex_7 5)) (not (= (mod .cse42 90) 0)) (= 0 .cse43) (< .cse42 0) (<= |c_old(~a23~0)| v_prenex_7) (<= c_~a23~0 (+ .cse43 49)))))) (exists ((v_prenex_1 Int)) (let ((.cse45 (div v_prenex_1 5))) (and (<= 0 (+ .cse45 1)) (<= c_~a23~0 (+ (mod .cse45 90) 49)) (= 0 (mod v_prenex_1 5)) (<= 0 .cse45) (<= |c_old(~a23~0)| v_prenex_1)))) (exists ((v_prenex_2 Int)) (let ((.cse46 (div v_prenex_2 5))) (let ((.cse48 (+ .cse46 1))) (let ((.cse47 (mod .cse48 90))) (and (not (= 0 (mod .cse46 90))) (<= |c_old(~a23~0)| v_prenex_2) (not (= .cse47 0)) (<= (+ c_~a23~0 41) .cse47) (< v_prenex_2 0) (< .cse48 0) (< .cse46 0) (not (= 0 (mod v_prenex_2 5)))))))) (exists ((v_prenex_10 Int)) (let ((.cse51 (div v_prenex_10 5))) (let ((.cse50 (+ .cse51 1)) (.cse49 (mod .cse51 90))) (and (= 0 .cse49) (<= 0 v_prenex_10) (not (= (mod .cse50 90) 0)) (< .cse50 0) (<= c_~a23~0 (+ .cse49 49)) (<= |c_old(~a23~0)| v_prenex_10))))) (exists ((v_prenex_25 Int)) (let ((.cse53 (div v_prenex_25 5))) (let ((.cse52 (mod (+ .cse53 1) 90))) (and (not (= 0 (mod v_prenex_25 5))) (< v_prenex_25 0) (<= c_~a23~0 (+ .cse52 49)) (<= |c_old(~a23~0)| v_prenex_25) (<= 0 .cse53) (= .cse52 0))))) (exists ((v_prenex_12 Int)) (let ((.cse54 (div v_prenex_12 5))) (let ((.cse55 (+ .cse54 1))) (and (<= |c_old(~a23~0)| v_prenex_12) (< .cse54 0) (<= 0 .cse55) (<= c_~a23~0 (+ (mod .cse55 90) 49)) (not (= 0 (mod v_prenex_12 5))) (not (= 0 (mod .cse54 90))) (< v_prenex_12 0))))) (exists ((v_prenex_21 Int)) (let ((.cse56 (div v_prenex_21 5))) (and (<= 0 .cse56) (= (mod (+ .cse56 1) 90) 0) (= 0 (mod v_prenex_21 5)) (<= |c_old(~a23~0)| v_prenex_21) (<= c_~a23~0 (+ (mod .cse56 90) 49)))))) is different from true [2018-09-14 17:15:36,138 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 72 trivial. 2 not checked. [2018-09-14 17:15:36,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:15:36,528 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-14 17:15:36,548 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 17:15:36,549 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 6] total 8 [2018-09-14 17:15:36,549 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:15:36,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 17:15:36,550 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 17:15:36,550 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2018-09-14 17:15:36,550 INFO L87 Difference]: Start difference. First operand 2323 states and 3627 transitions. Second operand 3 states. [2018-09-14 17:15:38,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:15:38,122 INFO L93 Difference]: Finished difference Result 6306 states and 10212 transitions. [2018-09-14 17:15:38,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 17:15:38,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-09-14 17:15:38,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:15:38,150 INFO L225 Difference]: With dead ends: 6306 [2018-09-14 17:15:38,150 INFO L226 Difference]: Without dead ends: 3989 [2018-09-14 17:15:38,167 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 521 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2018-09-14 17:15:38,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3989 states. [2018-09-14 17:15:38,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3989 to 3955. [2018-09-14 17:15:38,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3955 states. [2018-09-14 17:15:38,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3955 states to 3955 states and 6081 transitions. [2018-09-14 17:15:38,272 INFO L78 Accepts]: Start accepts. Automaton has 3955 states and 6081 transitions. Word has length 261 [2018-09-14 17:15:38,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:15:38,272 INFO L480 AbstractCegarLoop]: Abstraction has 3955 states and 6081 transitions. [2018-09-14 17:15:38,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 17:15:38,273 INFO L276 IsEmpty]: Start isEmpty. Operand 3955 states and 6081 transitions. [2018-09-14 17:15:38,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-09-14 17:15:38,288 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:15:38,288 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:15:38,288 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:15:38,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1933657177, now seen corresponding path program 1 times [2018-09-14 17:15:38,289 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:15:38,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:15:38,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:15:38,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:15:38,290 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:15:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:15:38,606 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 213 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:15:38,607 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:15:38,607 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:15:38,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:15:38,617 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:15:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:15:38,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:15:39,102 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 125 proven. 2 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-09-14 17:15:39,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:15:39,535 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-09-14 17:15:39,555 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 17:15:39,556 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2018-09-14 17:15:39,556 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:15:39,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 17:15:39,557 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 17:15:39,557 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-09-14 17:15:39,557 INFO L87 Difference]: Start difference. First operand 3955 states and 6081 transitions. Second operand 5 states. [2018-09-14 17:15:42,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:15:42,564 INFO L93 Difference]: Finished difference Result 10588 states and 16598 transitions. [2018-09-14 17:15:42,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-14 17:15:42,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 277 [2018-09-14 17:15:42,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:15:42,604 INFO L225 Difference]: With dead ends: 10588 [2018-09-14 17:15:42,604 INFO L226 Difference]: Without dead ends: 6639 [2018-09-14 17:15:42,631 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 548 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-09-14 17:15:42,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6639 states. [2018-09-14 17:15:42,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6639 to 6588. [2018-09-14 17:15:42,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6588 states. [2018-09-14 17:15:42,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6588 states to 6588 states and 9121 transitions. [2018-09-14 17:15:42,807 INFO L78 Accepts]: Start accepts. Automaton has 6588 states and 9121 transitions. Word has length 277 [2018-09-14 17:15:42,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:15:42,808 INFO L480 AbstractCegarLoop]: Abstraction has 6588 states and 9121 transitions. [2018-09-14 17:15:42,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 17:15:42,808 INFO L276 IsEmpty]: Start isEmpty. Operand 6588 states and 9121 transitions. [2018-09-14 17:15:42,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-09-14 17:15:42,847 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:15:42,847 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 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-14 17:15:42,848 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:15:42,848 INFO L82 PathProgramCache]: Analyzing trace with hash 2092355643, now seen corresponding path program 1 times [2018-09-14 17:15:42,848 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:15:42,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:15:42,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:15:42,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:15:42,851 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:15:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:15:43,326 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 129 proven. 83 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-14 17:15:43,327 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:15:43,327 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:15:43,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:15:43,340 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:15:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:15:43,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:15:43,572 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 213 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:15:43,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:15:43,865 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 213 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:15:43,886 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:15:43,887 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 17:15:43,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:15:43,905 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:15:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:15:44,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:15:44,885 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-09-14 17:15:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 213 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:15:44,956 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:15:45,280 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-14 17:15:45,415 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-14 17:15:45,783 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 213 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:15:45,785 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 17:15:45,786 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5, 5, 5] total 17 [2018-09-14 17:15:45,786 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 17:15:45,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-14 17:15:45,787 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-14 17:15:45,788 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-09-14 17:15:45,788 INFO L87 Difference]: Start difference. First operand 6588 states and 9121 transitions. Second operand 11 states. [2018-09-14 17:16:03,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:16:03,436 INFO L93 Difference]: Finished difference Result 29245 states and 55712 transitions. [2018-09-14 17:16:03,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-14 17:16:03,436 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 292 [2018-09-14 17:16:03,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:16:03,652 INFO L225 Difference]: With dead ends: 29245 [2018-09-14 17:16:03,653 INFO L226 Difference]: Without dead ends: 22663 [2018-09-14 17:16:03,806 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1269 GetRequests, 1195 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1786 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=975, Invalid=4427, Unknown=0, NotChecked=0, Total=5402 [2018-09-14 17:16:03,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22663 states. [2018-09-14 17:16:04,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22663 to 21471. [2018-09-14 17:16:04,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21471 states. [2018-09-14 17:16:04,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21471 states to 21471 states and 31013 transitions. [2018-09-14 17:16:04,864 INFO L78 Accepts]: Start accepts. Automaton has 21471 states and 31013 transitions. Word has length 292 [2018-09-14 17:16:04,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:16:04,865 INFO L480 AbstractCegarLoop]: Abstraction has 21471 states and 31013 transitions. [2018-09-14 17:16:04,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-14 17:16:04,865 INFO L276 IsEmpty]: Start isEmpty. Operand 21471 states and 31013 transitions. [2018-09-14 17:16:04,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-09-14 17:16:04,907 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:16:04,907 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:16:04,908 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:16:04,908 INFO L82 PathProgramCache]: Analyzing trace with hash 625405564, now seen corresponding path program 1 times [2018-09-14 17:16:04,908 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:16:04,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:16:04,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:16:04,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:16:04,909 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:16:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:16:05,695 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 131 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-09-14 17:16:05,696 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:16:05,696 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:16:05,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:16:05,707 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:16:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:16:05,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:16:07,418 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 125 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:16:07,418 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:16:07,693 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 222 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:16:07,714 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:16:07,714 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 17:16:07,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:16:07,730 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:16:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:16:07,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:16:10,052 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 125 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:16:10,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:16:10,252 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 222 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:16:10,255 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 17:16:10,256 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 5, 8, 5] total 21 [2018-09-14 17:16:10,256 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 17:16:10,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-14 17:16:10,258 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-14 17:16:10,258 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=351, Unknown=2, NotChecked=0, Total=420 [2018-09-14 17:16:10,258 INFO L87 Difference]: Start difference. First operand 21471 states and 31013 transitions. Second operand 15 states. [2018-09-14 17:16:18,874 WARN L178 SmtUtils]: Spent 528.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-14 17:16:49,120 WARN L178 SmtUtils]: Spent 543.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-14 17:17:04,876 WARN L178 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 21 [2018-09-14 17:17:40,075 WARN L178 SmtUtils]: Spent 554.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-14 17:19:27,474 WARN L178 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 29 DAG size of output: 27 Received shutdown request... [2018-09-14 17:19:29,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-14 17:19:29,103 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-14 17:19:29,109 WARN L206 ceAbstractionStarter]: Timeout [2018-09-14 17:19:29,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.09 05:19:29 BoogieIcfgContainer [2018-09-14 17:19:29,110 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-14 17:19:29,111 INFO L168 Benchmark]: Toolchain (without parser) took 262334.73 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 309.3 MB. Max. memory is 7.1 GB. [2018-09-14 17:19:29,112 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-14 17:19:29,113 INFO L168 Benchmark]: CACSL2BoogieTranslator took 955.28 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2018-09-14 17:19:29,113 INFO L168 Benchmark]: Boogie Procedure Inliner took 183.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-14 17:19:29,114 INFO L168 Benchmark]: Boogie Preprocessor took 375.34 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 809.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -922.2 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2018-09-14 17:19:29,115 INFO L168 Benchmark]: RCFGBuilder took 4937.85 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 170.2 MB). Peak memory consumption was 170.2 MB. Max. memory is 7.1 GB. [2018-09-14 17:19:29,116 INFO L168 Benchmark]: TraceAbstraction took 255876.42 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 782.8 MB). Free memory was 2.1 GB in the beginning and 2.7 GB in the end (delta: -615.0 MB). Peak memory consumption was 167.7 MB. Max. memory is 7.1 GB. [2018-09-14 17:19:29,121 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.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 955.28 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 183.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 375.34 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 809.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -922.2 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4937.85 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 170.2 MB). Peak memory consumption was 170.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 255876.42 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 782.8 MB). Free memory was 2.1 GB in the beginning and 2.7 GB in the end (delta: -615.0 MB). Peak memory consumption was 167.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 192]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 192). Cancelled while BasicCegarLoop was constructing difference of abstraction (21471states) and FLOYD_HOARE automaton (currently 95 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (23290 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 293 locations, 1 error locations. TIMEOUT Result, 255.7s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 236.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1819 SDtfs, 14121 SDslu, 2297 SDs, 0 SdLazy, 24031 SolverSat, 5519 SolverUnsat, 69 SolverUnknown, 0 SolverNotchecked, 134.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4125 GetRequests, 3888 SyntacticMatches, 20 SemanticMatches, 217 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5882 ImplicationChecksByTransitivity, 103.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21471occurred in iteration=6, 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: 1.6s AutomataMinimizationTime, 6 MinimizatonAttempts, 1570 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 3502 NumberOfCodeBlocks, 3502 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 5422 ConstructedInterpolants, 10 QuantifiedInterpolants, 5777857 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3400 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 21 InterpolantComputations, 5 PerfectInterpolantSequences, 3272/4090 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem11_label46_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-14_17-19-29-136.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem11_label46_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-14_17-19-29-136.csv Completed graceful shutdown