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.epf -i ../../../trunk/examples/svcomp/psyco/psyco_abp_1_false-unreach-call_false-termination_true-no-overflow.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 22:34:19,059 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 22:34:19,061 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 22:34:19,072 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 22:34:19,073 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 22:34:19,074 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 22:34:19,075 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 22:34:19,077 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 22:34:19,078 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 22:34:19,079 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 22:34:19,080 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 22:34:19,080 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 22:34:19,081 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 22:34:19,082 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 22:34:19,083 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 22:34:19,084 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 22:34:19,085 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 22:34:19,087 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 22:34:19,089 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 22:34:19,090 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 22:34:19,092 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 22:34:19,093 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 22:34:19,095 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 22:34:19,096 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 22:34:19,096 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 22:34:19,097 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 22:34:19,098 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 22:34:19,098 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 22:34:19,099 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 22:34:19,100 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 22:34:19,101 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 22:34:19,102 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 22:34:19,102 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 22:34:19,102 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 22:34:19,103 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 22:34:19,104 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 22:34:19,104 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-24 22:34:19,124 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 22:34:19,124 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 22:34:19,128 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 22:34:19,128 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 22:34:19,128 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 22:34:19,129 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 22:34:19,129 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 22:34:19,129 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 22:34:19,129 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 22:34:19,129 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 22:34:19,129 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 22:34:19,130 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 22:34:19,130 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 22:34:19,130 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 22:34:19,131 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 22:34:19,131 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 22:34:19,131 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 22:34:19,131 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 22:34:19,131 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 22:34:19,132 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 22:34:19,134 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 22:34:19,135 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 22:34:19,135 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 22:34:19,135 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 22:34:19,135 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 22:34:19,135 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 22:34:19,136 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 22:34:19,136 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 22:34:19,136 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 22:34:19,136 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 22:34:19,136 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 22:34:19,136 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 22:34:19,137 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 22:34:19,137 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 22:34:19,179 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 22:34:19,192 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 22:34:19,196 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 22:34:19,197 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 22:34:19,198 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 22:34:19,198 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/psyco/psyco_abp_1_false-unreach-call_false-termination_true-no-overflow.c [2018-10-24 22:34:19,261 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e550c7502/861f33db87ea48ee84bec3a53396fa5c/FLAGc0a1e81ba [2018-10-24 22:34:19,760 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 22:34:19,763 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1_false-unreach-call_false-termination_true-no-overflow.c [2018-10-24 22:34:19,784 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e550c7502/861f33db87ea48ee84bec3a53396fa5c/FLAGc0a1e81ba [2018-10-24 22:34:19,803 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e550c7502/861f33db87ea48ee84bec3a53396fa5c [2018-10-24 22:34:19,817 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 22:34:19,819 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 22:34:19,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 22:34:19,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 22:34:19,827 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 22:34:19,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:34:19" (1/1) ... [2018-10-24 22:34:19,831 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@401e83b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:19, skipping insertion in model container [2018-10-24 22:34:19,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:34:19" (1/1) ... [2018-10-24 22:34:19,843 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 22:34:19,906 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 22:34:20,275 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 22:34:20,281 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 22:34:20,357 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 22:34:20,373 INFO L193 MainTranslator]: Completed translation [2018-10-24 22:34:20,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:20 WrapperNode [2018-10-24 22:34:20,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 22:34:20,374 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 22:34:20,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 22:34:20,375 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 22:34:20,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:20" (1/1) ... [2018-10-24 22:34:20,403 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:20" (1/1) ... [2018-10-24 22:34:20,412 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 22:34:20,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 22:34:20,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 22:34:20,413 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 22:34:20,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:20" (1/1) ... [2018-10-24 22:34:20,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:20" (1/1) ... [2018-10-24 22:34:20,425 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:20" (1/1) ... [2018-10-24 22:34:20,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:20" (1/1) ... [2018-10-24 22:34:20,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:20" (1/1) ... [2018-10-24 22:34:20,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:20" (1/1) ... [2018-10-24 22:34:20,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:20" (1/1) ... [2018-10-24 22:34:20,474 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 22:34:20,475 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 22:34:20,475 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 22:34:20,475 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 22:34:20,476 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:20" (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 22:34:20,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 22:34:20,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 22:34:20,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 22:34:20,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 22:34:20,617 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 22:34:20,617 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 22:34:22,280 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 22:34:22,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:34:22 BoogieIcfgContainer [2018-10-24 22:34:22,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 22:34:22,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 22:34:22,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 22:34:22,286 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 22:34:22,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:34:19" (1/3) ... [2018-10-24 22:34:22,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45394a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:34:22, skipping insertion in model container [2018-10-24 22:34:22,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:20" (2/3) ... [2018-10-24 22:34:22,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45394a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:34:22, skipping insertion in model container [2018-10-24 22:34:22,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:34:22" (3/3) ... [2018-10-24 22:34:22,289 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1_false-unreach-call_false-termination_true-no-overflow.c [2018-10-24 22:34:22,299 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 22:34:22,308 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 22:34:22,325 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 22:34:22,360 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 22:34:22,360 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 22:34:22,361 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 22:34:22,361 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 22:34:22,361 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 22:34:22,361 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 22:34:22,361 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 22:34:22,362 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 22:34:22,383 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2018-10-24 22:34:22,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-24 22:34:22,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:34:22,391 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:34:22,393 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:34:22,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:34:22,399 INFO L82 PathProgramCache]: Analyzing trace with hash -662778961, now seen corresponding path program 1 times [2018-10-24 22:34:22,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:34:22,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:34:22,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:34:22,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:34:22,451 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:34:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:34:22,572 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 22:34:22,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 22:34:22,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 22:34:22,575 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:34:22,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 22:34:22,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 22:34:22,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 22:34:22,595 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 3 states. [2018-10-24 22:34:23,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:34:23,659 INFO L93 Difference]: Finished difference Result 331 states and 635 transitions. [2018-10-24 22:34:23,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 22:34:23,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-24 22:34:23,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:34:23,691 INFO L225 Difference]: With dead ends: 331 [2018-10-24 22:34:23,691 INFO L226 Difference]: Without dead ends: 206 [2018-10-24 22:34:23,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 22:34:23,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-24 22:34:23,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 182. [2018-10-24 22:34:23,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-24 22:34:23,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 314 transitions. [2018-10-24 22:34:23,782 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 314 transitions. Word has length 14 [2018-10-24 22:34:23,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:34:23,783 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 314 transitions. [2018-10-24 22:34:23,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 22:34:23,783 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 314 transitions. [2018-10-24 22:34:23,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-24 22:34:23,784 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:34:23,785 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:34:23,785 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:34:23,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:34:23,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1058783719, now seen corresponding path program 1 times [2018-10-24 22:34:23,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:34:23,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:34:23,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:34:23,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:34:23,787 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:34:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:34:23,879 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 22:34:23,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 22:34:23,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 22:34:23,880 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:34:23,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 22:34:23,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 22:34:23,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 22:34:23,883 INFO L87 Difference]: Start difference. First operand 182 states and 314 transitions. Second operand 3 states. [2018-10-24 22:34:24,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:34:24,132 INFO L93 Difference]: Finished difference Result 365 states and 632 transitions. [2018-10-24 22:34:24,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 22:34:24,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-24 22:34:24,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:34:24,135 INFO L225 Difference]: With dead ends: 365 [2018-10-24 22:34:24,135 INFO L226 Difference]: Without dead ends: 189 [2018-10-24 22:34:24,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 22:34:24,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-24 22:34:24,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-10-24 22:34:24,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-24 22:34:24,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 322 transitions. [2018-10-24 22:34:24,154 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 322 transitions. Word has length 15 [2018-10-24 22:34:24,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:34:24,154 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 322 transitions. [2018-10-24 22:34:24,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 22:34:24,155 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 322 transitions. [2018-10-24 22:34:24,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-24 22:34:24,156 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:34:24,156 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:34:24,157 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:34:24,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:34:24,157 INFO L82 PathProgramCache]: Analyzing trace with hash -426524154, now seen corresponding path program 1 times [2018-10-24 22:34:24,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:34:24,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:34:24,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:34:24,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:34:24,159 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:34:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:34:24,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:34:24,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 22:34:24,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 22:34:24,297 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:34:24,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 22:34:24,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 22:34:24,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 22:34:24,301 INFO L87 Difference]: Start difference. First operand 189 states and 322 transitions. Second operand 3 states. [2018-10-24 22:34:24,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:34:24,649 INFO L93 Difference]: Finished difference Result 290 states and 484 transitions. [2018-10-24 22:34:24,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 22:34:24,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-10-24 22:34:24,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:34:24,653 INFO L225 Difference]: With dead ends: 290 [2018-10-24 22:34:24,653 INFO L226 Difference]: Without dead ends: 274 [2018-10-24 22:34:24,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 22:34:24,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-24 22:34:24,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 259. [2018-10-24 22:34:24,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-24 22:34:24,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 436 transitions. [2018-10-24 22:34:24,684 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 436 transitions. Word has length 21 [2018-10-24 22:34:24,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:34:24,684 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 436 transitions. [2018-10-24 22:34:24,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 22:34:24,685 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 436 transitions. [2018-10-24 22:34:24,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-24 22:34:24,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:34:24,686 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:34:24,686 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:34:24,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:34:24,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1881066880, now seen corresponding path program 1 times [2018-10-24 22:34:24,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:34:24,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:34:24,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:34:24,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:34:24,689 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:34:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:34:24,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:34:24,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 22:34:24,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 22:34:24,786 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:34:24,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 22:34:24,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 22:34:24,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 22:34:24,787 INFO L87 Difference]: Start difference. First operand 259 states and 436 transitions. Second operand 3 states. [2018-10-24 22:34:24,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:34:24,882 INFO L93 Difference]: Finished difference Result 468 states and 791 transitions. [2018-10-24 22:34:24,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 22:34:24,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-24 22:34:24,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:34:24,885 INFO L225 Difference]: With dead ends: 468 [2018-10-24 22:34:24,886 INFO L226 Difference]: Without dead ends: 216 [2018-10-24 22:34:24,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 22:34:24,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-24 22:34:24,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2018-10-24 22:34:24,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-10-24 22:34:24,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 355 transitions. [2018-10-24 22:34:24,900 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 355 transitions. Word has length 22 [2018-10-24 22:34:24,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:34:24,900 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 355 transitions. [2018-10-24 22:34:24,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 22:34:24,901 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 355 transitions. [2018-10-24 22:34:24,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-24 22:34:24,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:34:24,903 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:34:24,903 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:34:24,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:34:24,903 INFO L82 PathProgramCache]: Analyzing trace with hash 30525515, now seen corresponding path program 1 times [2018-10-24 22:34:24,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:34:24,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:34:24,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:34:24,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:34:24,905 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:34:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:34:25,018 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:34:25,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:34:25,019 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:34:25,020 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-10-24 22:34:25,022 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [20], [24], [27], [30], [35], [42], [45], [48], [51], [54], [56], [526], [529], [530], [531] [2018-10-24 22:34:25,074 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 22:34:25,075 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:34:26,111 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 22:34:29,008 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:34:29,009 INFO L272 AbstractInterpreter]: Visited 21 different actions 45 times. Merged at 11 different actions 17 times. Never widened. Found 5 fixpoints after 4 different actions. Largest state had 38 variables. [2018-10-24 22:34:29,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:34:29,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:34:29,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:34:29,021 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 22:34:29,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:34:29,033 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:34:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:34:29,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:34:29,175 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-24 22:34:29,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:34:29,204 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-24 22:34:29,232 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-24 22:34:29,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2018-10-24 22:34:29,232 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:34:29,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 22:34:29,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 22:34:29,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 22:34:29,233 INFO L87 Difference]: Start difference. First operand 214 states and 355 transitions. Second operand 3 states. [2018-10-24 22:34:29,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:34:29,296 INFO L93 Difference]: Finished difference Result 389 states and 646 transitions. [2018-10-24 22:34:29,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 22:34:29,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-24 22:34:29,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:34:29,298 INFO L225 Difference]: With dead ends: 389 [2018-10-24 22:34:29,299 INFO L226 Difference]: Without dead ends: 182 [2018-10-24 22:34:29,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 22:34:29,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-24 22:34:29,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-10-24 22:34:29,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-24 22:34:29,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 291 transitions. [2018-10-24 22:34:29,308 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 291 transitions. Word has length 28 [2018-10-24 22:34:29,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:34:29,309 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 291 transitions. [2018-10-24 22:34:29,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 22:34:29,309 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 291 transitions. [2018-10-24 22:34:29,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-24 22:34:29,310 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:34:29,311 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-10-24 22:34:29,311 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:34:29,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:34:29,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1381236108, now seen corresponding path program 1 times [2018-10-24 22:34:29,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:34:29,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:34:29,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:34:29,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:34:29,313 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:34:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:34:29,433 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:34:29,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:34:29,434 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:34:29,434 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-10-24 22:34:29,434 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [239], [242], [245], [526], [529], [530], [531] [2018-10-24 22:34:29,437 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 22:34:29,437 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:34:29,910 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 22:34:32,046 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 22:34:32,046 INFO L272 AbstractInterpreter]: Visited 25 different actions 55 times. Merged at 16 different actions 22 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 39 variables. [2018-10-24 22:34:32,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:34:32,084 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 22:34:33,004 INFO L232 lantSequenceWeakener]: Weakened 28 states. On average, predicates are now at 91.12% of their original sizes. [2018-10-24 22:34:33,004 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 22:34:33,710 INFO L413 sIntCurrentIteration]: We have 29 unified AI predicates [2018-10-24 22:34:33,710 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 22:34:33,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 22:34:33,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-10-24 22:34:33,712 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:34:33,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 22:34:33,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 22:34:33,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-10-24 22:34:33,714 INFO L87 Difference]: Start difference. First operand 180 states and 291 transitions. Second operand 14 states. [2018-10-24 22:34:45,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:34:45,532 INFO L93 Difference]: Finished difference Result 375 states and 610 transitions. [2018-10-24 22:34:45,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 22:34:45,532 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-10-24 22:34:45,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:34:45,534 INFO L225 Difference]: With dead ends: 375 [2018-10-24 22:34:45,535 INFO L226 Difference]: Without dead ends: 220 [2018-10-24 22:34:45,535 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2018-10-24 22:34:45,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-24 22:34:45,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2018-10-24 22:34:45,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-24 22:34:45,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 338 transitions. [2018-10-24 22:34:45,549 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 338 transitions. Word has length 30 [2018-10-24 22:34:45,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:34:45,549 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 338 transitions. [2018-10-24 22:34:45,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-24 22:34:45,550 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 338 transitions. [2018-10-24 22:34:45,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-24 22:34:45,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:34:45,555 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 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 22:34:45,555 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:34:45,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:34:45,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1339641340, now seen corresponding path program 1 times [2018-10-24 22:34:45,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:34:45,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:34:45,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:34:45,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:34:45,558 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:34:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:34:45,718 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 22:34:45,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 22:34:45,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 22:34:45,719 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:34:45,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 22:34:45,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 22:34:45,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 22:34:45,720 INFO L87 Difference]: Start difference. First operand 217 states and 338 transitions. Second operand 3 states. [2018-10-24 22:34:46,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:34:46,185 INFO L93 Difference]: Finished difference Result 391 states and 620 transitions. [2018-10-24 22:34:46,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 22:34:46,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-10-24 22:34:46,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:34:46,187 INFO L225 Difference]: With dead ends: 391 [2018-10-24 22:34:46,187 INFO L226 Difference]: Without dead ends: 223 [2018-10-24 22:34:46,189 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 22:34:46,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-24 22:34:46,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2018-10-24 22:34:46,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-24 22:34:46,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 341 transitions. [2018-10-24 22:34:46,199 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 341 transitions. Word has length 40 [2018-10-24 22:34:46,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:34:46,199 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 341 transitions. [2018-10-24 22:34:46,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 22:34:46,199 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 341 transitions. [2018-10-24 22:34:46,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-24 22:34:46,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:34:46,201 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2018-10-24 22:34:46,201 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:34:46,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:34:46,201 INFO L82 PathProgramCache]: Analyzing trace with hash 2019699710, now seen corresponding path program 1 times [2018-10-24 22:34:46,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:34:46,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:34:46,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:34:46,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:34:46,203 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:34:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:34:46,289 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-24 22:34:46,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 22:34:46,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 22:34:46,290 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:34:46,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 22:34:46,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 22:34:46,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 22:34:46,291 INFO L87 Difference]: Start difference. First operand 221 states and 341 transitions. Second operand 3 states. [2018-10-24 22:34:46,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:34:46,580 INFO L93 Difference]: Finished difference Result 395 states and 619 transitions. [2018-10-24 22:34:46,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 22:34:46,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-10-24 22:34:46,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:34:46,582 INFO L225 Difference]: With dead ends: 395 [2018-10-24 22:34:46,582 INFO L226 Difference]: Without dead ends: 223 [2018-10-24 22:34:46,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 22:34:46,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-24 22:34:46,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2018-10-24 22:34:46,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-24 22:34:46,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 339 transitions. [2018-10-24 22:34:46,593 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 339 transitions. Word has length 40 [2018-10-24 22:34:46,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:34:46,593 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 339 transitions. [2018-10-24 22:34:46,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 22:34:46,593 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 339 transitions. [2018-10-24 22:34:46,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-24 22:34:46,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:34:46,594 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2018-10-24 22:34:46,595 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:34:46,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:34:46,598 INFO L82 PathProgramCache]: Analyzing trace with hash 937434793, now seen corresponding path program 1 times [2018-10-24 22:34:46,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:34:46,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:34:46,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:34:46,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:34:46,600 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:34:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:34:47,216 WARN L179 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-10-24 22:34:47,845 WARN L179 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 16 [2018-10-24 22:34:47,852 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-24 22:34:47,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:34:47,852 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:34:47,852 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-10-24 22:34:47,853 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [262], [329], [332], [335], [338], [341], [526], [529], [530], [531] [2018-10-24 22:34:47,855 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 22:34:47,855 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:34:48,305 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 22:34:56,230 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:34:56,231 INFO L272 AbstractInterpreter]: Visited 31 different actions 145 times. Merged at 24 different actions 96 times. Widened at 2 different actions 4 times. Found 17 fixpoints after 6 different actions. Largest state had 41 variables. [2018-10-24 22:34:56,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:34:56,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:34:56,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:34:56,238 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 22:34:56,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:34:56,247 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:34:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:34:56,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:34:56,501 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 22:34:56,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:34:57,081 WARN L179 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 6 [2018-10-24 22:34:57,281 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 22:34:57,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 22:34:57,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-10-24 22:34:57,311 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 22:34:57,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 22:34:57,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 22:34:57,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-24 22:34:57,313 INFO L87 Difference]: Start difference. First operand 221 states and 339 transitions. Second operand 7 states. [2018-10-24 22:34:58,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:34:58,839 INFO L93 Difference]: Finished difference Result 474 states and 733 transitions. [2018-10-24 22:34:58,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 22:34:58,840 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-10-24 22:34:58,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:34:58,843 INFO L225 Difference]: With dead ends: 474 [2018-10-24 22:34:58,843 INFO L226 Difference]: Without dead ends: 292 [2018-10-24 22:34:58,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-10-24 22:34:58,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-10-24 22:34:58,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 272. [2018-10-24 22:34:58,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-10-24 22:34:58,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 419 transitions. [2018-10-24 22:34:58,860 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 419 transitions. Word has length 41 [2018-10-24 22:34:58,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:34:58,860 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 419 transitions. [2018-10-24 22:34:58,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 22:34:58,861 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 419 transitions. [2018-10-24 22:34:58,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-24 22:34:58,861 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:34:58,862 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2018-10-24 22:34:58,863 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:34:58,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:34:58,863 INFO L82 PathProgramCache]: Analyzing trace with hash -992845957, now seen corresponding path program 1 times [2018-10-24 22:34:58,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:34:58,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:34:58,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:34:58,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:34:58,865 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:34:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:34:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 22:34:58,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:34:58,983 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:34:58,983 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-10-24 22:34:58,983 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [262], [329], [332], [347], [350], [353], [356], [526], [529], [530], [531] [2018-10-24 22:34:58,988 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 22:34:58,988 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:34:59,333 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 22:35:05,522 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:35:05,522 INFO L272 AbstractInterpreter]: Visited 32 different actions 147 times. Merged at 25 different actions 95 times. Widened at 2 different actions 4 times. Found 17 fixpoints after 6 different actions. Largest state had 42 variables. [2018-10-24 22:35:05,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:35:05,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:35:05,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:35:05,557 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-24 22:35:05,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:35:05,567 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 22:35:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:35:05,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:35:05,744 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 22:35:05,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:35:05,909 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 22:35:05,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 22:35:05,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2018-10-24 22:35:05,938 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 22:35:05,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 22:35:05,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 22:35:05,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-24 22:35:05,941 INFO L87 Difference]: Start difference. First operand 272 states and 419 transitions. Second operand 4 states. [2018-10-24 22:35:07,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:35:07,202 INFO L93 Difference]: Finished difference Result 446 states and 695 transitions. [2018-10-24 22:35:07,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 22:35:07,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-10-24 22:35:07,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:35:07,206 INFO L225 Difference]: With dead ends: 446 [2018-10-24 22:35:07,206 INFO L226 Difference]: Without dead ends: 424 [2018-10-24 22:35:07,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-24 22:35:07,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-10-24 22:35:07,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 422. [2018-10-24 22:35:07,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-10-24 22:35:07,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 636 transitions. [2018-10-24 22:35:07,224 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 636 transitions. Word has length 42 [2018-10-24 22:35:07,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:35:07,225 INFO L481 AbstractCegarLoop]: Abstraction has 422 states and 636 transitions. [2018-10-24 22:35:07,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 22:35:07,225 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 636 transitions. [2018-10-24 22:35:07,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-24 22:35:07,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:35:07,226 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2018-10-24 22:35:07,226 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:35:07,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:35:07,226 INFO L82 PathProgramCache]: Analyzing trace with hash -275920596, now seen corresponding path program 1 times [2018-10-24 22:35:07,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:35:07,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:07,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:35:07,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:07,227 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:35:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:35:07,608 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 22:35:07,957 WARN L179 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-10-24 22:35:08,048 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:35:08,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:35:08,048 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:35:08,049 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-10-24 22:35:08,049 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [262], [329], [332], [347], [362], [377], [380], [383], [386], [526], [529], [530], [531] [2018-10-24 22:35:08,053 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 22:35:08,053 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:35:08,499 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 22:35:18,521 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:35:18,522 INFO L272 AbstractInterpreter]: Visited 34 different actions 157 times. Merged at 27 different actions 105 times. Widened at 2 different actions 4 times. Found 17 fixpoints after 6 different actions. Largest state had 44 variables. [2018-10-24 22:35:18,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:35:18,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:35:18,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:35:18,552 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 22:35:18,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:35:18,569 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:35:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:35:18,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:35:18,761 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:35:18,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:35:19,579 WARN L179 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 11 [2018-10-24 22:35:20,043 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:35:20,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 22:35:20,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-10-24 22:35:20,073 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 22:35:20,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 22:35:20,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 22:35:20,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-24 22:35:20,075 INFO L87 Difference]: Start difference. First operand 422 states and 636 transitions. Second operand 5 states. [2018-10-24 22:35:20,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:35:20,630 INFO L93 Difference]: Finished difference Result 431 states and 643 transitions. [2018-10-24 22:35:20,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 22:35:20,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-10-24 22:35:20,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:35:20,635 INFO L225 Difference]: With dead ends: 431 [2018-10-24 22:35:20,635 INFO L226 Difference]: Without dead ends: 429 [2018-10-24 22:35:20,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-24 22:35:20,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-10-24 22:35:20,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 423. [2018-10-24 22:35:20,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-10-24 22:35:20,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 637 transitions. [2018-10-24 22:35:20,653 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 637 transitions. Word has length 44 [2018-10-24 22:35:20,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:35:20,653 INFO L481 AbstractCegarLoop]: Abstraction has 423 states and 637 transitions. [2018-10-24 22:35:20,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 22:35:20,653 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 637 transitions. [2018-10-24 22:35:20,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-24 22:35:20,655 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:35:20,655 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2018-10-24 22:35:20,655 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:35:20,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:35:20,656 INFO L82 PathProgramCache]: Analyzing trace with hash 161633879, now seen corresponding path program 1 times [2018-10-24 22:35:20,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:35:20,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:20,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:35:20,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:20,657 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:35:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:35:20,730 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-24 22:35:20,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 22:35:20,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 22:35:20,731 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:35:20,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 22:35:20,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 22:35:20,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 22:35:20,732 INFO L87 Difference]: Start difference. First operand 423 states and 637 transitions. Second operand 3 states. [2018-10-24 22:35:20,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:35:20,984 INFO L93 Difference]: Finished difference Result 795 states and 1193 transitions. [2018-10-24 22:35:20,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 22:35:20,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-10-24 22:35:20,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:35:20,988 INFO L225 Difference]: With dead ends: 795 [2018-10-24 22:35:20,988 INFO L226 Difference]: Without dead ends: 421 [2018-10-24 22:35:20,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 22:35:20,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-10-24 22:35:21,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 399. [2018-10-24 22:35:21,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-24 22:35:21,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 584 transitions. [2018-10-24 22:35:21,007 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 584 transitions. Word has length 45 [2018-10-24 22:35:21,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:35:21,007 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 584 transitions. [2018-10-24 22:35:21,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 22:35:21,008 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 584 transitions. [2018-10-24 22:35:21,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-24 22:35:21,008 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:35:21,008 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 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] [2018-10-24 22:35:21,009 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:35:21,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:35:21,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1614817955, now seen corresponding path program 1 times [2018-10-24 22:35:21,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:35:21,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:21,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:35:21,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:21,010 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:35:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:35:21,096 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-24 22:35:21,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 22:35:21,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 22:35:21,096 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:35:21,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 22:35:21,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 22:35:21,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 22:35:21,097 INFO L87 Difference]: Start difference. First operand 399 states and 584 transitions. Second operand 3 states. [2018-10-24 22:35:21,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:35:21,384 INFO L93 Difference]: Finished difference Result 555 states and 812 transitions. [2018-10-24 22:35:21,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 22:35:21,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-10-24 22:35:21,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:35:21,386 INFO L225 Difference]: With dead ends: 555 [2018-10-24 22:35:21,387 INFO L226 Difference]: Without dead ends: 225 [2018-10-24 22:35:21,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 22:35:21,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-24 22:35:21,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2018-10-24 22:35:21,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-10-24 22:35:21,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 316 transitions. [2018-10-24 22:35:21,398 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 316 transitions. Word has length 55 [2018-10-24 22:35:21,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:35:21,398 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 316 transitions. [2018-10-24 22:35:21,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 22:35:21,398 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 316 transitions. [2018-10-24 22:35:21,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-24 22:35:21,399 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:35:21,399 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 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] [2018-10-24 22:35:21,399 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:35:21,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:35:21,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1860919614, now seen corresponding path program 1 times [2018-10-24 22:35:21,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:35:21,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:21,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:35:21,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:21,400 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:35:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:35:21,634 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 22:35:21,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:35:21,634 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:35:21,634 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-10-24 22:35:21,635 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [262], [329], [332], [347], [362], [377], [380], [383], [388], [425], [428], [443], [446], [449], [452], [526], [529], [530], [531] [2018-10-24 22:35:21,637 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 22:35:21,637 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:35:22,049 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 22:35:32,362 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:35:32,362 INFO L272 AbstractInterpreter]: Visited 41 different actions 233 times. Merged at 33 different actions 152 times. Widened at 3 different actions 6 times. Found 27 fixpoints after 8 different actions. Largest state had 46 variables. [2018-10-24 22:35:32,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:35:32,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:35:32,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:35:32,373 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 22:35:32,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:35:32,381 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:35:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:35:32,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:35:32,443 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 22:35:32,443 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:35:32,555 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 22:35:32,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 22:35:32,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-10-24 22:35:32,580 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 22:35:32,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 22:35:32,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 22:35:32,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-24 22:35:32,582 INFO L87 Difference]: Start difference. First operand 223 states and 316 transitions. Second operand 5 states. [2018-10-24 22:35:32,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:35:32,835 INFO L93 Difference]: Finished difference Result 597 states and 858 transitions. [2018-10-24 22:35:32,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 22:35:32,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-10-24 22:35:32,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:35:32,838 INFO L225 Difference]: With dead ends: 597 [2018-10-24 22:35:32,838 INFO L226 Difference]: Without dead ends: 442 [2018-10-24 22:35:32,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-24 22:35:32,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-10-24 22:35:32,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 326. [2018-10-24 22:35:32,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-24 22:35:32,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 472 transitions. [2018-10-24 22:35:32,854 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 472 transitions. Word has length 56 [2018-10-24 22:35:32,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:35:32,855 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 472 transitions. [2018-10-24 22:35:32,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 22:35:32,855 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 472 transitions. [2018-10-24 22:35:32,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-24 22:35:32,855 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:35:32,856 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 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] [2018-10-24 22:35:32,856 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:35:32,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:35:32,856 INFO L82 PathProgramCache]: Analyzing trace with hash 2119085052, now seen corresponding path program 1 times [2018-10-24 22:35:32,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:35:32,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:32,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:35:32,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:32,857 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:35:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:35:33,182 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 22:35:33,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:35:33,183 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:35:33,183 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-10-24 22:35:33,183 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [262], [329], [332], [347], [362], [377], [380], [383], [388], [425], [428], [443], [446], [449], [452], [526], [529], [530], [531] [2018-10-24 22:35:33,185 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 22:35:33,185 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:35:33,510 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 22:35:42,830 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:35:42,830 INFO L272 AbstractInterpreter]: Visited 40 different actions 222 times. Merged at 33 different actions 152 times. Widened at 3 different actions 6 times. Found 27 fixpoints after 8 different actions. Largest state had 46 variables. [2018-10-24 22:35:42,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:35:42,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:35:42,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:35:42,841 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 22:35:42,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:35:42,849 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:35:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:35:42,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:35:42,945 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 22:35:42,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:35:43,180 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 8 [2018-10-24 22:35:43,315 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-24 22:35:43,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 22:35:43,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2018-10-24 22:35:43,335 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 22:35:43,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 22:35:43,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 22:35:43,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-24 22:35:43,336 INFO L87 Difference]: Start difference. First operand 326 states and 472 transitions. Second operand 5 states. [2018-10-24 22:35:43,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:35:43,494 INFO L93 Difference]: Finished difference Result 373 states and 538 transitions. [2018-10-24 22:35:43,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 22:35:43,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-10-24 22:35:43,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:35:43,498 INFO L225 Difference]: With dead ends: 373 [2018-10-24 22:35:43,498 INFO L226 Difference]: Without dead ends: 367 [2018-10-24 22:35:43,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-24 22:35:43,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-10-24 22:35:43,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 364. [2018-10-24 22:35:43,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-24 22:35:43,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 526 transitions. [2018-10-24 22:35:43,515 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 526 transitions. Word has length 56 [2018-10-24 22:35:43,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:35:43,515 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 526 transitions. [2018-10-24 22:35:43,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 22:35:43,515 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 526 transitions. [2018-10-24 22:35:43,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-24 22:35:43,516 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:35:43,516 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 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] [2018-10-24 22:35:43,516 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:35:43,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:35:43,516 INFO L82 PathProgramCache]: Analyzing trace with hash 807144158, now seen corresponding path program 1 times [2018-10-24 22:35:43,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:35:43,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:43,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:35:43,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:43,518 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:35:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:35:44,195 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:35:44,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:35:44,195 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:35:44,195 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-10-24 22:35:44,196 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [262], [329], [332], [347], [362], [377], [380], [383], [388], [425], [428], [443], [458], [473], [488], [503], [506], [509], [512], [526], [529], [530], [531] [2018-10-24 22:35:44,198 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 22:35:44,198 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:35:44,470 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 22:35:54,562 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:35:54,563 INFO L272 AbstractInterpreter]: Visited 44 different actions 243 times. Merged at 37 different actions 170 times. Widened at 3 different actions 6 times. Found 27 fixpoints after 8 different actions. Largest state had 50 variables. [2018-10-24 22:35:54,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:35:54,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:35:54,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:35:54,574 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 22:35:54,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:35:54,582 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:35:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:35:54,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:35:54,727 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:35:54,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:35:54,870 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:35:54,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 22:35:54,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2018-10-24 22:35:54,891 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 22:35:54,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 22:35:54,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 22:35:54,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-10-24 22:35:54,892 INFO L87 Difference]: Start difference. First operand 364 states and 526 transitions. Second operand 10 states. [2018-10-24 22:35:55,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:35:55,151 INFO L93 Difference]: Finished difference Result 367 states and 528 transitions. [2018-10-24 22:35:55,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 22:35:55,151 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2018-10-24 22:35:55,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:35:55,154 INFO L225 Difference]: With dead ends: 367 [2018-10-24 22:35:55,155 INFO L226 Difference]: Without dead ends: 365 [2018-10-24 22:35:55,155 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-10-24 22:35:55,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-10-24 22:35:55,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 364. [2018-10-24 22:35:55,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-24 22:35:55,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 525 transitions. [2018-10-24 22:35:55,171 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 525 transitions. Word has length 60 [2018-10-24 22:35:55,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:35:55,171 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 525 transitions. [2018-10-24 22:35:55,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 22:35:55,171 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 525 transitions. [2018-10-24 22:35:55,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-24 22:35:55,172 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:35:55,172 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:35:55,172 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:35:55,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:35:55,173 INFO L82 PathProgramCache]: Analyzing trace with hash -743255307, now seen corresponding path program 1 times [2018-10-24 22:35:55,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:35:55,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:55,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:35:55,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:55,174 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:35:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:35:55,497 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:35:55,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:35:55,498 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:35:55,498 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 68 with the following transitions: [2018-10-24 22:35:55,498 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [20], [24], [27], [30], [35], [42], [45], [48], [51], [54], [56], [138], [233], [236], [251], [254], [257], [262], [329], [332], [347], [362], [377], [380], [383], [388], [425], [428], [443], [458], [473], [488], [503], [506], [509], [514], [526], [529], [530], [531] [2018-10-24 22:35:55,500 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 22:35:55,500 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:35:55,836 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 22:36:35,471 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:36:35,472 INFO L272 AbstractInterpreter]: Visited 45 different actions 781 times. Merged at 38 different actions 630 times. Widened at 5 different actions 41 times. Found 105 fixpoints after 14 different actions. Largest state had 50 variables. [2018-10-24 22:36:35,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:36:35,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:36:35,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:36:35,479 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 22:36:35,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:36:35,488 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:36:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:36:35,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:36:35,690 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:36:35,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:36:36,389 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 44 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 22:36:36,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 22:36:36,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 14 [2018-10-24 22:36:36,411 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 22:36:36,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 22:36:36,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 22:36:36,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-10-24 22:36:36,412 INFO L87 Difference]: Start difference. First operand 364 states and 525 transitions. Second operand 9 states. [2018-10-24 22:36:36,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:36:36,743 INFO L93 Difference]: Finished difference Result 368 states and 529 transitions. [2018-10-24 22:36:36,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 22:36:36,744 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-10-24 22:36:36,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:36:36,746 INFO L225 Difference]: With dead ends: 368 [2018-10-24 22:36:36,746 INFO L226 Difference]: Without dead ends: 366 [2018-10-24 22:36:36,747 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 124 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-10-24 22:36:36,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-10-24 22:36:36,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 365. [2018-10-24 22:36:36,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-10-24 22:36:36,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 526 transitions. [2018-10-24 22:36:36,763 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 526 transitions. Word has length 67 [2018-10-24 22:36:36,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:36:36,764 INFO L481 AbstractCegarLoop]: Abstraction has 365 states and 526 transitions. [2018-10-24 22:36:36,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 22:36:36,764 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 526 transitions. [2018-10-24 22:36:36,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-24 22:36:36,765 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:36:36,765 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:36:36,765 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:36:36,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:36:36,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1746386041, now seen corresponding path program 1 times [2018-10-24 22:36:36,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:36:36,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:36:36,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:36:36,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:36:36,767 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:36:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:36:36,888 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 38 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-24 22:36:36,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:36:36,889 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:36:36,889 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 78 with the following transitions: [2018-10-24 22:36:36,889 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [260], [262], [329], [332], [347], [362], [377], [380], [383], [388], [425], [428], [443], [458], [473], [488], [503], [506], [509], [514], [526], [529], [530], [531] [2018-10-24 22:36:36,891 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 22:36:36,891 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:36:37,249 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 22:37:23,550 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:37:23,550 INFO L272 AbstractInterpreter]: Visited 46 different actions 945 times. Merged at 39 different actions 734 times. Widened at 5 different actions 46 times. Found 128 fixpoints after 16 different actions. Largest state had 50 variables. [2018-10-24 22:37:23,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:37:23,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:37:23,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:37:23,558 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 22:37:23,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:37:23,568 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:37:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:37:23,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:37:23,647 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 38 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-24 22:37:23,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:37:23,784 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 38 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-24 22:37:23,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 22:37:23,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-10-24 22:37:23,806 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 22:37:23,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 22:37:23,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 22:37:23,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-24 22:37:23,807 INFO L87 Difference]: Start difference. First operand 365 states and 526 transitions. Second operand 6 states. [2018-10-24 22:37:24,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:37:24,158 INFO L93 Difference]: Finished difference Result 825 states and 1192 transitions. [2018-10-24 22:37:24,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 22:37:24,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-10-24 22:37:24,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:37:24,162 INFO L225 Difference]: With dead ends: 825 [2018-10-24 22:37:24,162 INFO L226 Difference]: Without dead ends: 568 [2018-10-24 22:37:24,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-24 22:37:24,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-10-24 22:37:24,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 446. [2018-10-24 22:37:24,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-10-24 22:37:24,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 649 transitions. [2018-10-24 22:37:24,184 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 649 transitions. Word has length 77 [2018-10-24 22:37:24,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:37:24,184 INFO L481 AbstractCegarLoop]: Abstraction has 446 states and 649 transitions. [2018-10-24 22:37:24,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 22:37:24,184 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 649 transitions. [2018-10-24 22:37:24,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-24 22:37:24,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:37:24,185 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:37:24,185 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:37:24,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:37:24,186 INFO L82 PathProgramCache]: Analyzing trace with hash -2139413051, now seen corresponding path program 1 times [2018-10-24 22:37:24,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:37:24,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:37:24,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:37:24,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:37:24,187 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:37:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:37:24,368 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-24 22:37:24,629 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:37:24,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:37:24,629 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:37:24,629 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 78 with the following transitions: [2018-10-24 22:37:24,630 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [260], [262], [329], [332], [347], [362], [377], [380], [383], [388], [425], [428], [443], [458], [473], [488], [503], [506], [509], [514], [526], [529], [530], [531] [2018-10-24 22:37:24,631 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 22:37:24,631 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:37:24,920 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 22:38:00,456 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:38:00,456 INFO L272 AbstractInterpreter]: Visited 45 different actions 785 times. Merged at 38 different actions 632 times. Widened at 5 different actions 42 times. Found 104 fixpoints after 13 different actions. Largest state had 50 variables. [2018-10-24 22:38:00,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:38:00,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:38:00,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:38:00,463 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 22:38:00,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:38:00,471 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:38:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:38:00,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:38:00,659 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 70 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-24 22:38:00,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:38:00,756 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 35 proven. 43 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-24 22:38:00,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 22:38:00,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 16 [2018-10-24 22:38:00,777 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 22:38:00,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 22:38:00,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 22:38:00,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-10-24 22:38:00,778 INFO L87 Difference]: Start difference. First operand 446 states and 649 transitions. Second operand 12 states. [2018-10-24 22:38:00,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:38:00,976 INFO L93 Difference]: Finished difference Result 472 states and 685 transitions. [2018-10-24 22:38:00,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 22:38:00,976 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 77 [2018-10-24 22:38:00,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:38:00,979 INFO L225 Difference]: With dead ends: 472 [2018-10-24 22:38:00,979 INFO L226 Difference]: Without dead ends: 468 [2018-10-24 22:38:00,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 146 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-10-24 22:38:00,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-10-24 22:38:00,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2018-10-24 22:38:00,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-10-24 22:38:00,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 679 transitions. [2018-10-24 22:38:00,998 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 679 transitions. Word has length 77 [2018-10-24 22:38:00,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:38:00,999 INFO L481 AbstractCegarLoop]: Abstraction has 468 states and 679 transitions. [2018-10-24 22:38:00,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 22:38:00,999 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 679 transitions. [2018-10-24 22:38:01,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-24 22:38:01,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:38:01,000 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:38:01,000 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:38:01,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:38:01,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1314627048, now seen corresponding path program 1 times [2018-10-24 22:38:01,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:38:01,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:38:01,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:38:01,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:38:01,002 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:38:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:38:01,390 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 26 proven. 99 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-24 22:38:01,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:38:01,390 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:38:01,390 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 88 with the following transitions: [2018-10-24 22:38:01,390 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [262], [329], [332], [335], [338], [341], [347], [362], [377], [380], [383], [388], [425], [428], [443], [458], [473], [488], [503], [506], [509], [514], [526], [529], [530], [531] [2018-10-24 22:38:01,392 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 22:38:01,392 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:38:01,729 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-10-24 22:38:10,765 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-10-24 22:38:10,766 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-10-24 22:38:10,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 22:38:10,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:38:10,767 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 22:38:10,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:38:10,779 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:38:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:38:10,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:38:10,849 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-24 22:38:11,050 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 22:38:11,051 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 22:38:11,057 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 22:38:11,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:38:11 BoogieIcfgContainer [2018-10-24 22:38:11,058 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 22:38:11,059 INFO L168 Benchmark]: Toolchain (without parser) took 231241.10 ms. Allocated memory was 1.5 GB in the beginning and 4.3 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-24 22:38:11,059 INFO L168 Benchmark]: CDTParser took 0.21 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 22:38:11,060 INFO L168 Benchmark]: CACSL2BoogieTranslator took 553.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-24 22:38:11,061 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.95 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 22:38:11,061 INFO L168 Benchmark]: Boogie Preprocessor took 61.82 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 22:38:11,061 INFO L168 Benchmark]: RCFGBuilder took 1806.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -768.6 MB). Peak memory consumption was 17.7 MB. Max. memory is 7.1 GB. [2018-10-24 22:38:11,062 INFO L168 Benchmark]: TraceAbstraction took 228776.03 ms. Allocated memory was 2.3 GB in the beginning and 4.3 GB in the end (delta: 2.0 GB). Free memory was 2.2 GB in the beginning and 3.0 GB in the end (delta: -788.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-24 22:38:11,066 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.21 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 553.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.95 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. * Boogie Preprocessor took 61.82 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. * RCFGBuilder took 1806.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -768.6 MB). Peak memory consumption was 17.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 228776.03 ms. Allocated memory was 2.3 GB in the beginning and 4.3 GB in the end (delta: 2.0 GB). Free memory was 2.2 GB in the beginning and 3.0 GB in the end (delta: -788.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 569). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 8,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 115 locations, 1 error locations. TIMEOUT Result, 228.7s OverallTime, 20 OverallIterations, 8 TraceHistogramMax, 19.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3077 SDtfs, 2601 SDslu, 6113 SDs, 0 SdLazy, 1853 SolverSat, 240 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.0s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 1219 GetRequests, 1093 SyntacticMatches, 19 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=468occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 194.7s AbstIntTime, 12 AbstIntIterations, 1 AbstIntStrong, 0.949160035366932 AbsIntWeakeningRatio, 1.5517241379310345 AbsIntAvgWeakeningVarsNumRemoved, 593.7931034482758 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 345 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 1378 NumberOfCodeBlocks, 1378 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1887 ConstructedInterpolants, 52 QuantifiedInterpolants, 592757 SizeOfPredicates, 28 NumberOfNonLiveVariables, 3526 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 39 InterpolantComputations, 10 PerfectInterpolantSequences, 755/1548 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown