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/Problem15_label00_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:39:10,262 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:39:10,266 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:39:10,280 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:39:10,280 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:39:10,281 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:39:10,283 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:39:10,285 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:39:10,286 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:39:10,287 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:39:10,288 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:39:10,289 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:39:10,289 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:39:10,290 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:39:10,292 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:39:10,293 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:39:10,293 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:39:10,295 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:39:10,297 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:39:10,299 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:39:10,300 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:39:10,302 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:39:10,304 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:39:10,305 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:39:10,305 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:39:10,306 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:39:10,307 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:39:10,308 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:39:10,309 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:39:10,310 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:39:10,311 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:39:10,311 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:39:10,312 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:39:10,312 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:39:10,313 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:39:10,316 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:39:10,317 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:39:10,346 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:39:10,347 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:39:10,348 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:39:10,348 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:39:10,348 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:39:10,349 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:39:10,349 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:39:10,349 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:39:10,349 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:39:10,349 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:39:10,350 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:39:10,350 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:39:10,350 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:39:10,350 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:39:10,351 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:39:10,351 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:39:10,352 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:39:10,352 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:39:10,352 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:39:10,352 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:39:10,352 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:39:10,353 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:39:10,353 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:39:10,353 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:39:10,353 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:39:10,353 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:39:10,354 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:39:10,354 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:39:10,354 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:39:10,354 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:39:10,355 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:39:10,355 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:39:10,355 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:39:10,356 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:39:10,356 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:39:10,356 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:39:10,424 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:39:10,450 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:39:10,454 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:39:10,456 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:39:10,457 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:39:10,458 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label00_false-unreach-call.c [2018-10-24 23:39:10,532 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/17849f9a3/43b951d7ac284cc7836fca0474c29778/FLAGf0c9209dc [2018-10-24 23:39:11,229 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:39:11,230 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label00_false-unreach-call.c [2018-10-24 23:39:11,247 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/17849f9a3/43b951d7ac284cc7836fca0474c29778/FLAGf0c9209dc [2018-10-24 23:39:11,263 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/17849f9a3/43b951d7ac284cc7836fca0474c29778 [2018-10-24 23:39:11,280 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:39:11,281 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:39:11,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:39:11,283 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:39:11,289 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:39:11,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:39:11" (1/1) ... [2018-10-24 23:39:11,294 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bd54a7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:11, skipping insertion in model container [2018-10-24 23:39:11,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:39:11" (1/1) ... [2018-10-24 23:39:11,305 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:39:11,403 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:39:12,359 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:39:12,364 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:39:12,656 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:39:12,679 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:39:12,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:12 WrapperNode [2018-10-24 23:39:12,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:39:12,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:39:12,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:39:12,682 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:39:12,693 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:39:12" (1/1) ... [2018-10-24 23:39:12,738 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:39:12" (1/1) ... [2018-10-24 23:39:13,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:39:13,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:39:13,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:39:13,094 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:39:13,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:12" (1/1) ... [2018-10-24 23:39:13,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:12" (1/1) ... [2018-10-24 23:39:13,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:12" (1/1) ... [2018-10-24 23:39:13,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:12" (1/1) ... [2018-10-24 23:39:13,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:12" (1/1) ... [2018-10-24 23:39:13,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:12" (1/1) ... [2018-10-24 23:39:13,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:12" (1/1) ... [2018-10-24 23:39:13,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:39:13,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:39:13,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:39:13,342 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:39:13,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:12" (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:39:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:39:13,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:39:13,412 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-24 23:39:13,412 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-24 23:39:13,412 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:39:13,412 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:39:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:39:13,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:39:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:39:13,413 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:39:20,764 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:39:20,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:39:20 BoogieIcfgContainer [2018-10-24 23:39:20,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:39:20,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:39:20,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:39:20,770 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:39:20,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:39:11" (1/3) ... [2018-10-24 23:39:20,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2880f5db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:39:20, skipping insertion in model container [2018-10-24 23:39:20,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:12" (2/3) ... [2018-10-24 23:39:20,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2880f5db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:39:20, skipping insertion in model container [2018-10-24 23:39:20,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:39:20" (3/3) ... [2018-10-24 23:39:20,775 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label00_false-unreach-call.c [2018-10-24 23:39:20,785 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:39:20,801 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:39:20,818 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:39:20,859 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:39:20,860 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:39:20,860 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:39:20,860 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:39:20,860 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:39:20,860 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:39:20,861 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:39:20,861 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:39:20,895 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states. [2018-10-24 23:39:20,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-24 23:39:20,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:39:20,905 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:39:20,909 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:39:20,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:39:20,916 INFO L82 PathProgramCache]: Analyzing trace with hash -2089929615, now seen corresponding path program 1 times [2018-10-24 23:39:20,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:39:20,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:39:20,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:39:20,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:39:20,975 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:39:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:39:21,182 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:39:21,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:39:21,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 23:39:21,185 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:39:21,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 23:39:21,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 23:39:21,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:39:21,212 INFO L87 Difference]: Start difference. First operand 438 states. Second operand 3 states. [2018-10-24 23:39:28,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:39:28,064 INFO L93 Difference]: Finished difference Result 1188 states and 2146 transitions. [2018-10-24 23:39:28,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 23:39:28,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-10-24 23:39:28,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:39:28,090 INFO L225 Difference]: With dead ends: 1188 [2018-10-24 23:39:28,091 INFO L226 Difference]: Without dead ends: 748 [2018-10-24 23:39:28,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:39:28,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2018-10-24 23:39:28,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 746. [2018-10-24 23:39:28,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2018-10-24 23:39:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1128 transitions. [2018-10-24 23:39:28,208 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1128 transitions. Word has length 13 [2018-10-24 23:39:28,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:39:28,209 INFO L481 AbstractCegarLoop]: Abstraction has 746 states and 1128 transitions. [2018-10-24 23:39:28,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 23:39:28,209 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1128 transitions. [2018-10-24 23:39:28,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-24 23:39:28,213 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:39:28,214 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:39:28,214 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:39:28,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:39:28,215 INFO L82 PathProgramCache]: Analyzing trace with hash 341889893, now seen corresponding path program 1 times [2018-10-24 23:39:28,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:39:28,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:39:28,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:39:28,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:39:28,218 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:39:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:39:28,689 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:39:28,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:39:28,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:39:28,690 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:39:28,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:39:28,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:39:28,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:39:28,693 INFO L87 Difference]: Start difference. First operand 746 states and 1128 transitions. Second operand 5 states. [2018-10-24 23:39:43,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:39:43,432 INFO L93 Difference]: Finished difference Result 2394 states and 3589 transitions. [2018-10-24 23:39:43,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:39:43,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2018-10-24 23:39:43,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:39:43,445 INFO L225 Difference]: With dead ends: 2394 [2018-10-24 23:39:43,445 INFO L226 Difference]: Without dead ends: 1654 [2018-10-24 23:39:43,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-24 23:39:43,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2018-10-24 23:39:43,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1646. [2018-10-24 23:39:43,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2018-10-24 23:39:43,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2402 transitions. [2018-10-24 23:39:43,510 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2402 transitions. Word has length 83 [2018-10-24 23:39:43,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:39:43,510 INFO L481 AbstractCegarLoop]: Abstraction has 1646 states and 2402 transitions. [2018-10-24 23:39:43,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:39:43,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2402 transitions. [2018-10-24 23:39:43,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-24 23:39:43,514 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:39:43,514 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:39:43,515 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:39:43,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:39:43,515 INFO L82 PathProgramCache]: Analyzing trace with hash 320095328, now seen corresponding path program 1 times [2018-10-24 23:39:43,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:39:43,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:39:43,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:39:43,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:39:43,517 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:39:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:39:43,833 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:39:44,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:39:44,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:39:44,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:39:44,205 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:39:44,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:39:44,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:39:44,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:39:44,207 INFO L87 Difference]: Start difference. First operand 1646 states and 2402 transitions. Second operand 6 states. [2018-10-24 23:39:51,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:39:51,571 INFO L93 Difference]: Finished difference Result 4250 states and 6736 transitions. [2018-10-24 23:39:51,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:39:51,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2018-10-24 23:39:51,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:39:51,598 INFO L225 Difference]: With dead ends: 4250 [2018-10-24 23:39:51,599 INFO L226 Difference]: Without dead ends: 2919 [2018-10-24 23:39:51,607 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:39:51,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2018-10-24 23:39:51,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 2871. [2018-10-24 23:39:51,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2871 states. [2018-10-24 23:39:51,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 4002 transitions. [2018-10-24 23:39:51,707 INFO L78 Accepts]: Start accepts. Automaton has 2871 states and 4002 transitions. Word has length 88 [2018-10-24 23:39:51,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:39:51,708 INFO L481 AbstractCegarLoop]: Abstraction has 2871 states and 4002 transitions. [2018-10-24 23:39:51,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:39:51,708 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 4002 transitions. [2018-10-24 23:39:51,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-24 23:39:51,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:39:51,713 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:39:51,714 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:39:51,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:39:51,714 INFO L82 PathProgramCache]: Analyzing trace with hash 2101566060, now seen corresponding path program 1 times [2018-10-24 23:39:51,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:39:51,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:39:51,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:39:51,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:39:51,716 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:39:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:39:51,865 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:39:51,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:39:51,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 23:39:51,866 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:39:51,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 23:39:51,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 23:39:51,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:39:51,867 INFO L87 Difference]: Start difference. First operand 2871 states and 4002 transitions. Second operand 3 states. [2018-10-24 23:39:55,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:39:55,505 INFO L93 Difference]: Finished difference Result 6354 states and 9172 transitions. [2018-10-24 23:39:55,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 23:39:55,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-10-24 23:39:55,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:39:55,528 INFO L225 Difference]: With dead ends: 6354 [2018-10-24 23:39:55,528 INFO L226 Difference]: Without dead ends: 3798 [2018-10-24 23:39:55,538 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:39:55,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3798 states. [2018-10-24 23:39:55,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3798 to 3798. [2018-10-24 23:39:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3798 states. [2018-10-24 23:39:55,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3798 states to 3798 states and 5085 transitions. [2018-10-24 23:39:55,632 INFO L78 Accepts]: Start accepts. Automaton has 3798 states and 5085 transitions. Word has length 94 [2018-10-24 23:39:55,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:39:55,633 INFO L481 AbstractCegarLoop]: Abstraction has 3798 states and 5085 transitions. [2018-10-24 23:39:55,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 23:39:55,633 INFO L276 IsEmpty]: Start isEmpty. Operand 3798 states and 5085 transitions. [2018-10-24 23:39:55,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-24 23:39:55,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:39:55,635 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:39:55,636 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:39:55,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:39:55,636 INFO L82 PathProgramCache]: Analyzing trace with hash -770209994, now seen corresponding path program 1 times [2018-10-24 23:39:55,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:39:55,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:39:55,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:39:55,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:39:55,638 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:39:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:39:55,886 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:39:55,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:39:55,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:39:55,887 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:39:55,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:39:55,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:39:55,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:39:55,888 INFO L87 Difference]: Start difference. First operand 3798 states and 5085 transitions. Second operand 6 states. [2018-10-24 23:40:03,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:40:03,397 INFO L93 Difference]: Finished difference Result 7604 states and 10325 transitions. [2018-10-24 23:40:03,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:40:03,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-10-24 23:40:03,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:40:03,424 INFO L225 Difference]: With dead ends: 7604 [2018-10-24 23:40:03,424 INFO L226 Difference]: Without dead ends: 4120 [2018-10-24 23:40:03,436 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:40:03,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4120 states. [2018-10-24 23:40:03,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4120 to 4007. [2018-10-24 23:40:03,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4007 states. [2018-10-24 23:40:03,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4007 states to 4007 states and 5161 transitions. [2018-10-24 23:40:03,527 INFO L78 Accepts]: Start accepts. Automaton has 4007 states and 5161 transitions. Word has length 100 [2018-10-24 23:40:03,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:40:03,528 INFO L481 AbstractCegarLoop]: Abstraction has 4007 states and 5161 transitions. [2018-10-24 23:40:03,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:40:03,528 INFO L276 IsEmpty]: Start isEmpty. Operand 4007 states and 5161 transitions. [2018-10-24 23:40:03,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-24 23:40:03,530 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:40:03,530 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:40:03,530 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:40:03,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:40:03,531 INFO L82 PathProgramCache]: Analyzing trace with hash -504215513, now seen corresponding path program 1 times [2018-10-24 23:40:03,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:40:03,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:40:03,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:40:03,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:40:03,532 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:40:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:40:03,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:40:03,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:40:03,952 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:40:03,953 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2018-10-24 23:40:03,956 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [77], [79], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [618], [622], [626], [630], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [691], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-10-24 23:40:04,010 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:40:04,010 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:40:04,842 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 23:40:04,844 INFO L272 AbstractInterpreter]: Visited 104 different actions 298 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-10-24 23:40:04,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:40:04,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 23:40:04,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:40:04,889 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 23:40:04,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:40:04,904 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 23:40:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:40:04,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 23:40:05,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:40:05,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 23:40:05,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:40:05,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-24 23:40:05,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 11 [2018-10-24 23:40:05,545 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:40:05,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:40:05,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:40:05,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-10-24 23:40:05,546 INFO L87 Difference]: Start difference. First operand 4007 states and 5161 transitions. Second operand 6 states. [2018-10-24 23:40:14,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:40:14,271 INFO L93 Difference]: Finished difference Result 12745 states and 17259 transitions. [2018-10-24 23:40:14,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:40:14,274 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-10-24 23:40:14,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:40:14,321 INFO L225 Difference]: With dead ends: 12745 [2018-10-24 23:40:14,321 INFO L226 Difference]: Without dead ends: 9052 [2018-10-24 23:40:14,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-10-24 23:40:14,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9052 states. [2018-10-24 23:40:14,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9052 to 8996. [2018-10-24 23:40:14,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8996 states. [2018-10-24 23:40:14,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8996 states to 8996 states and 11752 transitions. [2018-10-24 23:40:14,666 INFO L78 Accepts]: Start accepts. Automaton has 8996 states and 11752 transitions. Word has length 109 [2018-10-24 23:40:14,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:40:14,667 INFO L481 AbstractCegarLoop]: Abstraction has 8996 states and 11752 transitions. [2018-10-24 23:40:14,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:40:14,667 INFO L276 IsEmpty]: Start isEmpty. Operand 8996 states and 11752 transitions. [2018-10-24 23:40:14,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-24 23:40:14,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:40:14,672 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:40:14,673 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:40:14,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:40:14,677 INFO L82 PathProgramCache]: Analyzing trace with hash 661156445, now seen corresponding path program 1 times [2018-10-24 23:40:14,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:40:14,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:40:14,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:40:14,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:40:14,678 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:40:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:40:14,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:40:14,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:40:14,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 23:40:14,856 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:40:14,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 23:40:14,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 23:40:14,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:40:14,858 INFO L87 Difference]: Start difference. First operand 8996 states and 11752 transitions. Second operand 3 states. [2018-10-24 23:40:18,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:40:18,322 INFO L93 Difference]: Finished difference Result 17682 states and 23224 transitions. [2018-10-24 23:40:18,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 23:40:18,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2018-10-24 23:40:18,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:40:18,358 INFO L225 Difference]: With dead ends: 17682 [2018-10-24 23:40:18,359 INFO L226 Difference]: Without dead ends: 9000 [2018-10-24 23:40:18,390 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:40:18,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9000 states. [2018-10-24 23:40:18,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9000 to 8996. [2018-10-24 23:40:18,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8996 states. [2018-10-24 23:40:18,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8996 states to 8996 states and 11174 transitions. [2018-10-24 23:40:18,581 INFO L78 Accepts]: Start accepts. Automaton has 8996 states and 11174 transitions. Word has length 158 [2018-10-24 23:40:18,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:40:18,581 INFO L481 AbstractCegarLoop]: Abstraction has 8996 states and 11174 transitions. [2018-10-24 23:40:18,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 23:40:18,582 INFO L276 IsEmpty]: Start isEmpty. Operand 8996 states and 11174 transitions. [2018-10-24 23:40:18,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-24 23:40:18,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:40:18,585 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:40:18,586 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:40:18,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:40:18,586 INFO L82 PathProgramCache]: Analyzing trace with hash 913470733, now seen corresponding path program 1 times [2018-10-24 23:40:18,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:40:18,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:40:18,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:40:18,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:40:18,588 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:40:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:40:19,111 WARN L179 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-10-24 23:40:19,370 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 12 proven. 74 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 23:40:19,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:40:19,370 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:40:19,370 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 174 with the following transitions: [2018-10-24 23:40:19,371 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [77], [79], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [609], [610], [614], [617], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-10-24 23:40:19,375 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:40:19,376 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:40:19,467 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:40:19,467 INFO L272 AbstractInterpreter]: Visited 86 different actions 86 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-24 23:40:19,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:40:19,505 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:40:19,871 INFO L232 lantSequenceWeakener]: Weakened 164 states. On average, predicates are now at 77.18% of their original sizes. [2018-10-24 23:40:19,872 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:40:20,111 INFO L413 sIntCurrentIteration]: We have 172 unified AI predicates [2018-10-24 23:40:20,112 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:40:20,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:40:20,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-24 23:40:20,114 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:40:20,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:40:20,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:40:20,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:40:20,115 INFO L87 Difference]: Start difference. First operand 8996 states and 11174 transitions. Second operand 6 states. [2018-10-24 23:40:30,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:40:30,696 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: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: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:40:30,704 INFO L168 Benchmark]: Toolchain (without parser) took 79423.48 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -390.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-24 23:40:30,705 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 23:40:30,706 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1398.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. [2018-10-24 23:40:30,706 INFO L168 Benchmark]: Boogie Procedure Inliner took 412.06 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.6 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -851.7 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. [2018-10-24 23:40:30,707 INFO L168 Benchmark]: Boogie Preprocessor took 246.81 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2018-10-24 23:40:30,708 INFO L168 Benchmark]: RCFGBuilder took 7425.34 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 323.1 MB). Peak memory consumption was 323.1 MB. Max. memory is 7.1 GB. [2018-10-24 23:40:30,709 INFO L168 Benchmark]: TraceAbstraction took 69936.09 ms. Allocated memory was 2.3 GB in the beginning and 3.0 GB in the end (delta: 781.7 MB). Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 17.9 MB). Peak memory consumption was 799.6 MB. Max. memory is 7.1 GB. [2018-10-24 23:40:30,715 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1398.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 412.06 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.6 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -851.7 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 246.81 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 7425.34 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 323.1 MB). Peak memory consumption was 323.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 69936.09 ms. Allocated memory was 2.3 GB in the beginning and 3.0 GB in the end (delta: 781.7 MB). Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 17.9 MB). Peak memory consumption was 799.6 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...