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-69f5bdd-m [2018-09-18 11:25:13,479 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-18 11:25:13,481 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-18 11:25:13,493 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-18 11:25:13,494 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-18 11:25:13,495 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-18 11:25:13,496 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-18 11:25:13,498 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-18 11:25:13,500 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-18 11:25:13,501 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-18 11:25:13,502 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-18 11:25:13,502 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-18 11:25:13,503 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-18 11:25:13,504 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-18 11:25:13,505 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-18 11:25:13,506 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-18 11:25:13,507 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-18 11:25:13,509 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-18 11:25:13,511 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-18 11:25:13,512 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-18 11:25:13,513 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-18 11:25:13,515 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-18 11:25:13,517 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-18 11:25:13,517 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-18 11:25:13,518 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-18 11:25:13,519 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-18 11:25:13,520 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-18 11:25:13,520 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-18 11:25:13,521 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-18 11:25:13,522 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-18 11:25:13,523 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-18 11:25:13,523 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-18 11:25:13,524 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-18 11:25:13,524 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-18 11:25:13,525 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-18 11:25:13,525 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-18 11:25:13,526 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-18 11:25:13,555 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-18 11:25:13,555 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-18 11:25:13,556 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-18 11:25:13,556 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-18 11:25:13,557 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-18 11:25:13,557 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-18 11:25:13,557 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-18 11:25:13,557 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-18 11:25:13,559 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-18 11:25:13,559 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-18 11:25:13,560 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-18 11:25:13,560 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-18 11:25:13,561 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-18 11:25:13,561 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-18 11:25:13,561 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-18 11:25:13,561 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-18 11:25:13,561 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-18 11:25:13,562 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-18 11:25:13,562 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-18 11:25:13,562 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-18 11:25:13,562 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-18 11:25:13,564 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-18 11:25:13,564 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-18 11:25:13,564 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-18 11:25:13,565 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-18 11:25:13,565 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-18 11:25:13,565 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-18 11:25:13,565 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-18 11:25:13,566 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-18 11:25:13,566 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-18 11:25:13,566 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-18 11:25:13,566 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-18 11:25:13,566 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-18 11:25:13,567 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-18 11:25:13,620 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-18 11:25:13,646 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-18 11:25:13,652 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-18 11:25:13,654 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-18 11:25:13,654 INFO L276 PluginConnector]: CDTParser initialized [2018-09-18 11:25:13,655 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-18 11:25:13,995 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d46f3d95/8ffc41560f74469ba8e707ddd9b268e6/FLAG4d8da1a53 [2018-09-18 11:25:14,341 INFO L277 CDTParser]: Found 1 translation units. [2018-09-18 11:25:14,342 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label46_true-unreach-call.c [2018-09-18 11:25:14,362 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d46f3d95/8ffc41560f74469ba8e707ddd9b268e6/FLAG4d8da1a53 [2018-09-18 11:25:14,383 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d46f3d95/8ffc41560f74469ba8e707ddd9b268e6 [2018-09-18 11:25:14,395 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-18 11:25:14,398 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-18 11:25:14,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-18 11:25:14,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-18 11:25:14,409 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-18 11:25:14,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 11:25:14" (1/1) ... [2018-09-18 11:25:14,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64024991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:25:14, skipping insertion in model container [2018-09-18 11:25:14,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 11:25:14" (1/1) ... [2018-09-18 11:25:14,429 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-18 11:25:15,074 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-18 11:25:15,092 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-18 11:25:15,266 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-18 11:25:15,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:25:15 WrapperNode [2018-09-18 11:25:15,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-18 11:25:15,346 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-18 11:25:15,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-18 11:25:15,346 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-18 11:25:15,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:25:15" (1/1) ... [2018-09-18 11:25:15,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:25:15" (1/1) ... [2018-09-18 11:25:15,494 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-18 11:25:15,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-18 11:25:15,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-18 11:25:15,495 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-18 11:25:15,773 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:25:15" (1/1) ... [2018-09-18 11:25:15,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:25:15" (1/1) ... [2018-09-18 11:25:15,782 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:25:15" (1/1) ... [2018-09-18 11:25:15,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:25:15" (1/1) ... [2018-09-18 11:25:15,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:25:15" (1/1) ... [2018-09-18 11:25:15,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:25:15" (1/1) ... [2018-09-18 11:25:15,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:25:15" (1/1) ... [2018-09-18 11:25:15,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-18 11:25:15,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-18 11:25:15,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-18 11:25:15,908 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-18 11:25:15,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:25:15" (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-18 11:25:15,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-18 11:25:15,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-18 11:25:15,975 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-18 11:25:15,975 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-18 11:25:15,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-18 11:25:15,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-18 11:25:15,976 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-18 11:25:15,976 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-18 11:25:20,037 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-18 11:25:20,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 11:25:20 BoogieIcfgContainer [2018-09-18 11:25:20,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-18 11:25:20,039 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-18 11:25:20,039 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-18 11:25:20,042 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-18 11:25:20,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.09 11:25:14" (1/3) ... [2018-09-18 11:25:20,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a306541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 11:25:20, skipping insertion in model container [2018-09-18 11:25:20,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:25:15" (2/3) ... [2018-09-18 11:25:20,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a306541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 11:25:20, skipping insertion in model container [2018-09-18 11:25:20,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 11:25:20" (3/3) ... [2018-09-18 11:25:20,046 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label46_true-unreach-call.c [2018-09-18 11:25:20,056 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-18 11:25:20,064 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-18 11:25:20,119 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-18 11:25:20,120 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-18 11:25:20,120 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-18 11:25:20,120 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-18 11:25:20,121 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-18 11:25:20,121 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-18 11:25:20,121 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-18 11:25:20,121 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-18 11:25:20,122 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-18 11:25:20,150 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states. [2018-09-18 11:25:20,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-18 11:25:20,161 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:25:20,163 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-18 11:25:20,164 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:25:20,169 INFO L82 PathProgramCache]: Analyzing trace with hash 992823241, now seen corresponding path program 1 times [2018-09-18 11:25:20,172 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:25:20,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:25:20,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:25:20,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:25:20,223 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:25:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:25:20,714 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-18 11:25:20,716 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 11:25:20,717 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-18 11:25:20,717 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 11:25:20,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-18 11:25:20,738 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-18 11:25:20,739 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-18 11:25:20,741 INFO L87 Difference]: Start difference. First operand 293 states. Second operand 3 states. [2018-09-18 11:25:22,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 11:25:22,978 INFO L93 Difference]: Finished difference Result 782 states and 1372 transitions. [2018-09-18 11:25:22,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-18 11:25:22,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-09-18 11:25:22,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 11:25:23,001 INFO L225 Difference]: With dead ends: 782 [2018-09-18 11:25:23,002 INFO L226 Difference]: Without dead ends: 487 [2018-09-18 11:25:23,010 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-18 11:25:23,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-09-18 11:25:23,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 482. [2018-09-18 11:25:23,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-09-18 11:25:23,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 843 transitions. [2018-09-18 11:25:23,102 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 843 transitions. Word has length 69 [2018-09-18 11:25:23,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 11:25:23,103 INFO L480 AbstractCegarLoop]: Abstraction has 482 states and 843 transitions. [2018-09-18 11:25:23,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-18 11:25:23,103 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 843 transitions. [2018-09-18 11:25:23,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-18 11:25:23,112 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:25:23,113 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-18 11:25:23,113 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:25:23,114 INFO L82 PathProgramCache]: Analyzing trace with hash 742048031, now seen corresponding path program 1 times [2018-09-18 11:25:23,114 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:25:23,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:25:23,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:25:23,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:25:23,116 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:25:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:25:23,653 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-18 11:25:23,653 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 11:25:23,653 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-18 11:25:23,654 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 11:25:23,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-18 11:25:23,656 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-18 11:25:23,656 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-09-18 11:25:23,656 INFO L87 Difference]: Start difference. First operand 482 states and 843 transitions. Second operand 7 states. [2018-09-18 11:25:30,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 11:25:30,695 INFO L93 Difference]: Finished difference Result 1760 states and 3239 transitions. [2018-09-18 11:25:30,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-18 11:25:30,698 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 144 [2018-09-18 11:25:30,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 11:25:30,713 INFO L225 Difference]: With dead ends: 1760 [2018-09-18 11:25:30,714 INFO L226 Difference]: Without dead ends: 1284 [2018-09-18 11:25:30,721 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-09-18 11:25:30,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2018-09-18 11:25:30,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1037. [2018-09-18 11:25:30,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2018-09-18 11:25:30,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1685 transitions. [2018-09-18 11:25:30,823 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1685 transitions. Word has length 144 [2018-09-18 11:25:30,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 11:25:30,823 INFO L480 AbstractCegarLoop]: Abstraction has 1037 states and 1685 transitions. [2018-09-18 11:25:30,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-18 11:25:30,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1685 transitions. [2018-09-18 11:25:30,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-09-18 11:25:30,831 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:25:30,831 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-18 11:25:30,832 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:25:30,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1965616979, now seen corresponding path program 1 times [2018-09-18 11:25:30,832 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:25:30,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:25:30,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:25:30,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:25:30,834 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:25:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:25:31,203 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-18 11:25:31,274 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-18 11:25:31,274 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:25:31,274 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-18 11:25:31,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:25:31,285 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:25:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:25:31,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:25:31,810 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-18 11:25:31,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:25:32,714 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-18 11:25:32,735 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-18 11:25:32,735 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2018-09-18 11:25:32,735 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 11:25:32,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-18 11:25:32,736 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-18 11:25:32,737 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-18 11:25:32,737 INFO L87 Difference]: Start difference. First operand 1037 states and 1685 transitions. Second operand 5 states. [2018-09-18 11:25:38,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 11:25:38,349 INFO L93 Difference]: Finished difference Result 3395 states and 5619 transitions. [2018-09-18 11:25:38,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-18 11:25:38,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2018-09-18 11:25:38,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 11:25:38,372 INFO L225 Difference]: With dead ends: 3395 [2018-09-18 11:25:38,372 INFO L226 Difference]: Without dead ends: 2364 [2018-09-18 11:25:38,380 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 429 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-09-18 11:25:38,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2364 states. [2018-09-18 11:25:38,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2364 to 2323. [2018-09-18 11:25:38,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2323 states. [2018-09-18 11:25:38,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 3627 transitions. [2018-09-18 11:25:38,464 INFO L78 Accepts]: Start accepts. Automaton has 2323 states and 3627 transitions. Word has length 217 [2018-09-18 11:25:38,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 11:25:38,464 INFO L480 AbstractCegarLoop]: Abstraction has 2323 states and 3627 transitions. [2018-09-18 11:25:38,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-18 11:25:38,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 3627 transitions. [2018-09-18 11:25:38,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-09-18 11:25:38,474 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:25:38,474 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-18 11:25:38,474 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:25:38,475 INFO L82 PathProgramCache]: Analyzing trace with hash -645920121, now seen corresponding path program 1 times [2018-09-18 11:25:38,475 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:25:38,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:25:38,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:25:38,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:25:38,520 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:25:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:25:39,338 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-18 11:25:39,339 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:25:39,339 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-18 11:25:39,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:25:39,357 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:25:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:25:39,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:25:41,736 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-18 11:25:42,242 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-18 11:25:42,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:25:42,519 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-09-18 11:25:42,965 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-18 11:25:42,987 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-18 11:25:42,987 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 6] total 8 [2018-09-18 11:25:42,987 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 11:25:42,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-18 11:25:42,988 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-18 11:25:42,988 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2018-09-18 11:25:42,989 INFO L87 Difference]: Start difference. First operand 2323 states and 3627 transitions. Second operand 3 states. [2018-09-18 11:25:44,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 11:25:44,530 INFO L93 Difference]: Finished difference Result 6306 states and 10212 transitions. [2018-09-18 11:25:44,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-18 11:25:44,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-09-18 11:25:44,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 11:25:44,557 INFO L225 Difference]: With dead ends: 6306 [2018-09-18 11:25:44,558 INFO L226 Difference]: Without dead ends: 3989 [2018-09-18 11:25:44,575 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 521 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2018-09-18 11:25:44,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3989 states. [2018-09-18 11:25:44,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3989 to 3955. [2018-09-18 11:25:44,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3955 states. [2018-09-18 11:25:44,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3955 states to 3955 states and 6081 transitions. [2018-09-18 11:25:44,677 INFO L78 Accepts]: Start accepts. Automaton has 3955 states and 6081 transitions. Word has length 261 [2018-09-18 11:25:44,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 11:25:44,678 INFO L480 AbstractCegarLoop]: Abstraction has 3955 states and 6081 transitions. [2018-09-18 11:25:44,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-18 11:25:44,678 INFO L276 IsEmpty]: Start isEmpty. Operand 3955 states and 6081 transitions. [2018-09-18 11:25:44,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-09-18 11:25:44,693 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:25:44,693 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-18 11:25:44,693 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:25:44,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1933657177, now seen corresponding path program 1 times [2018-09-18 11:25:44,694 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:25:44,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:25:44,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:25:44,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:25:44,695 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:25:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:25:45,216 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-18 11:25:45,216 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:25:45,217 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-18 11:25:45,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:25:45,236 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:25:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:25:45,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:25:45,922 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-18 11:25:45,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:25:46,544 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-18 11:25:46,582 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-18 11:25:46,583 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2018-09-18 11:25:46,583 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 11:25:46,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-18 11:25:46,584 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-18 11:25:46,585 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-09-18 11:25:46,585 INFO L87 Difference]: Start difference. First operand 3955 states and 6081 transitions. Second operand 5 states. [2018-09-18 11:25:52,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 11:25:52,304 INFO L93 Difference]: Finished difference Result 10588 states and 16598 transitions. [2018-09-18 11:25:52,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-18 11:25:52,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 277 [2018-09-18 11:25:52,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 11:25:52,352 INFO L225 Difference]: With dead ends: 10588 [2018-09-18 11:25:52,352 INFO L226 Difference]: Without dead ends: 6639 [2018-09-18 11:25:52,379 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 548 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-09-18 11:25:52,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6639 states. [2018-09-18 11:25:52,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6639 to 6588. [2018-09-18 11:25:52,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6588 states. [2018-09-18 11:25:52,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6588 states to 6588 states and 9121 transitions. [2018-09-18 11:25:52,542 INFO L78 Accepts]: Start accepts. Automaton has 6588 states and 9121 transitions. Word has length 277 [2018-09-18 11:25:52,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 11:25:52,543 INFO L480 AbstractCegarLoop]: Abstraction has 6588 states and 9121 transitions. [2018-09-18 11:25:52,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-18 11:25:52,543 INFO L276 IsEmpty]: Start isEmpty. Operand 6588 states and 9121 transitions. [2018-09-18 11:25:52,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-09-18 11:25:52,572 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:25:52,573 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-18 11:25:52,573 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:25:52,573 INFO L82 PathProgramCache]: Analyzing trace with hash 2092355643, now seen corresponding path program 1 times [2018-09-18 11:25:52,573 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:25:52,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:25:52,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:25:52,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:25:52,575 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:25:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:25:52,965 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-18 11:25:52,966 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:25:52,966 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-18 11:25:52,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:25:52,979 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:25:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:25:53,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:25:53,253 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-18 11:25:53,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:25:53,659 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-18 11:25:53,679 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:25:53,680 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-18 11:25:53,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:25:53,696 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:25:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:25:53,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:25:54,163 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-18 11:25:54,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:25:54,477 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-18 11:25:54,479 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 11:25:54,480 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5, 5, 5] total 17 [2018-09-18 11:25:54,480 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 11:25:54,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-18 11:25:54,481 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-18 11:25:54,481 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-09-18 11:25:54,482 INFO L87 Difference]: Start difference. First operand 6588 states and 9121 transitions. Second operand 11 states. [2018-09-18 11:26:12,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 11:26:12,502 INFO L93 Difference]: Finished difference Result 29245 states and 55712 transitions. [2018-09-18 11:26:12,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-18 11:26:12,503 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 292 [2018-09-18 11:26:12,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 11:26:12,714 INFO L225 Difference]: With dead ends: 29245 [2018-09-18 11:26:12,714 INFO L226 Difference]: Without dead ends: 22663 [2018-09-18 11:26:12,871 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1269 GetRequests, 1195 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1786 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=975, Invalid=4427, Unknown=0, NotChecked=0, Total=5402 [2018-09-18 11:26:12,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22663 states. [2018-09-18 11:26:13,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22663 to 21471. [2018-09-18 11:26:13,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21471 states. [2018-09-18 11:26:13,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21471 states to 21471 states and 31013 transitions. [2018-09-18 11:26:13,931 INFO L78 Accepts]: Start accepts. Automaton has 21471 states and 31013 transitions. Word has length 292 [2018-09-18 11:26:13,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 11:26:13,931 INFO L480 AbstractCegarLoop]: Abstraction has 21471 states and 31013 transitions. [2018-09-18 11:26:13,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-18 11:26:13,931 INFO L276 IsEmpty]: Start isEmpty. Operand 21471 states and 31013 transitions. [2018-09-18 11:26:13,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-09-18 11:26:13,974 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:26:13,975 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-18 11:26:13,975 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:26:13,975 INFO L82 PathProgramCache]: Analyzing trace with hash 625405564, now seen corresponding path program 1 times [2018-09-18 11:26:13,976 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:26:13,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:26:13,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:26:13,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:26:13,977 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:26:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:26:14,910 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-18 11:26:14,910 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:26:14,910 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-18 11:26:14,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:26:14,921 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:26:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:26:15,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:26:16,586 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-18 11:26:16,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:26:16,963 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-18 11:26:16,984 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:26:16,984 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-18 11:26:17,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:26:17,001 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:26:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:26:17,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:26:18,416 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-18 11:26:18,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:26:18,893 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-18 11:26:18,895 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 11:26:18,896 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 5, 8, 5] total 21 [2018-09-18 11:26:18,896 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 11:26:18,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-18 11:26:18,897 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-18 11:26:18,897 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=351, Unknown=2, NotChecked=0, Total=420 [2018-09-18 11:26:18,898 INFO L87 Difference]: Start difference. First operand 21471 states and 31013 transitions. Second operand 15 states. [2018-09-18 11:26:28,306 WARN L178 SmtUtils]: Spent 532.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-18 11:26:54,532 WARN L178 SmtUtils]: Spent 553.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-09-18 11:26:59,639 WARN L178 SmtUtils]: Spent 580.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-18 11:27:51,011 WARN L178 SmtUtils]: Spent 537.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-18 11:28:03,744 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-18 11:29:17,268 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 Received shutdown request... [2018-09-18 11:29:35,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-18 11:29:35,855 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-18 11:29:35,861 WARN L206 ceAbstractionStarter]: Timeout [2018-09-18 11:29:35,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.09 11:29:35 BoogieIcfgContainer [2018-09-18 11:29:35,861 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-18 11:29:35,862 INFO L168 Benchmark]: Toolchain (without parser) took 261466.74 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 350.2 MB. Max. memory is 7.1 GB. [2018-09-18 11:29:35,863 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-18 11:29:35,864 INFO L168 Benchmark]: CACSL2BoogieTranslator took 946.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-09-18 11:29:35,866 INFO L168 Benchmark]: Boogie Procedure Inliner took 148.49 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-18 11:29:35,866 INFO L168 Benchmark]: Boogie Preprocessor took 411.93 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 831.0 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -954.7 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. [2018-09-18 11:29:35,869 INFO L168 Benchmark]: RCFGBuilder took 4130.38 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 170.4 MB). Peak memory consumption was 170.4 MB. Max. memory is 7.1 GB. [2018-09-18 11:29:35,870 INFO L168 Benchmark]: TraceAbstraction took 255822.85 ms. Allocated memory was 2.4 GB in the beginning and 3.1 GB in the end (delta: 680.5 MB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -472.2 MB). Peak memory consumption was 208.3 MB. Max. memory is 7.1 GB. [2018-09-18 11:29:35,875 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 946.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 148.49 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 411.93 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 831.0 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -954.7 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4130.38 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 170.4 MB). Peak memory consumption was 170.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 255822.85 ms. Allocated memory was 2.4 GB in the beginning and 3.1 GB in the end (delta: 680.5 MB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -472.2 MB). Peak memory consumption was 208.3 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 94 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (22077 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, 237.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1815 SDtfs, 13999 SDslu, 2274 SDs, 0 SdLazy, 23766 SolverSat, 5473 SolverUnsat, 66 SolverUnknown, 0 SolverNotchecked, 134.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4124 GetRequests, 3888 SyntacticMatches, 20 SemanticMatches, 216 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5802 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.5s AutomataMinimizationTime, 6 MinimizatonAttempts, 1570 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 14.0s 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-18_11-29-35-889.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-18_11-29-35-889.csv Completed graceful shutdown