java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem12_label39_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:32:50,222 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:32:50,224 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:32:50,242 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:32:50,242 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:32:50,243 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:32:50,245 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:32:50,246 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:32:50,248 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:32:50,249 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:32:50,250 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:32:50,250 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:32:50,251 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:32:50,252 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:32:50,253 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:32:50,254 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:32:50,255 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:32:50,257 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:32:50,259 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:32:50,260 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:32:50,261 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:32:50,263 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:32:50,265 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:32:50,265 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:32:50,265 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:32:50,266 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:32:50,267 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:32:50,268 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:32:50,269 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:32:50,270 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:32:50,270 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:32:50,271 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:32:50,271 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:32:50,272 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:32:50,273 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:32:50,274 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:32:50,274 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-24 23:32:50,289 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:32:50,290 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:32:50,291 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:32:50,291 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:32:50,291 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:32:50,291 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:32:50,292 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:32:50,292 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:32:50,292 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:32:50,292 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:32:50,292 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:32:50,293 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:32:50,293 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:32:50,293 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:32:50,294 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:32:50,294 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:32:50,294 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:32:50,294 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:32:50,294 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:32:50,295 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:32:50,295 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:32:50,295 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:32:50,295 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:32:50,295 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:32:50,297 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:32:50,297 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:32:50,297 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:32:50,297 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:32:50,298 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:32:50,298 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:32:50,298 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:32:50,298 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:32:50,298 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:32:50,298 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:32:50,299 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:32:50,299 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:32:50,353 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:32:50,366 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:32:50,370 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:32:50,371 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:32:50,372 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:32:50,372 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label39_false-unreach-call.c [2018-10-24 23:32:50,433 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1e675a7e5/3c2f2531e67e420f93f2dbc2d1613be8/FLAG36cb61780 [2018-10-24 23:32:51,204 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:32:51,205 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label39_false-unreach-call.c [2018-10-24 23:32:51,234 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1e675a7e5/3c2f2531e67e420f93f2dbc2d1613be8/FLAG36cb61780 [2018-10-24 23:32:51,257 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1e675a7e5/3c2f2531e67e420f93f2dbc2d1613be8 [2018-10-24 23:32:51,270 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:32:51,272 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:32:51,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:32:51,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:32:51,281 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:32:51,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:32:51" (1/1) ... [2018-10-24 23:32:51,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@441f49ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:51, skipping insertion in model container [2018-10-24 23:32:51,286 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:32:51" (1/1) ... [2018-10-24 23:32:51,298 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:32:51,458 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:32:52,910 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:32:52,915 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:32:53,547 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:32:53,589 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:32:53,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:53 WrapperNode [2018-10-24 23:32:53,590 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:32:53,592 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:32:53,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:32:53,592 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:32:53,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:53" (1/1) ... [2018-10-24 23:32:53,670 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:53" (1/1) ... [2018-10-24 23:32:54,078 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:32:54,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:32:54,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:32:54,079 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:32:54,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:53" (1/1) ... [2018-10-24 23:32:54,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:53" (1/1) ... [2018-10-24 23:32:54,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:53" (1/1) ... [2018-10-24 23:32:54,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:53" (1/1) ... [2018-10-24 23:32:54,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:53" (1/1) ... [2018-10-24 23:32:54,293 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:53" (1/1) ... [2018-10-24 23:32:54,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:53" (1/1) ... [2018-10-24 23:32:54,405 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:32:54,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:32:54,406 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:32:54,406 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:32:54,408 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 23:32:54,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:32:54,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:32:54,483 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-24 23:32:54,483 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-24 23:32:54,483 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-24 23:32:54,483 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-24 23:32:54,483 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-24 23:32:54,485 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-24 23:32:54,485 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:32:54,485 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:32:54,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:32:54,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:32:54,487 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:32:54,488 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:33:07,942 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:33:07,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:33:07 BoogieIcfgContainer [2018-10-24 23:33:07,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:33:07,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:33:07,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:33:07,948 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:33:07,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:32:51" (1/3) ... [2018-10-24 23:33:07,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d94f36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:33:07, skipping insertion in model container [2018-10-24 23:33:07,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:53" (2/3) ... [2018-10-24 23:33:07,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d94f36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:33:07, skipping insertion in model container [2018-10-24 23:33:07,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:33:07" (3/3) ... [2018-10-24 23:33:07,951 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label39_false-unreach-call.c [2018-10-24 23:33:07,961 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:33:07,971 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:33:07,989 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:33:08,034 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:33:08,034 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:33:08,034 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:33:08,035 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:33:08,035 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:33:08,035 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:33:08,035 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:33:08,035 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:33:08,081 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-10-24 23:33:08,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-24 23:33:08,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:33:08,091 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:33:08,093 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:33:08,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:33:08,101 INFO L82 PathProgramCache]: Analyzing trace with hash 491754076, now seen corresponding path program 1 times [2018-10-24 23:33:08,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:33:08,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:08,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:33:08,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:08,163 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:33:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:33:08,561 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-10-24 23:33:08,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:33:08,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:33:08,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:33:08,577 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:33:08,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:33:08,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:33:08,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:33:08,605 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 4 states. [2018-10-24 23:33:21,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:33:21,148 INFO L93 Difference]: Finished difference Result 3234 states and 6255 transitions. [2018-10-24 23:33:21,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:33:21,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-10-24 23:33:21,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:33:21,195 INFO L225 Difference]: With dead ends: 3234 [2018-10-24 23:33:21,195 INFO L226 Difference]: Without dead ends: 2388 [2018-10-24 23:33:21,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:33:21,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2388 states. [2018-10-24 23:33:21,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2388 to 1604. [2018-10-24 23:33:21,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-10-24 23:33:21,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2600 transitions. [2018-10-24 23:33:21,369 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2600 transitions. Word has length 28 [2018-10-24 23:33:21,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:33:21,370 INFO L481 AbstractCegarLoop]: Abstraction has 1604 states and 2600 transitions. [2018-10-24 23:33:21,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:33:21,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2600 transitions. [2018-10-24 23:33:21,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-24 23:33:21,376 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:33:21,377 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 23:33:21,377 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:33:21,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:33:21,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1894764938, now seen corresponding path program 1 times [2018-10-24 23:33:21,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:33:21,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:21,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:33:21,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:21,379 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:33:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:33:21,638 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:33:21,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:33:21,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:33:21,639 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:33:21,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:33:21,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:33:21,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:33:21,642 INFO L87 Difference]: Start difference. First operand 1604 states and 2600 transitions. Second operand 5 states. [2018-10-24 23:33:34,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:33:34,539 INFO L93 Difference]: Finished difference Result 4873 states and 7923 transitions. [2018-10-24 23:33:34,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:33:34,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2018-10-24 23:33:34,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:33:34,570 INFO L225 Difference]: With dead ends: 4873 [2018-10-24 23:33:34,570 INFO L226 Difference]: Without dead ends: 3275 [2018-10-24 23:33:34,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:33:34,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3275 states. [2018-10-24 23:33:34,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3275 to 3241. [2018-10-24 23:33:34,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3241 states. [2018-10-24 23:33:34,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 4816 transitions. [2018-10-24 23:33:34,720 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 4816 transitions. Word has length 108 [2018-10-24 23:33:34,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:33:34,721 INFO L481 AbstractCegarLoop]: Abstraction has 3241 states and 4816 transitions. [2018-10-24 23:33:34,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:33:34,721 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 4816 transitions. [2018-10-24 23:33:34,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-24 23:33:34,726 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:33:34,727 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 23:33:34,727 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:33:34,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:33:34,727 INFO L82 PathProgramCache]: Analyzing trace with hash 379884815, now seen corresponding path program 1 times [2018-10-24 23:33:34,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:33:34,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:34,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:33:34,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:34,729 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:33:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:33:35,126 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:33:35,555 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:33:35,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:33:35,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:33:35,555 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:33:35,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:33:35,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:33:35,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:33:35,558 INFO L87 Difference]: Start difference. First operand 3241 states and 4816 transitions. Second operand 6 states. [2018-10-24 23:33:48,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:33:48,965 INFO L93 Difference]: Finished difference Result 12870 states and 19656 transitions. [2018-10-24 23:33:48,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:33:48,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 137 [2018-10-24 23:33:48,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:33:49,021 INFO L225 Difference]: With dead ends: 12870 [2018-10-24 23:33:49,021 INFO L226 Difference]: Without dead ends: 9635 [2018-10-24 23:33:49,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:33:49,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9635 states. [2018-10-24 23:33:49,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9635 to 9567. [2018-10-24 23:33:49,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9567 states. [2018-10-24 23:33:49,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9567 states to 9567 states and 13823 transitions. [2018-10-24 23:33:49,325 INFO L78 Accepts]: Start accepts. Automaton has 9567 states and 13823 transitions. Word has length 137 [2018-10-24 23:33:49,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:33:49,325 INFO L481 AbstractCegarLoop]: Abstraction has 9567 states and 13823 transitions. [2018-10-24 23:33:49,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:33:49,326 INFO L276 IsEmpty]: Start isEmpty. Operand 9567 states and 13823 transitions. [2018-10-24 23:33:49,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-24 23:33:49,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:33:49,336 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 23:33:49,337 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:33:49,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:33:49,337 INFO L82 PathProgramCache]: Analyzing trace with hash 918827063, now seen corresponding path program 1 times [2018-10-24 23:33:49,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:33:49,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:49,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:33:49,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:49,342 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:33:49,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:33:49,647 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:33:49,692 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:33:49,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:33:49,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:33:49,693 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:33:49,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:33:49,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:33:49,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:33:49,694 INFO L87 Difference]: Start difference. First operand 9567 states and 13823 transitions. Second operand 6 states. [2018-10-24 23:33:57,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:33:57,662 INFO L93 Difference]: Finished difference Result 25915 states and 39231 transitions. [2018-10-24 23:33:57,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:33:57,674 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2018-10-24 23:33:57,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:33:57,751 INFO L225 Difference]: With dead ends: 25915 [2018-10-24 23:33:57,751 INFO L226 Difference]: Without dead ends: 16354 [2018-10-24 23:33:57,783 INFO L605 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-10-24 23:33:57,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16354 states. [2018-10-24 23:33:58,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16354 to 16174. [2018-10-24 23:33:58,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16174 states. [2018-10-24 23:33:58,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16174 states to 16174 states and 23344 transitions. [2018-10-24 23:33:58,207 INFO L78 Accepts]: Start accepts. Automaton has 16174 states and 23344 transitions. Word has length 149 [2018-10-24 23:33:58,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:33:58,208 INFO L481 AbstractCegarLoop]: Abstraction has 16174 states and 23344 transitions. [2018-10-24 23:33:58,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:33:58,208 INFO L276 IsEmpty]: Start isEmpty. Operand 16174 states and 23344 transitions. [2018-10-24 23:33:58,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-24 23:33:58,213 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:33:58,213 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 23:33:58,213 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:33:58,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:33:58,214 INFO L82 PathProgramCache]: Analyzing trace with hash -379444241, now seen corresponding path program 1 times [2018-10-24 23:33:58,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:33:58,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:58,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:33:58,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:58,215 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:33:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:33:58,502 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:33:58,880 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:33:58,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:33:58,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:33:58,881 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:33:58,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:33:58,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:33:58,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:33:58,884 INFO L87 Difference]: Start difference. First operand 16174 states and 23344 transitions. Second operand 6 states. [2018-10-24 23:34:07,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:34:07,435 INFO L93 Difference]: Finished difference Result 39076 states and 58115 transitions. [2018-10-24 23:34:07,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:34:07,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2018-10-24 23:34:07,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:34:07,551 INFO L225 Difference]: With dead ends: 39076 [2018-10-24 23:34:07,551 INFO L226 Difference]: Without dead ends: 22908 [2018-10-24 23:34:07,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:34:07,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22908 states. [2018-10-24 23:34:08,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22908 to 22784. [2018-10-24 23:34:08,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22784 states. [2018-10-24 23:34:08,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22784 states to 22784 states and 31228 transitions. [2018-10-24 23:34:08,096 INFO L78 Accepts]: Start accepts. Automaton has 22784 states and 31228 transitions. Word has length 153 [2018-10-24 23:34:08,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:34:08,097 INFO L481 AbstractCegarLoop]: Abstraction has 22784 states and 31228 transitions. [2018-10-24 23:34:08,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:34:08,097 INFO L276 IsEmpty]: Start isEmpty. Operand 22784 states and 31228 transitions. [2018-10-24 23:34:08,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-24 23:34:08,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:34:08,100 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 23:34:08,101 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:34:08,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:34:08,101 INFO L82 PathProgramCache]: Analyzing trace with hash 96690322, now seen corresponding path program 1 times [2018-10-24 23:34:08,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:34:08,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:34:08,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:34:08,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:34:08,102 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:34:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:34:08,341 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:34:08,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:34:08,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:34:08,341 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:34:08,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:34:08,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:34:08,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:34:08,343 INFO L87 Difference]: Start difference. First operand 22784 states and 31228 transitions. Second operand 4 states. [2018-10-24 23:34:19,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:34:19,226 INFO L93 Difference]: Finished difference Result 55063 states and 77275 transitions. [2018-10-24 23:34:19,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:34:19,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2018-10-24 23:34:19,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:34:19,347 INFO L225 Difference]: With dead ends: 55063 [2018-10-24 23:34:19,348 INFO L226 Difference]: Without dead ends: 32285 [2018-10-24 23:34:19,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:34:19,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32285 states. [2018-10-24 23:34:19,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32285 to 32281. [2018-10-24 23:34:19,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32281 states. [2018-10-24 23:34:20,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32281 states to 32281 states and 44030 transitions. [2018-10-24 23:34:20,022 INFO L78 Accepts]: Start accepts. Automaton has 32281 states and 44030 transitions. Word has length 174 [2018-10-24 23:34:20,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:34:20,023 INFO L481 AbstractCegarLoop]: Abstraction has 32281 states and 44030 transitions. [2018-10-24 23:34:20,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:34:20,023 INFO L276 IsEmpty]: Start isEmpty. Operand 32281 states and 44030 transitions. [2018-10-24 23:34:20,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-24 23:34:20,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:34:20,027 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 23:34:20,027 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:34:20,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:34:20,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1795048897, now seen corresponding path program 1 times [2018-10-24 23:34:20,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:34:20,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:34:20,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:34:20,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:34:20,029 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:34:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:34:20,232 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:34:20,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:34:20,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:34:20,233 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:34:20,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:34:20,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:34:20,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:34:20,234 INFO L87 Difference]: Start difference. First operand 32281 states and 44030 transitions. Second operand 4 states. [2018-10-24 23:34:31,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:34:31,128 INFO L93 Difference]: Finished difference Result 77024 states and 106253 transitions. [2018-10-24 23:34:31,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:34:31,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2018-10-24 23:34:31,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:34:31,275 INFO L225 Difference]: With dead ends: 77024 [2018-10-24 23:34:31,275 INFO L226 Difference]: Without dead ends: 44749 [2018-10-24 23:34:31,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:34:31,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44749 states. [2018-10-24 23:34:32,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44749 to 44746. [2018-10-24 23:34:32,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44746 states. [2018-10-24 23:34:32,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44746 states to 44746 states and 56454 transitions. [2018-10-24 23:34:32,225 INFO L78 Accepts]: Start accepts. Automaton has 44746 states and 56454 transitions. Word has length 177 [2018-10-24 23:34:32,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:34:32,225 INFO L481 AbstractCegarLoop]: Abstraction has 44746 states and 56454 transitions. [2018-10-24 23:34:32,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:34:32,226 INFO L276 IsEmpty]: Start isEmpty. Operand 44746 states and 56454 transitions. [2018-10-24 23:34:32,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-10-24 23:34:32,265 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:34:32,266 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 23:34:32,266 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:34:32,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:34:32,267 INFO L82 PathProgramCache]: Analyzing trace with hash -252379448, now seen corresponding path program 1 times [2018-10-24 23:34:32,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:34:32,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:34:32,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:34:32,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:34:32,268 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:34:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:34:32,680 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:34:32,911 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 23:34:32,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:34:32,911 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:34:32,912 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 343 with the following transitions: [2018-10-24 23:34:32,916 INFO L202 CegarAbsIntRunner]: [0], [1], [984], [988], [992], [996], [1000], [1004], [1008], [1012], [1016], [1020], [1024], [1028], [1032], [1036], [1040], [1044], [1048], [1052], [1056], [1060], [1063], [1867], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1991], [1993], [1996], [2004], [2012], [2020], [2028], [2036], [2044], [2052], [2060], [2068], [2076], [2084], [2092], [2100], [2108], [2116], [2124], [2132], [2140], [2148], [2156], [2164], [2172], [2180], [2188], [2196], [2204], [2212], [2220], [2228], [2236], [2244], [2252], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2565], [2569], [2573], [2577], [2581], [2585], [2589], [2593], [2597], [2601], [2605], [2609], [2613], [2617], [2621], [2625], [2629], [2633], [2637], [2641], [2645], [2649], [2653], [2657], [2661], [2665], [2669], [2673], [2677], [2681], [2685], [2689], [2693], [2697], [2701], [2705], [2709], [2713], [2717], [2721], [2725], [2729], [2733], [2737], [2741], [2745], [2749], [2753], [2757], [2761], [2765], [2769], [2773], [2777], [2781], [2785], [2789], [2793], [2797], [2801], [2805], [2809], [2813], [2817], [2821], [2825], [2829], [2833], [2837], [2841], [2845], [2849], [2853], [2857], [2861], [2865], [2869], [2873], [2877], [2881], [2885], [2889], [2893], [2897], [2901], [2905], [2909], [2913], [2917], [2921], [2925], [2929], [2933], [2937], [2941], [2945], [2949], [2953], [2957], [2961], [2965], [2969], [2973], [2977], [2981], [2985], [2989], [2993], [2997], [3001], [3005], [3009], [3013], [3017], [3021], [3025], [3029], [3033], [3037], [3041], [3045], [3049], [3053], [3057], [3061], [3065], [3069], [3073], [3077], [3081], [3085], [3089], [3093], [3097], [3101], [3105], [3109], [3113], [3117], [3121], [3125], [3129], [3133], [3137], [3141], [3145], [3149], [3153], [3157], [3161], [3165], [3169], [3173], [3177], [3181], [3185], [3189], [3193], [3197], [3201], [3205], [3209], [3213], [3217], [3221], [3225], [3229], [3233], [3237], [3239], [3240], [3244], [3248], [3254], [3258], [3260], [3269], [3270], [3271], [3272], [3273], [3275], [3276] [2018-10-24 23:34:33,001 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:34:33,001 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:34:35,822 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:34:35,823 INFO L272 AbstractInterpreter]: Visited 321 different actions 636 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-10-24 23:34:35,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:34:35,870 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:34:37,482 INFO L232 lantSequenceWeakener]: Weakened 339 states. On average, predicates are now at 75.17% of their original sizes. [2018-10-24 23:34:37,483 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:34:37,957 INFO L413 sIntCurrentIteration]: We have 341 unified AI predicates [2018-10-24 23:34:37,958 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:34:37,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:34:37,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 15 [2018-10-24 23:34:37,960 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:34:37,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 23:34:37,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 23:34:37,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-10-24 23:34:37,961 INFO L87 Difference]: Start difference. First operand 44746 states and 56454 transitions. Second operand 13 states. [2018-10-24 23:34:52,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:34:52,730 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-24 23:34:52,736 INFO L168 Benchmark]: Toolchain (without parser) took 121465.78 ms. Allocated memory was 1.5 GB in the beginning and 3.7 GB in the end (delta: 2.1 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.9 GB). Peak memory consumption was 276.0 MB. Max. memory is 7.1 GB. [2018-10-24 23:34:52,738 INFO L168 Benchmark]: CDTParser took 0.18 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-10-24 23:34:52,738 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2316.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. [2018-10-24 23:34:52,739 INFO L168 Benchmark]: Boogie Procedure Inliner took 487.05 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 794.3 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. [2018-10-24 23:34:52,740 INFO L168 Benchmark]: Boogie Preprocessor took 326.23 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2018-10-24 23:34:52,741 INFO L168 Benchmark]: RCFGBuilder took 13537.68 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 188.7 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -217.3 MB). Peak memory consumption was 671.8 MB. Max. memory is 7.1 GB. [2018-10-24 23:34:52,742 INFO L168 Benchmark]: TraceAbstraction took 104791.17 ms. Allocated memory was 2.5 GB in the beginning and 3.7 GB in the end (delta: 1.2 GB). Free memory was 2.4 GB in the beginning and 3.3 GB in the end (delta: -861.8 MB). Peak memory consumption was 297.4 MB. Max. memory is 7.1 GB. [2018-10-24 23:34:52,748 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2316.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 487.05 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 794.3 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 326.23 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 13537.68 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 188.7 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -217.3 MB). Peak memory consumption was 671.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 104791.17 ms. Allocated memory was 2.5 GB in the beginning and 3.7 GB in the end (delta: 1.2 GB). Free memory was 2.4 GB in the beginning and 3.3 GB in the end (delta: -861.8 MB). Peak memory consumption was 297.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger: modulus not positive de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger: modulus not positive: java.math.BigInteger.mod(BigInteger.java:2458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...