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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 01:08:50,093 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 01:08:50,096 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 01:08:50,115 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 01:08:50,116 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 01:08:50,117 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 01:08:50,118 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 01:08:50,121 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 01:08:50,123 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 01:08:50,124 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 01:08:50,125 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 01:08:50,125 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 01:08:50,126 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 01:08:50,127 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 01:08:50,128 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 01:08:50,129 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 01:08:50,130 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 01:08:50,132 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 01:08:50,134 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 01:08:50,135 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 01:08:50,138 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 01:08:50,140 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 01:08:50,144 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 01:08:50,144 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 01:08:50,144 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 01:08:50,145 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 01:08:50,148 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 01:08:50,150 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 01:08:50,151 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 01:08:50,154 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 01:08:50,154 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 01:08:50,155 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 01:08:50,156 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 01:08:50,156 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 01:08:50,157 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 01:08:50,157 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 01:08:50,158 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 01:08:50,188 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 01:08:50,188 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 01:08:50,189 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 01:08:50,190 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 01:08:50,190 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 01:08:50,190 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 01:08:50,190 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 01:08:50,190 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 01:08:50,191 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 01:08:50,191 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 01:08:50,192 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 01:08:50,192 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 01:08:50,193 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 01:08:50,193 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 01:08:50,193 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 01:08:50,193 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 01:08:50,193 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 01:08:50,195 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 01:08:50,196 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 01:08:50,196 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 01:08:50,196 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 01:08:50,196 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 01:08:50,196 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 01:08:50,197 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 01:08:50,197 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 01:08:50,197 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 01:08:50,197 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 01:08:50,197 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 01:08:50,198 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 01:08:50,198 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 01:08:50,198 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 01:08:50,198 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 01:08:50,198 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 01:08:50,199 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 01:08:50,255 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 01:08:50,273 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 01:08:50,278 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 01:08:50,280 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 01:08:50,280 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 01:08:50,281 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c [2018-11-07 01:08:50,352 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42fdf6923/b0e7e5a84f8648d29e484f8bc2a813bd/FLAG3e56b369e [2018-11-07 01:08:50,947 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 01:08:50,948 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c [2018-11-07 01:08:50,972 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42fdf6923/b0e7e5a84f8648d29e484f8bc2a813bd/FLAG3e56b369e [2018-11-07 01:08:50,988 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42fdf6923/b0e7e5a84f8648d29e484f8bc2a813bd [2018-11-07 01:08:50,999 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 01:08:51,001 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 01:08:51,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 01:08:51,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 01:08:51,006 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 01:08:51,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:08:50" (1/1) ... [2018-11-07 01:08:51,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aafeee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:51, skipping insertion in model container [2018-11-07 01:08:51,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:08:50" (1/1) ... [2018-11-07 01:08:51,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 01:08:51,075 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 01:08:51,617 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 01:08:51,622 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 01:08:51,728 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 01:08:51,758 INFO L193 MainTranslator]: Completed translation [2018-11-07 01:08:51,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:51 WrapperNode [2018-11-07 01:08:51,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 01:08:51,759 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 01:08:51,759 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 01:08:51,760 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 01:08:51,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:51" (1/1) ... [2018-11-07 01:08:51,788 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:51" (1/1) ... [2018-11-07 01:08:51,891 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 01:08:51,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 01:08:51,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 01:08:51,892 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 01:08:51,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:51" (1/1) ... [2018-11-07 01:08:51,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:51" (1/1) ... [2018-11-07 01:08:51,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:51" (1/1) ... [2018-11-07 01:08:51,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:51" (1/1) ... [2018-11-07 01:08:51,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:51" (1/1) ... [2018-11-07 01:08:51,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:51" (1/1) ... [2018-11-07 01:08:51,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:51" (1/1) ... [2018-11-07 01:08:52,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 01:08:52,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 01:08:52,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 01:08:52,008 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 01:08:52,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:51" (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-11-07 01:08:52,095 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 01:08:52,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 01:08:52,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 01:08:52,096 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 01:08:52,096 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 01:08:52,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 01:08:52,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 01:08:52,097 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 01:08:52,097 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 01:08:55,453 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 01:08:55,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:08:55 BoogieIcfgContainer [2018-11-07 01:08:55,454 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 01:08:55,455 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 01:08:55,455 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 01:08:55,459 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 01:08:55,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:08:50" (1/3) ... [2018-11-07 01:08:55,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed04fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:08:55, skipping insertion in model container [2018-11-07 01:08:55,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:51" (2/3) ... [2018-11-07 01:08:55,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed04fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:08:55, skipping insertion in model container [2018-11-07 01:08:55,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:08:55" (3/3) ... [2018-11-07 01:08:55,463 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label06_true-unreach-call_false-termination.c [2018-11-07 01:08:55,474 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 01:08:55,483 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 01:08:55,499 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 01:08:55,538 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 01:08:55,538 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 01:08:55,539 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 01:08:55,539 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 01:08:55,539 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 01:08:55,539 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 01:08:55,539 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 01:08:55,540 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 01:08:55,569 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-07 01:08:55,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-07 01:08:55,587 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:08:55,589 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 01:08:55,592 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:08:55,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:08:55,599 INFO L82 PathProgramCache]: Analyzing trace with hash -247147345, now seen corresponding path program 1 times [2018-11-07 01:08:55,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:08:55,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:08:55,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:08:55,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:08:55,655 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:08:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:08:56,309 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 01:08:56,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:08:56,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:08:56,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 01:08:56,503 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:08:56,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 01:08:56,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 01:08:56,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 01:08:56,532 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-07 01:08:57,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:08:57,876 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-11-07 01:08:57,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 01:08:57,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2018-11-07 01:08:57,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:08:57,898 INFO L225 Difference]: With dead ends: 621 [2018-11-07 01:08:57,898 INFO L226 Difference]: Without dead ends: 382 [2018-11-07 01:08:57,905 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 01:08:57,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-07 01:08:57,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-11-07 01:08:57,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-07 01:08:57,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-11-07 01:08:58,001 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 147 [2018-11-07 01:08:58,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:08:58,003 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-11-07 01:08:58,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 01:08:58,003 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-11-07 01:08:58,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-07 01:08:58,012 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:08:58,012 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 01:08:58,013 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:08:58,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:08:58,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1882359938, now seen corresponding path program 1 times [2018-11-07 01:08:58,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:08:58,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:08:58,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:08:58,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:08:58,016 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:08:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:08:58,611 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-07 01:08:58,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:08:58,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:08:58,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 01:08:58,761 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:08:58,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 01:08:58,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 01:08:58,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 01:08:58,765 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-11-07 01:09:00,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:09:00,498 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-11-07 01:09:00,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 01:09:00,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2018-11-07 01:09:00,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:09:00,503 INFO L225 Difference]: With dead ends: 903 [2018-11-07 01:09:00,503 INFO L226 Difference]: Without dead ends: 381 [2018-11-07 01:09:00,510 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 01:09:00,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-11-07 01:09:00,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-11-07 01:09:00,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-07 01:09:00,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-11-07 01:09:00,538 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 156 [2018-11-07 01:09:00,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:09:00,539 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-11-07 01:09:00,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 01:09:00,539 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-11-07 01:09:00,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-07 01:09:00,544 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:09:00,544 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 01:09:00,545 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:09:00,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:09:00,545 INFO L82 PathProgramCache]: Analyzing trace with hash 337215758, now seen corresponding path program 1 times [2018-11-07 01:09:00,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:09:00,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:09:00,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:09:00,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:09:00,547 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:09:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:09:00,965 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2018-11-07 01:09:01,149 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:09:01,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:09:01,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 01:09:01,150 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:09:01,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 01:09:01,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 01:09:01,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 01:09:01,152 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-11-07 01:09:02,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:09:02,770 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-11-07 01:09:02,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 01:09:02,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 162 [2018-11-07 01:09:02,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:09:02,775 INFO L225 Difference]: With dead ends: 901 [2018-11-07 01:09:02,776 INFO L226 Difference]: Without dead ends: 380 [2018-11-07 01:09:02,778 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 01:09:02,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-07 01:09:02,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-11-07 01:09:02,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-07 01:09:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-11-07 01:09:02,798 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 162 [2018-11-07 01:09:02,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:09:02,799 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-11-07 01:09:02,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 01:09:02,799 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-11-07 01:09:02,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-07 01:09:02,803 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:09:02,804 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 01:09:02,804 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:09:02,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:09:02,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1461325531, now seen corresponding path program 1 times [2018-11-07 01:09:02,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:09:02,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:09:02,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:09:02,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:09:02,807 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:09:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:09:02,972 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:09:02,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:09:02,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 01:09:02,973 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:09:02,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 01:09:02,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 01:09:02,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 01:09:02,974 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-11-07 01:09:06,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:09:06,002 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-11-07 01:09:06,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 01:09:06,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 170 [2018-11-07 01:09:06,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:09:06,009 INFO L225 Difference]: With dead ends: 1193 [2018-11-07 01:09:06,009 INFO L226 Difference]: Without dead ends: 819 [2018-11-07 01:09:06,011 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 01:09:06,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-11-07 01:09:06,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-11-07 01:09:06,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-11-07 01:09:06,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-11-07 01:09:06,054 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 170 [2018-11-07 01:09:06,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:09:06,054 INFO L480 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-11-07 01:09:06,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 01:09:06,055 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-11-07 01:09:06,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-07 01:09:06,061 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:09:06,061 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 01:09:06,062 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:09:06,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:09:06,062 INFO L82 PathProgramCache]: Analyzing trace with hash -2126959959, now seen corresponding path program 1 times [2018-11-07 01:09:06,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:09:06,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:09:06,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:09:06,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:09:06,065 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:09:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:09:06,432 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:09:06,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:09:06,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 01:09:06,433 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:09:06,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 01:09:06,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 01:09:06,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 01:09:06,435 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-11-07 01:09:07,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:09:07,418 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-11-07 01:09:07,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 01:09:07,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2018-11-07 01:09:07,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:09:07,426 INFO L225 Difference]: With dead ends: 1753 [2018-11-07 01:09:07,426 INFO L226 Difference]: Without dead ends: 804 [2018-11-07 01:09:07,430 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 01:09:07,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-11-07 01:09:07,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-11-07 01:09:07,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-11-07 01:09:07,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-11-07 01:09:07,457 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 172 [2018-11-07 01:09:07,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:09:07,458 INFO L480 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-11-07 01:09:07,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 01:09:07,458 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-11-07 01:09:07,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-07 01:09:07,462 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:09:07,463 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 01:09:07,463 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:09:07,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:09:07,464 INFO L82 PathProgramCache]: Analyzing trace with hash 443683885, now seen corresponding path program 1 times [2018-11-07 01:09:07,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:09:07,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:09:07,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:09:07,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:09:07,465 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:09:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:09:07,870 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-07 01:09:08,094 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 01:09:08,247 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:09:08,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:09:08,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 01:09:08,248 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:09:08,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 01:09:08,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 01:09:08,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 01:09:08,251 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-11-07 01:09:10,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:09:10,102 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-11-07 01:09:10,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 01:09:10,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 174 [2018-11-07 01:09:10,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:09:10,110 INFO L225 Difference]: With dead ends: 1747 [2018-11-07 01:09:10,110 INFO L226 Difference]: Without dead ends: 801 [2018-11-07 01:09:10,114 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 01:09:10,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-11-07 01:09:10,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-11-07 01:09:10,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-11-07 01:09:10,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-11-07 01:09:10,152 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 174 [2018-11-07 01:09:10,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:09:10,152 INFO L480 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-11-07 01:09:10,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 01:09:10,152 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-11-07 01:09:10,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-07 01:09:10,157 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:09:10,158 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 01:09:10,158 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:09:10,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:09:10,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1771723, now seen corresponding path program 1 times [2018-11-07 01:09:10,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:09:10,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:09:10,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:09:10,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:09:10,161 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:09:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:09:10,402 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 01:09:10,495 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:09:10,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:09:10,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 01:09:10,495 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:09:10,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 01:09:10,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 01:09:10,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 01:09:10,497 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-11-07 01:09:11,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:09:11,713 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-11-07 01:09:11,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 01:09:11,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2018-11-07 01:09:11,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:09:11,725 INFO L225 Difference]: With dead ends: 2381 [2018-11-07 01:09:11,726 INFO L226 Difference]: Without dead ends: 1586 [2018-11-07 01:09:11,731 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 01:09:11,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-11-07 01:09:11,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-11-07 01:09:11,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-11-07 01:09:11,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-11-07 01:09:11,781 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 178 [2018-11-07 01:09:11,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:09:11,782 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-11-07 01:09:11,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 01:09:11,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-11-07 01:09:11,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-07 01:09:11,789 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:09:11,790 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 01:09:11,790 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:09:11,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:09:11,791 INFO L82 PathProgramCache]: Analyzing trace with hash 161380030, now seen corresponding path program 1 times [2018-11-07 01:09:11,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:09:11,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:09:11,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:09:11,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:09:11,793 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:09:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:09:12,097 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:09:12,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 01:09:12,097 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 01:09:12,098 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2018-11-07 01:09:12,101 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 01:09:12,201 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 01:09:12,201 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 01:10:28,076 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 01:10:28,078 INFO L272 AbstractInterpreter]: Visited 151 different actions 449 times. Merged at 7 different actions 18 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 01:10:28,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:10:28,123 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 01:10:36,202 INFO L227 lantSequenceWeakener]: Weakened 6 states. On average, predicates are now at 86.11% of their original sizes. [2018-11-07 01:10:36,203 INFO L413 sIntCurrentIteration]: Unifying AI predicates Received shutdown request... [2018-11-07 01:13:14,917 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 01:13:14,922 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 01:13:14,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:13:14 BoogieIcfgContainer [2018-11-07 01:13:14,923 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 01:13:14,924 INFO L168 Benchmark]: Toolchain (without parser) took 263923.76 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 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 887.7 MB. Max. memory is 7.1 GB. [2018-11-07 01:13:14,925 INFO L168 Benchmark]: CDTParser took 0.22 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-11-07 01:13:14,926 INFO L168 Benchmark]: CACSL2BoogieTranslator took 756.55 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-07 01:13:14,926 INFO L168 Benchmark]: Boogie Procedure Inliner took 132.33 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 732.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -811.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 7.1 GB. [2018-11-07 01:13:14,928 INFO L168 Benchmark]: Boogie Preprocessor took 115.30 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 01:13:14,928 INFO L168 Benchmark]: RCFGBuilder took 3446.63 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: 105.6 MB). Peak memory consumption was 105.6 MB. Max. memory is 7.1 GB. [2018-11-07 01:13:14,929 INFO L168 Benchmark]: TraceAbstraction took 259467.85 ms. Allocated memory was 2.3 GB in the beginning and 3.6 GB in the end (delta: 1.4 GB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -542.7 MB). Peak memory consumption was 829.4 MB. Max. memory is 7.1 GB. [2018-11-07 01:13:14,935 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.22 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 756.55 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 132.33 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 732.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -811.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.30 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3446.63 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: 105.6 MB). Peak memory consumption was 105.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 259467.85 ms. Allocated memory was 2.3 GB in the beginning and 3.6 GB in the end (delta: 1.4 GB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -542.7 MB). Peak memory consumption was 829.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 592]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 592). Cancelled while BasicCegarLoop was analyzing trace of length 185 with TraceHistMax 3,while AbsIntCurrentIteration was generating AI predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. TIMEOUT Result, 259.3s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 11.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 854 SDtfs, 3975 SDslu, 687 SDs, 0 SdLazy, 5049 SolverSat, 1075 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1558occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 76.0s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9949397197024467 AbsIntWeakeningRatio, 0.18032786885245902 AbsIntAvgWeakeningVarsNumRemoved, 1221.2295081967213 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 40 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1159 NumberOfCodeBlocks, 1159 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1152 ConstructedInterpolants, 0 QuantifiedInterpolants, 1371008 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 112/112 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown