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/Problem13_label45_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:36:35,300 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:36:35,303 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:36:35,318 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:36:35,319 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:36:35,321 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:36:35,324 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:36:35,328 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:36:35,331 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:36:35,332 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:36:35,333 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:36:35,333 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:36:35,334 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:36:35,335 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:36:35,336 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:36:35,337 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:36:35,338 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:36:35,340 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:36:35,342 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:36:35,344 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:36:35,345 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:36:35,346 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:36:35,349 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:36:35,349 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:36:35,349 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:36:35,350 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:36:35,351 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:36:35,355 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:36:35,356 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:36:35,357 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:36:35,357 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:36:35,358 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:36:35,358 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:36:35,359 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:36:35,360 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:36:35,363 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:36:35,363 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:36:35,383 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:36:35,383 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:36:35,384 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:36:35,384 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:36:35,384 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:36:35,385 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:36:35,385 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:36:35,385 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:36:35,385 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:36:35,385 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:36:35,385 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:36:35,386 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:36:35,386 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:36:35,386 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:36:35,387 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:36:35,387 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:36:35,387 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:36:35,387 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:36:35,387 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:36:35,388 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:36:35,388 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:36:35,388 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:36:35,388 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:36:35,388 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:36:35,389 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:36:35,389 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:36:35,389 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:36:35,389 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:36:35,389 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:36:35,390 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:36:35,390 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:36:35,390 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:36:35,390 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:36:35,390 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:36:35,391 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:36:35,391 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:36:35,446 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:36:35,461 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:36:35,466 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:36:35,468 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:36:35,468 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:36:35,469 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label45_false-unreach-call.c [2018-10-24 23:36:35,540 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cc9b03a40/1e7dc24c34394d2e8d1f7aaec87050fc/FLAG3d8c0d068 [2018-10-24 23:36:36,401 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:36:36,402 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label45_false-unreach-call.c [2018-10-24 23:36:36,441 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cc9b03a40/1e7dc24c34394d2e8d1f7aaec87050fc/FLAG3d8c0d068 [2018-10-24 23:36:36,461 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cc9b03a40/1e7dc24c34394d2e8d1f7aaec87050fc [2018-10-24 23:36:36,474 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:36:36,477 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:36:36,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:36:36,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:36:36,488 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:36:36,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:36:36" (1/1) ... [2018-10-24 23:36:36,493 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1816ef0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:36, skipping insertion in model container [2018-10-24 23:36:36,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:36:36" (1/1) ... [2018-10-24 23:36:36,505 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:36:36,717 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:36:38,217 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:36:38,222 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:36:39,012 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:36:39,051 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:36:39,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:39 WrapperNode [2018-10-24 23:36:39,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:36:39,053 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:36:39,053 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:36:39,053 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:36:39,064 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:36:39" (1/1) ... [2018-10-24 23:36:39,133 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:36:39" (1/1) ... [2018-10-24 23:36:39,588 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:36:39,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:36:39,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:36:39,589 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:36:39,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:39" (1/1) ... [2018-10-24 23:36:39,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:39" (1/1) ... [2018-10-24 23:36:39,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:39" (1/1) ... [2018-10-24 23:36:39,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:39" (1/1) ... [2018-10-24 23:36:39,806 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:39" (1/1) ... [2018-10-24 23:36:39,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:39" (1/1) ... [2018-10-24 23:36:39,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:39" (1/1) ... [2018-10-24 23:36:39,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:36:39,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:36:39,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:36:39,926 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:36:39,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:39" (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:36:39,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:36:39,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:36:39,999 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-24 23:36:39,999 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-24 23:36:39,999 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-24 23:36:39,999 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-24 23:36:40,000 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-24 23:36:40,000 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-24 23:36:40,000 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:36:40,000 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:36:40,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:36:40,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:36:40,001 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:36:40,002 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:36:50,693 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:36:50,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:36:50 BoogieIcfgContainer [2018-10-24 23:36:50,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:36:50,696 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:36:50,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:36:50,699 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:36:50,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:36:36" (1/3) ... [2018-10-24 23:36:50,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d286ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:36:50, skipping insertion in model container [2018-10-24 23:36:50,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:39" (2/3) ... [2018-10-24 23:36:50,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d286ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:36:50, skipping insertion in model container [2018-10-24 23:36:50,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:36:50" (3/3) ... [2018-10-24 23:36:50,703 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label45_false-unreach-call.c [2018-10-24 23:36:50,713 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:36:50,723 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:36:50,740 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:36:50,788 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:36:50,788 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:36:50,788 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:36:50,788 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:36:50,788 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:36:50,789 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:36:50,789 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:36:50,789 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:36:50,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-10-24 23:36:50,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-24 23:36:50,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:36:50,839 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:36:50,841 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:36:50,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:36:50,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1438906236, now seen corresponding path program 1 times [2018-10-24 23:36:50,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:36:50,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:36:50,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:36:50,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:36:50,909 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:36:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:36:51,230 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:36:51,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:36:51,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:36:51,234 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:36:51,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:36:51,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:36:51,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:36:51,258 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 4 states. [2018-10-24 23:37:08,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:37:08,535 INFO L93 Difference]: Finished difference Result 4063 states and 7611 transitions. [2018-10-24 23:37:08,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:37:08,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-10-24 23:37:08,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:37:08,592 INFO L225 Difference]: With dead ends: 4063 [2018-10-24 23:37:08,593 INFO L226 Difference]: Without dead ends: 2937 [2018-10-24 23:37:08,605 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:37:08,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2018-10-24 23:37:08,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1982. [2018-10-24 23:37:08,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2018-10-24 23:37:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 3456 transitions. [2018-10-24 23:37:08,793 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 3456 transitions. Word has length 14 [2018-10-24 23:37:08,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:37:08,794 INFO L481 AbstractCegarLoop]: Abstraction has 1982 states and 3456 transitions. [2018-10-24 23:37:08,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:37:08,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 3456 transitions. [2018-10-24 23:37:08,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-24 23:37:08,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:37:08,802 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 23:37:08,803 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:37:08,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:37:08,803 INFO L82 PathProgramCache]: Analyzing trace with hash 78818025, now seen corresponding path program 1 times [2018-10-24 23:37:08,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:37:08,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:08,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:37:08,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:08,806 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:37:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:37:09,371 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:37:09,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:37:09,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:37:09,373 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:37:09,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:37:09,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:37:09,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:37:09,376 INFO L87 Difference]: Start difference. First operand 1982 states and 3456 transitions. Second operand 6 states. [2018-10-24 23:37:29,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:37:29,158 INFO L93 Difference]: Finished difference Result 7280 states and 13069 transitions. [2018-10-24 23:37:29,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 23:37:29,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-10-24 23:37:29,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:37:29,201 INFO L225 Difference]: With dead ends: 7280 [2018-10-24 23:37:29,201 INFO L226 Difference]: Without dead ends: 5304 [2018-10-24 23:37:29,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:37:29,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5304 states. [2018-10-24 23:37:29,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5304 to 5252. [2018-10-24 23:37:29,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5252 states. [2018-10-24 23:37:29,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5252 states to 5252 states and 8257 transitions. [2018-10-24 23:37:29,362 INFO L78 Accepts]: Start accepts. Automaton has 5252 states and 8257 transitions. Word has length 85 [2018-10-24 23:37:29,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:37:29,363 INFO L481 AbstractCegarLoop]: Abstraction has 5252 states and 8257 transitions. [2018-10-24 23:37:29,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:37:29,363 INFO L276 IsEmpty]: Start isEmpty. Operand 5252 states and 8257 transitions. [2018-10-24 23:37:29,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-24 23:37:29,367 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:37:29,367 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 23:37:29,367 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:37:29,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:37:29,368 INFO L82 PathProgramCache]: Analyzing trace with hash 418123736, now seen corresponding path program 1 times [2018-10-24 23:37:29,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:37:29,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:29,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:37:29,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:29,370 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:37:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:37:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:37:29,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:37:29,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:37:29,565 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:37:29,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:37:29,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:37:29,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:37:29,567 INFO L87 Difference]: Start difference. First operand 5252 states and 8257 transitions. Second operand 6 states. [2018-10-24 23:37:42,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:37:42,162 INFO L93 Difference]: Finished difference Result 13929 states and 22575 transitions. [2018-10-24 23:37:42,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:37:42,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2018-10-24 23:37:42,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:37:42,221 INFO L225 Difference]: With dead ends: 13929 [2018-10-24 23:37:42,222 INFO L226 Difference]: Without dead ends: 8683 [2018-10-24 23:37:42,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:37:42,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8683 states. [2018-10-24 23:37:42,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8683 to 8607. [2018-10-24 23:37:42,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8607 states. [2018-10-24 23:37:42,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8607 states to 8607 states and 12812 transitions. [2018-10-24 23:37:42,474 INFO L78 Accepts]: Start accepts. Automaton has 8607 states and 12812 transitions. Word has length 88 [2018-10-24 23:37:42,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:37:42,475 INFO L481 AbstractCegarLoop]: Abstraction has 8607 states and 12812 transitions. [2018-10-24 23:37:42,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:37:42,475 INFO L276 IsEmpty]: Start isEmpty. Operand 8607 states and 12812 transitions. [2018-10-24 23:37:42,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-24 23:37:42,484 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:37:42,484 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 23:37:42,484 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:37:42,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:37:42,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1382541628, now seen corresponding path program 1 times [2018-10-24 23:37:42,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:37:42,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:42,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:37:42,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:42,487 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:37:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:37:42,681 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:37:42,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:37:42,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:37:42,681 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:37:42,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:37:42,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:37:42,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:37:42,683 INFO L87 Difference]: Start difference. First operand 8607 states and 12812 transitions. Second operand 5 states. [2018-10-24 23:37:57,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:37:57,969 INFO L93 Difference]: Finished difference Result 25987 states and 40365 transitions. [2018-10-24 23:37:57,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 23:37:57,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-10-24 23:37:57,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:37:58,054 INFO L225 Difference]: With dead ends: 25987 [2018-10-24 23:37:58,054 INFO L226 Difference]: Without dead ends: 17386 [2018-10-24 23:37:58,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-24 23:37:58,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17386 states. [2018-10-24 23:37:58,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17386 to 17121. [2018-10-24 23:37:58,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17121 states. [2018-10-24 23:37:58,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17121 states to 17121 states and 24343 transitions. [2018-10-24 23:37:58,508 INFO L78 Accepts]: Start accepts. Automaton has 17121 states and 24343 transitions. Word has length 98 [2018-10-24 23:37:58,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:37:58,508 INFO L481 AbstractCegarLoop]: Abstraction has 17121 states and 24343 transitions. [2018-10-24 23:37:58,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:37:58,509 INFO L276 IsEmpty]: Start isEmpty. Operand 17121 states and 24343 transitions. [2018-10-24 23:37:58,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-24 23:37:58,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:37:58,518 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 23:37:58,518 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:37:58,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:37:58,519 INFO L82 PathProgramCache]: Analyzing trace with hash -916894984, now seen corresponding path program 1 times [2018-10-24 23:37:58,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:37:58,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:58,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:37:58,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:58,521 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:37:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:37:58,674 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:37:58,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:37:58,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 23:37:58,674 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:37:58,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 23:37:58,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 23:37:58,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:37:58,678 INFO L87 Difference]: Start difference. First operand 17121 states and 24343 transitions. Second operand 3 states. [2018-10-24 23:38:06,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:38:06,692 INFO L93 Difference]: Finished difference Result 47372 states and 71060 transitions. [2018-10-24 23:38:06,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 23:38:06,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2018-10-24 23:38:06,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:38:06,824 INFO L225 Difference]: With dead ends: 47372 [2018-10-24 23:38:06,824 INFO L226 Difference]: Without dead ends: 30257 [2018-10-24 23:38:06,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:38:06,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30257 states. [2018-10-24 23:38:08,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30257 to 30255. [2018-10-24 23:38:08,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30255 states. [2018-10-24 23:38:08,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30255 states to 30255 states and 42746 transitions. [2018-10-24 23:38:08,087 INFO L78 Accepts]: Start accepts. Automaton has 30255 states and 42746 transitions. Word has length 115 [2018-10-24 23:38:08,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:38:08,088 INFO L481 AbstractCegarLoop]: Abstraction has 30255 states and 42746 transitions. [2018-10-24 23:38:08,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 23:38:08,088 INFO L276 IsEmpty]: Start isEmpty. Operand 30255 states and 42746 transitions. [2018-10-24 23:38:08,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-24 23:38:08,092 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:38:08,092 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 23:38:08,093 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:38:08,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:38:08,093 INFO L82 PathProgramCache]: Analyzing trace with hash 196829947, now seen corresponding path program 1 times [2018-10-24 23:38:08,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:38:08,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:08,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:38:08,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:08,094 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:38:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:38:08,662 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:38:08,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:38:08,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:38:08,663 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:38:08,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:38:08,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:38:08,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:38:08,664 INFO L87 Difference]: Start difference. First operand 30255 states and 42746 transitions. Second operand 6 states. [2018-10-24 23:38:28,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:38:28,601 INFO L93 Difference]: Finished difference Result 98440 states and 150362 transitions. [2018-10-24 23:38:28,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:38:28,603 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2018-10-24 23:38:28,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:38:28,945 INFO L225 Difference]: With dead ends: 98440 [2018-10-24 23:38:28,946 INFO L226 Difference]: Without dead ends: 68191 [2018-10-24 23:38:29,090 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 23:38:29,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68191 states. [2018-10-24 23:38:30,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68191 to 68123. [2018-10-24 23:38:30,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68123 states. [2018-10-24 23:38:30,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68123 states to 68123 states and 98167 transitions. [2018-10-24 23:38:30,564 INFO L78 Accepts]: Start accepts. Automaton has 68123 states and 98167 transitions. Word has length 156 [2018-10-24 23:38:30,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:38:30,565 INFO L481 AbstractCegarLoop]: Abstraction has 68123 states and 98167 transitions. [2018-10-24 23:38:30,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:38:30,565 INFO L276 IsEmpty]: Start isEmpty. Operand 68123 states and 98167 transitions. [2018-10-24 23:38:30,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-24 23:38:30,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:38:30,571 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:38:30,572 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:38:30,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:38:30,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1968456128, now seen corresponding path program 1 times [2018-10-24 23:38:30,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:38:30,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:30,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:38:30,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:30,573 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:38:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:38:30,772 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-10-24 23:38:30,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:38:30,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 23:38:30,773 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:38:30,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 23:38:30,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 23:38:30,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:38:30,775 INFO L87 Difference]: Start difference. First operand 68123 states and 98167 transitions. Second operand 3 states. [2018-10-24 23:38:38,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:38:38,756 INFO L93 Difference]: Finished difference Result 137067 states and 199055 transitions. [2018-10-24 23:38:38,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 23:38:38,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2018-10-24 23:38:38,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:38:39,003 INFO L225 Difference]: With dead ends: 137067 [2018-10-24 23:38:39,003 INFO L226 Difference]: Without dead ends: 68950 [2018-10-24 23:38:39,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:38:39,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68950 states. [2018-10-24 23:38:40,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68950 to 68945. [2018-10-24 23:38:40,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68945 states. [2018-10-24 23:38:40,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68945 states to 68945 states and 94088 transitions. [2018-10-24 23:38:40,457 INFO L78 Accepts]: Start accepts. Automaton has 68945 states and 94088 transitions. Word has length 216 [2018-10-24 23:38:40,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:38:40,458 INFO L481 AbstractCegarLoop]: Abstraction has 68945 states and 94088 transitions. [2018-10-24 23:38:40,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 23:38:40,458 INFO L276 IsEmpty]: Start isEmpty. Operand 68945 states and 94088 transitions. [2018-10-24 23:38:40,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-24 23:38:40,466 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:38:40,466 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 23:38:40,466 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:38:40,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:38:40,467 INFO L82 PathProgramCache]: Analyzing trace with hash -967021314, now seen corresponding path program 1 times [2018-10-24 23:38:40,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:38:40,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:40,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:38:40,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:40,468 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:38:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:38:40,860 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:38:41,337 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:38:41,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:38:41,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:38:41,338 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:38:41,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:38:41,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:38:41,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:38:41,340 INFO L87 Difference]: Start difference. First operand 68945 states and 94088 transitions. Second operand 6 states. [2018-10-24 23:38:53,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:38:53,282 INFO L93 Difference]: Finished difference Result 177933 states and 268522 transitions. [2018-10-24 23:38:53,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:38:53,283 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 224 [2018-10-24 23:38:53,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:38:53,752 INFO L225 Difference]: With dead ends: 177933 [2018-10-24 23:38:53,752 INFO L226 Difference]: Without dead ends: 108994 [2018-10-24 23:38:53,950 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:38:54,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108994 states. [2018-10-24 23:38:56,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108994 to 108664. [2018-10-24 23:38:56,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108664 states. [2018-10-24 23:38:56,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108664 states to 108664 states and 149153 transitions. [2018-10-24 23:38:56,773 INFO L78 Accepts]: Start accepts. Automaton has 108664 states and 149153 transitions. Word has length 224 [2018-10-24 23:38:56,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:38:56,773 INFO L481 AbstractCegarLoop]: Abstraction has 108664 states and 149153 transitions. [2018-10-24 23:38:56,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:38:56,773 INFO L276 IsEmpty]: Start isEmpty. Operand 108664 states and 149153 transitions. [2018-10-24 23:38:56,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-24 23:38:56,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:38:56,783 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 23:38:56,783 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:38:56,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:38:56,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1811019067, now seen corresponding path program 1 times [2018-10-24 23:38:56,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:38:56,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:56,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:38:56,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:56,785 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:38:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:38:57,076 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2018-10-24 23:38:57,110 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-10-24 23:38:57,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:38:57,111 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:38:57,112 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 249 with the following transitions: [2018-10-24 23:38:57,116 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2639], [2641], [2644], [2652], [2660], [2668], [2676], [2684], [2692], [2700], [2708], [2716], [2724], [2732], [2740], [2748], [2756], [2764], [2772], [2780], [2788], [2796], [2804], [2812], [2820], [2828], [2836], [2844], [2852], [2860], [2868], [2876], [2884], [2892], [2900], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3266], [3270], [3274], [3278], [3282], [3286], [3290], [3294], [3305], [3309], [3313], [3317], [3320], [3321], [3325], [3329], [3333], [3344], [3355], [3358], [3361], [3365], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-10-24 23:38:57,185 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:38:57,186 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:38:57,782 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:38:57,785 INFO L272 AbstractInterpreter]: Visited 124 different actions 124 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-24 23:38:57,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:38:57,830 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:38:58,482 INFO L232 lantSequenceWeakener]: Weakened 237 states. On average, predicates are now at 70.66% of their original sizes. [2018-10-24 23:38:58,482 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:38:58,736 INFO L413 sIntCurrentIteration]: We have 247 unified AI predicates [2018-10-24 23:38:58,737 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:38:58,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:38:58,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [3] total 7 [2018-10-24 23:38:58,738 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:38:58,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:38:58,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:38:58,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:38:58,740 INFO L87 Difference]: Start difference. First operand 108664 states and 149153 transitions. Second operand 6 states. [2018-10-24 23:39:02,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:39:02,889 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:93) 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.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: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.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.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) 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:39:02,909 INFO L168 Benchmark]: Toolchain (without parser) took 146425.82 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.3 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -647.6 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-10-24 23:39:02,910 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-10-24 23:39:02,911 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2574.10 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: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-10-24 23:39:02,912 INFO L168 Benchmark]: Boogie Procedure Inliner took 534.93 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 807.9 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 73.2 MB. Max. memory is 7.1 GB. [2018-10-24 23:39:02,913 INFO L168 Benchmark]: Boogie Preprocessor took 337.07 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 36.8 MB). Peak memory consumption was 36.8 MB. Max. memory is 7.1 GB. [2018-10-24 23:39:02,914 INFO L168 Benchmark]: RCFGBuilder took 10769.30 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 186.6 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.1 MB). Peak memory consumption was 660.0 MB. Max. memory is 7.1 GB. [2018-10-24 23:39:02,915 INFO L168 Benchmark]: TraceAbstraction took 132204.27 ms. Allocated memory was 2.5 GB in the beginning and 3.8 GB in the end (delta: 1.3 GB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 130.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-24 23:39:02,921 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 2574.10 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: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 534.93 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 807.9 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 73.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 337.07 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 36.8 MB). Peak memory consumption was 36.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 10769.30 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 186.6 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.1 MB). Peak memory consumption was 660.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 132204.27 ms. Allocated memory was 2.5 GB in the beginning and 3.8 GB in the end (delta: 1.3 GB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 130.9 MB). Peak memory consumption was 1.5 GB. 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...