java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-01_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 17:40:34,482 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 17:40:34,484 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 17:40:34,498 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 17:40:34,499 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 17:40:34,499 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 17:40:34,500 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 17:40:34,501 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 17:40:34,503 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 17:40:34,503 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 17:40:34,504 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 17:40:34,504 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 17:40:34,505 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 17:40:34,506 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 17:40:34,506 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 17:40:34,509 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 17:40:34,511 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 17:40:34,513 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 17:40:34,514 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 17:40:34,515 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 17:40:34,518 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 17:40:34,518 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 17:40:34,518 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 17:40:34,519 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 17:40:34,520 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 17:40:34,521 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 17:40:34,521 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 17:40:34,522 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 17:40:34,522 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 17:40:34,523 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 17:40:34,523 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 17:40:34,523 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-24 17:40:34,533 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 17:40:34,533 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 17:40:34,534 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 17:40:34,534 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 17:40:34,535 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 17:40:34,535 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 17:40:34,535 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 17:40:34,535 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 17:40:34,536 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 17:40:34,536 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 17:40:34,536 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 17:40:34,536 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 17:40:34,537 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 17:40:34,537 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 17:40:34,537 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 17:40:34,537 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 17:40:34,537 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 17:40:34,538 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 17:40:34,538 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 17:40:34,538 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 17:40:34,538 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 17:40:34,538 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 17:40:34,539 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 17:40:34,539 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 17:40:34,539 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:40:34,539 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 17:40:34,539 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 17:40:34,540 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 17:40:34,540 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 17:40:34,540 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 17:40:34,540 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 17:40:34,540 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 17:40:34,541 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 17:40:34,541 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 17:40:34,542 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 17:40:34,542 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 17:40:34,575 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 17:40:34,587 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 17:40:34,590 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 17:40:34,592 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 17:40:34,592 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 17:40:34,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-01-24 17:40:34,757 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 17:40:34,762 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 17:40:34,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 17:40:34,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 17:40:34,767 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 17:40:34,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:40:34" (1/1) ... [2018-01-24 17:40:34,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@321f72c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:40:34, skipping insertion in model container [2018-01-24 17:40:34,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:40:34" (1/1) ... [2018-01-24 17:40:34,784 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:40:34,825 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:40:34,957 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:40:34,983 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:40:34,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:40:34 WrapperNode [2018-01-24 17:40:34,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 17:40:34,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 17:40:34,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 17:40:34,996 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 17:40:35,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:40:34" (1/1) ... [2018-01-24 17:40:35,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:40:34" (1/1) ... [2018-01-24 17:40:35,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:40:34" (1/1) ... [2018-01-24 17:40:35,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:40:34" (1/1) ... [2018-01-24 17:40:35,030 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:40:34" (1/1) ... [2018-01-24 17:40:35,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:40:34" (1/1) ... [2018-01-24 17:40:35,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:40:34" (1/1) ... [2018-01-24 17:40:35,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 17:40:35,044 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 17:40:35,044 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 17:40:35,045 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 17:40:35,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:40:34" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:40:35,096 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 17:40:35,096 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 17:40:35,096 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 17:40:35,096 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 17:40:35,096 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 17:40:35,097 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 17:40:35,097 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 17:40:35,097 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 17:40:35,097 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 17:40:35,097 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 17:40:35,098 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 17:40:35,098 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 17:40:35,098 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 17:40:35,098 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 17:40:35,098 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 17:40:35,690 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 17:40:35,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:40:35 BoogieIcfgContainer [2018-01-24 17:40:35,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 17:40:35,692 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 17:40:35,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 17:40:35,695 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 17:40:35,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 05:40:34" (1/3) ... [2018-01-24 17:40:35,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18828e80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:40:35, skipping insertion in model container [2018-01-24 17:40:35,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:40:34" (2/3) ... [2018-01-24 17:40:35,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18828e80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:40:35, skipping insertion in model container [2018-01-24 17:40:35,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:40:35" (3/3) ... [2018-01-24 17:40:35,700 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2018-01-24 17:40:35,709 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 17:40:35,717 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-01-24 17:40:35,770 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 17:40:35,770 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 17:40:35,770 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 17:40:35,770 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 17:40:35,770 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 17:40:35,771 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 17:40:35,771 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 17:40:35,771 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 17:40:35,772 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 17:40:35,797 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states. [2018-01-24 17:40:35,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 17:40:35,804 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:40:35,805 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:40:35,805 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:40:35,810 INFO L82 PathProgramCache]: Analyzing trace with hash 2039196070, now seen corresponding path program 1 times [2018-01-24 17:40:35,813 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:40:35,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:35,872 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:40:35,872 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:35,872 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:40:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:40:35,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:40:35,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:40:35,989 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:40:35,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:40:35,989 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:40:35,993 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:40:36,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:40:36,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:40:36,013 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 4 states. [2018-01-24 17:40:36,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:40:36,357 INFO L93 Difference]: Finished difference Result 394 states and 523 transitions. [2018-01-24 17:40:36,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:40:36,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 17:40:36,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:40:36,371 INFO L225 Difference]: With dead ends: 394 [2018-01-24 17:40:36,371 INFO L226 Difference]: Without dead ends: 211 [2018-01-24 17:40:36,376 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:40:36,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-01-24 17:40:36,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 181. [2018-01-24 17:40:36,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-01-24 17:40:36,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 194 transitions. [2018-01-24 17:40:36,417 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 194 transitions. Word has length 8 [2018-01-24 17:40:36,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:40:36,417 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 194 transitions. [2018-01-24 17:40:36,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:40:36,417 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 194 transitions. [2018-01-24 17:40:36,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 17:40:36,418 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:40:36,418 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:40:36,418 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:40:36,418 INFO L82 PathProgramCache]: Analyzing trace with hash 2039196071, now seen corresponding path program 1 times [2018-01-24 17:40:36,418 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:40:36,419 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:36,419 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:40:36,419 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:36,420 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:40:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:40:36,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:40:36,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:40:36,515 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:40:36,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:40:36,515 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:40:36,517 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:40:36,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:40:36,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:40:36,518 INFO L87 Difference]: Start difference. First operand 181 states and 194 transitions. Second operand 4 states. [2018-01-24 17:40:36,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:40:36,725 INFO L93 Difference]: Finished difference Result 214 states and 227 transitions. [2018-01-24 17:40:36,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:40:36,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 17:40:36,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:40:36,729 INFO L225 Difference]: With dead ends: 214 [2018-01-24 17:40:36,729 INFO L226 Difference]: Without dead ends: 204 [2018-01-24 17:40:36,730 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:40:36,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-01-24 17:40:36,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 193. [2018-01-24 17:40:36,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-01-24 17:40:36,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 213 transitions. [2018-01-24 17:40:36,747 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 213 transitions. Word has length 8 [2018-01-24 17:40:36,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:40:36,747 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 213 transitions. [2018-01-24 17:40:36,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:40:36,747 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 213 transitions. [2018-01-24 17:40:36,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 17:40:36,748 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:40:36,748 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:40:36,748 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:40:36,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1799051431, now seen corresponding path program 1 times [2018-01-24 17:40:36,749 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:40:36,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:36,750 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:40:36,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:36,750 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:40:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:40:36,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:40:36,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:40:36,812 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:40:36,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:40:36,813 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:40:36,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:40:36,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:40:36,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:40:36,813 INFO L87 Difference]: Start difference. First operand 193 states and 213 transitions. Second operand 5 states. [2018-01-24 17:40:37,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:40:37,148 INFO L93 Difference]: Finished difference Result 330 states and 359 transitions. [2018-01-24 17:40:37,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:40:37,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 17:40:37,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:40:37,151 INFO L225 Difference]: With dead ends: 330 [2018-01-24 17:40:37,151 INFO L226 Difference]: Without dead ends: 329 [2018-01-24 17:40:37,152 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:40:37,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-01-24 17:40:37,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 192. [2018-01-24 17:40:37,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-01-24 17:40:37,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 212 transitions. [2018-01-24 17:40:37,169 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 212 transitions. Word has length 17 [2018-01-24 17:40:37,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:40:37,170 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 212 transitions. [2018-01-24 17:40:37,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:40:37,170 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 212 transitions. [2018-01-24 17:40:37,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 17:40:37,171 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:40:37,171 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:40:37,171 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:40:37,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1799051430, now seen corresponding path program 1 times [2018-01-24 17:40:37,172 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:40:37,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:37,173 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:40:37,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:37,174 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:40:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:40:37,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:40:37,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:40:37,288 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:40:37,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:40:37,289 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:40:37,289 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:40:37,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:40:37,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:40:37,290 INFO L87 Difference]: Start difference. First operand 192 states and 212 transitions. Second operand 5 states. [2018-01-24 17:40:37,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:40:37,582 INFO L93 Difference]: Finished difference Result 359 states and 398 transitions. [2018-01-24 17:40:37,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:40:37,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 17:40:37,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:40:37,585 INFO L225 Difference]: With dead ends: 359 [2018-01-24 17:40:37,585 INFO L226 Difference]: Without dead ends: 358 [2018-01-24 17:40:37,586 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:40:37,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-01-24 17:40:37,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 191. [2018-01-24 17:40:37,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-24 17:40:37,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 211 transitions. [2018-01-24 17:40:37,598 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 211 transitions. Word has length 17 [2018-01-24 17:40:37,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:40:37,598 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 211 transitions. [2018-01-24 17:40:37,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:40:37,598 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 211 transitions. [2018-01-24 17:40:37,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 17:40:37,599 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:40:37,599 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:40:37,599 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:40:37,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1355722779, now seen corresponding path program 1 times [2018-01-24 17:40:37,599 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:40:37,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:37,600 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:40:37,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:37,600 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:40:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:40:37,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:40:37,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:40:37,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:40:37,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 17:40:37,728 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:40:37,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 17:40:37,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 17:40:37,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:40:37,729 INFO L87 Difference]: Start difference. First operand 191 states and 211 transitions. Second operand 8 states. [2018-01-24 17:40:38,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:40:38,363 INFO L93 Difference]: Finished difference Result 333 states and 360 transitions. [2018-01-24 17:40:38,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 17:40:38,363 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-24 17:40:38,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:40:38,365 INFO L225 Difference]: With dead ends: 333 [2018-01-24 17:40:38,365 INFO L226 Difference]: Without dead ends: 332 [2018-01-24 17:40:38,366 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-01-24 17:40:38,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-01-24 17:40:38,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 190. [2018-01-24 17:40:38,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-01-24 17:40:38,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 210 transitions. [2018-01-24 17:40:38,379 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 210 transitions. Word has length 20 [2018-01-24 17:40:38,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:40:38,380 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 210 transitions. [2018-01-24 17:40:38,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 17:40:38,380 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 210 transitions. [2018-01-24 17:40:38,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 17:40:38,381 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:40:38,381 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:40:38,381 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:40:38,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1355722780, now seen corresponding path program 1 times [2018-01-24 17:40:38,382 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:40:38,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:38,383 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:40:38,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:38,383 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:40:38,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:40:38,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:40:38,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:40:38,583 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:40:38,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 17:40:38,583 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:40:38,584 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 17:40:38,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 17:40:38,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:40:38,585 INFO L87 Difference]: Start difference. First operand 190 states and 210 transitions. Second operand 8 states. [2018-01-24 17:40:39,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:40:39,183 INFO L93 Difference]: Finished difference Result 335 states and 362 transitions. [2018-01-24 17:40:39,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 17:40:39,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-24 17:40:39,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:40:39,186 INFO L225 Difference]: With dead ends: 335 [2018-01-24 17:40:39,186 INFO L226 Difference]: Without dead ends: 334 [2018-01-24 17:40:39,187 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-01-24 17:40:39,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-01-24 17:40:39,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 189. [2018-01-24 17:40:39,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-01-24 17:40:39,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 209 transitions. [2018-01-24 17:40:39,198 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 209 transitions. Word has length 20 [2018-01-24 17:40:39,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:40:39,198 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 209 transitions. [2018-01-24 17:40:39,198 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 17:40:39,198 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 209 transitions. [2018-01-24 17:40:39,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 17:40:39,199 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:40:39,200 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:40:39,200 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:40:39,200 INFO L82 PathProgramCache]: Analyzing trace with hash -778525244, now seen corresponding path program 1 times [2018-01-24 17:40:39,200 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:40:39,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:39,201 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:40:39,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:39,201 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:40:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:40:39,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:40:39,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:40:39,268 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:40:39,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:40:39,268 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:40:39,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:40:39,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:40:39,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:40:39,269 INFO L87 Difference]: Start difference. First operand 189 states and 209 transitions. Second operand 5 states. [2018-01-24 17:40:39,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:40:39,413 INFO L93 Difference]: Finished difference Result 443 states and 488 transitions. [2018-01-24 17:40:39,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:40:39,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-24 17:40:39,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:40:39,415 INFO L225 Difference]: With dead ends: 443 [2018-01-24 17:40:39,415 INFO L226 Difference]: Without dead ends: 282 [2018-01-24 17:40:39,417 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:40:39,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-01-24 17:40:39,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 193. [2018-01-24 17:40:39,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-01-24 17:40:39,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 213 transitions. [2018-01-24 17:40:39,429 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 213 transitions. Word has length 26 [2018-01-24 17:40:39,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:40:39,429 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 213 transitions. [2018-01-24 17:40:39,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:40:39,429 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 213 transitions. [2018-01-24 17:40:39,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 17:40:39,430 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:40:39,431 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:40:39,431 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:40:39,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1814157193, now seen corresponding path program 1 times [2018-01-24 17:40:39,431 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:40:39,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:39,432 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:40:39,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:39,433 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:40:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:40:39,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:40:39,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:40:39,521 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:40:39,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:40:39,521 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:40:39,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:40:39,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:40:39,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:40:39,523 INFO L87 Difference]: Start difference. First operand 193 states and 213 transitions. Second operand 5 states. [2018-01-24 17:40:39,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:40:39,705 INFO L93 Difference]: Finished difference Result 215 states and 230 transitions. [2018-01-24 17:40:39,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 17:40:39,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-24 17:40:39,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:40:39,707 INFO L225 Difference]: With dead ends: 215 [2018-01-24 17:40:39,707 INFO L226 Difference]: Without dead ends: 203 [2018-01-24 17:40:39,707 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:40:39,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-01-24 17:40:39,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 185. [2018-01-24 17:40:39,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-24 17:40:39,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 205 transitions. [2018-01-24 17:40:39,717 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 205 transitions. Word has length 28 [2018-01-24 17:40:39,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:40:39,717 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 205 transitions. [2018-01-24 17:40:39,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:40:39,718 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 205 transitions. [2018-01-24 17:40:39,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 17:40:39,718 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:40:39,719 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:40:39,719 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:40:39,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1814157194, now seen corresponding path program 1 times [2018-01-24 17:40:39,719 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:40:39,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:39,720 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:40:39,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:39,720 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:40:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:40:39,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:40:39,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:40:39,811 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:40:39,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:40:39,811 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:40:39,811 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 17:40:39,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 17:40:39,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:40:39,812 INFO L87 Difference]: Start difference. First operand 185 states and 205 transitions. Second operand 7 states. [2018-01-24 17:40:40,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:40:40,058 INFO L93 Difference]: Finished difference Result 246 states and 263 transitions. [2018-01-24 17:40:40,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:40:40,058 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-01-24 17:40:40,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:40:40,059 INFO L225 Difference]: With dead ends: 246 [2018-01-24 17:40:40,059 INFO L226 Difference]: Without dead ends: 242 [2018-01-24 17:40:40,060 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-24 17:40:40,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-01-24 17:40:40,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 215. [2018-01-24 17:40:40,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-01-24 17:40:40,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 246 transitions. [2018-01-24 17:40:40,069 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 246 transitions. Word has length 28 [2018-01-24 17:40:40,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:40:40,069 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 246 transitions. [2018-01-24 17:40:40,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 17:40:40,070 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 246 transitions. [2018-01-24 17:40:40,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 17:40:40,071 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:40:40,071 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:40:40,071 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:40:40,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1983523681, now seen corresponding path program 1 times [2018-01-24 17:40:40,071 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:40:40,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:40,072 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:40:40,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:40,072 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:40:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:40:40,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:40:40,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:40:40,137 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:40:40,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:40:40,137 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:40:40,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:40:40,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:40:40,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:40:40,138 INFO L87 Difference]: Start difference. First operand 215 states and 246 transitions. Second operand 6 states. [2018-01-24 17:40:40,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:40:40,338 INFO L93 Difference]: Finished difference Result 312 states and 360 transitions. [2018-01-24 17:40:40,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 17:40:40,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-24 17:40:40,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:40:40,339 INFO L225 Difference]: With dead ends: 312 [2018-01-24 17:40:40,339 INFO L226 Difference]: Without dead ends: 311 [2018-01-24 17:40:40,340 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-24 17:40:40,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-01-24 17:40:40,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 214. [2018-01-24 17:40:40,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-01-24 17:40:40,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 245 transitions. [2018-01-24 17:40:40,348 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 245 transitions. Word has length 31 [2018-01-24 17:40:40,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:40:40,348 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 245 transitions. [2018-01-24 17:40:40,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:40:40,349 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 245 transitions. [2018-01-24 17:40:40,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 17:40:40,350 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:40:40,350 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:40:40,350 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:40:40,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1983523682, now seen corresponding path program 1 times [2018-01-24 17:40:40,351 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:40:40,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:40,351 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:40:40,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:40,352 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:40:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:40:40,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:40:40,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:40:40,428 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:40:40,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:40:40,428 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:40:40,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:40:40,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:40:40,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:40:40,429 INFO L87 Difference]: Start difference. First operand 214 states and 245 transitions. Second operand 6 states. [2018-01-24 17:40:40,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:40:40,830 INFO L93 Difference]: Finished difference Result 342 states and 398 transitions. [2018-01-24 17:40:40,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:40:40,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-24 17:40:40,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:40:40,833 INFO L225 Difference]: With dead ends: 342 [2018-01-24 17:40:40,833 INFO L226 Difference]: Without dead ends: 333 [2018-01-24 17:40:40,833 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-01-24 17:40:40,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-01-24 17:40:40,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 199. [2018-01-24 17:40:40,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-01-24 17:40:40,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 229 transitions. [2018-01-24 17:40:40,853 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 229 transitions. Word has length 31 [2018-01-24 17:40:40,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:40:40,854 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 229 transitions. [2018-01-24 17:40:40,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:40:40,854 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 229 transitions. [2018-01-24 17:40:40,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 17:40:40,855 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:40:40,855 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:40:40,855 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:40:40,856 INFO L82 PathProgramCache]: Analyzing trace with hash -706076137, now seen corresponding path program 1 times [2018-01-24 17:40:40,856 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:40:40,856 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:40,857 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:40:40,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:40,857 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:40:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:40:40,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:40:40,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:40:40,919 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:40:40,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:40:40,919 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:40:40,920 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:40:40,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:40:40,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:40:40,920 INFO L87 Difference]: Start difference. First operand 199 states and 229 transitions. Second operand 5 states. [2018-01-24 17:40:41,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:40:41,058 INFO L93 Difference]: Finished difference Result 279 states and 306 transitions. [2018-01-24 17:40:41,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:40:41,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-01-24 17:40:41,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:40:41,060 INFO L225 Difference]: With dead ends: 279 [2018-01-24 17:40:41,060 INFO L226 Difference]: Without dead ends: 222 [2018-01-24 17:40:41,061 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:40:41,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-01-24 17:40:41,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 199. [2018-01-24 17:40:41,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-01-24 17:40:41,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 227 transitions. [2018-01-24 17:40:41,075 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 227 transitions. Word has length 36 [2018-01-24 17:40:41,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:40:41,075 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 227 transitions. [2018-01-24 17:40:41,076 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:40:41,076 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 227 transitions. [2018-01-24 17:40:41,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 17:40:41,077 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:40:41,077 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:40:41,077 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:40:41,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1650873960, now seen corresponding path program 1 times [2018-01-24 17:40:41,078 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:40:41,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:41,078 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:40:41,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:41,079 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:40:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:40:41,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:40:41,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:40:41,330 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:40:41,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 17:40:41,330 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:40:41,331 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 17:40:41,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 17:40:41,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-24 17:40:41,331 INFO L87 Difference]: Start difference. First operand 199 states and 227 transitions. Second operand 10 states. [2018-01-24 17:40:41,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:40:41,935 INFO L93 Difference]: Finished difference Result 441 states and 497 transitions. [2018-01-24 17:40:41,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 17:40:41,936 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-01-24 17:40:41,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:40:41,938 INFO L225 Difference]: With dead ends: 441 [2018-01-24 17:40:41,938 INFO L226 Difference]: Without dead ends: 322 [2018-01-24 17:40:41,939 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2018-01-24 17:40:41,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-01-24 17:40:41,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 240. [2018-01-24 17:40:41,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-01-24 17:40:41,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 272 transitions. [2018-01-24 17:40:41,960 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 272 transitions. Word has length 42 [2018-01-24 17:40:41,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:40:41,960 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 272 transitions. [2018-01-24 17:40:41,960 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 17:40:41,960 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 272 transitions. [2018-01-24 17:40:41,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 17:40:41,961 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:40:41,962 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:40:41,962 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:40:41,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1611877026, now seen corresponding path program 1 times [2018-01-24 17:40:41,962 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:40:41,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:41,963 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:40:41,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:41,963 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:40:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:40:41,977 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:40:42,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:40:42,056 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:40:42,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:40:42,057 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:40:42,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:40:42,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:40:42,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:40:42,058 INFO L87 Difference]: Start difference. First operand 240 states and 272 transitions. Second operand 5 states. [2018-01-24 17:40:42,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:40:42,436 INFO L93 Difference]: Finished difference Result 360 states and 411 transitions. [2018-01-24 17:40:42,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:40:42,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-01-24 17:40:42,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:40:42,438 INFO L225 Difference]: With dead ends: 360 [2018-01-24 17:40:42,438 INFO L226 Difference]: Without dead ends: 359 [2018-01-24 17:40:42,439 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:40:42,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-01-24 17:40:42,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 239. [2018-01-24 17:40:42,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-01-24 17:40:42,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 271 transitions. [2018-01-24 17:40:42,458 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 271 transitions. Word has length 43 [2018-01-24 17:40:42,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:40:42,459 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 271 transitions. [2018-01-24 17:40:42,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:40:42,460 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 271 transitions. [2018-01-24 17:40:42,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 17:40:42,461 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:40:42,461 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:40:42,461 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:40:42,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1611877025, now seen corresponding path program 1 times [2018-01-24 17:40:42,462 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:40:42,462 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:42,463 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:40:42,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:42,463 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:40:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:40:42,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:40:42,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:40:42,569 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:40:42,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:40:42,569 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:40:42,570 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:40:42,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:40:42,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:40:42,570 INFO L87 Difference]: Start difference. First operand 239 states and 271 transitions. Second operand 5 states. [2018-01-24 17:40:42,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:40:42,996 INFO L93 Difference]: Finished difference Result 392 states and 450 transitions. [2018-01-24 17:40:42,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:40:42,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-01-24 17:40:42,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:40:42,998 INFO L225 Difference]: With dead ends: 392 [2018-01-24 17:40:42,998 INFO L226 Difference]: Without dead ends: 391 [2018-01-24 17:40:42,999 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:40:42,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-01-24 17:40:43,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 238. [2018-01-24 17:40:43,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-01-24 17:40:43,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 270 transitions. [2018-01-24 17:40:43,018 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 270 transitions. Word has length 43 [2018-01-24 17:40:43,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:40:43,018 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 270 transitions. [2018-01-24 17:40:43,018 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:40:43,019 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 270 transitions. [2018-01-24 17:40:43,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 17:40:43,019 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:40:43,020 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:40:43,020 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:40:43,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1934711090, now seen corresponding path program 1 times [2018-01-24 17:40:43,020 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:40:43,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:43,021 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:40:43,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:43,021 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:40:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:40:43,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:40:43,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:40:43,180 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:40:43,180 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:40:43,181 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-01-24 17:40:43,183 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [13], [18], [22], [28], [31], [32], [58], [59], [62], [67], [68], [71], [77], [81], [87], [91], [93], [96], [207], [211], [216], [220], [228], [234], [235], [236], [238], [242], [246], [331], [336], [340], [346], [349], [448], [449], [450] [2018-01-24 17:40:43,247 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:40:43,248 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:40:43,642 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:40:43,643 INFO L268 AbstractInterpreter]: Visited 42 different actions 66 times. Merged at 12 different actions 23 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-01-24 17:40:43,667 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:40:43,667 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:40:43,667 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-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-01-24 17:40:43,678 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:40:43,678 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:40:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:40:43,728 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:40:43,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 17:40:43,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 17:40:43,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:40:43,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:40:43,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 17:40:43,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 17:40:43,863 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:40:43,870 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:40:43,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:40:43,895 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-01-24 17:40:43,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-24 17:40:43,930 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:40:43,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 17:40:43,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:40:43,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:40:43,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-24 17:40:43,961 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:40:43,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 17:40:43,962 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:40:43,976 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:40:43,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:40:43,993 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-01-24 17:40:44,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-01-24 17:40:44,083 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:40:44,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-01-24 17:40:44,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:40:44,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:40:44,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-01-24 17:40:44,105 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:40:44,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-01-24 17:40:44,106 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:40:44,123 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:40:44,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:40:44,138 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:7 [2018-01-24 17:40:44,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:40:44,170 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:40:44,198 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 17:40:44,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:40:44,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:40:44,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:1 [2018-01-24 17:40:44,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:40:44,244 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:40:44,244 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:40:44,256 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:40:44,256 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:40:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:40:44,315 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:40:44,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 17:40:44,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 17:40:44,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:40:44,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:40:44,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 17:40:44,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 17:40:44,391 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:40:44,393 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:40:44,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:40:44,399 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-01-24 17:40:44,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-24 17:40:44,430 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:40:44,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 17:40:44,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:40:44,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:40:44,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-24 17:40:44,459 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:40:44,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 17:40:44,460 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:40:44,464 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:40:44,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:40:44,472 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-01-24 17:40:44,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-01-24 17:40:44,523 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:40:44,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-01-24 17:40:44,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:40:44,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:40:44,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-01-24 17:40:44,611 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:40:44,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-01-24 17:40:44,612 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:40:44,628 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:40:44,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:40:44,683 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:7 [2018-01-24 17:40:44,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:40:44,702 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:40:44,805 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 17:40:44,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:40:44,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:40:44,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:1 [2018-01-24 17:40:44,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:40:44,824 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:40:44,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6, 9, 7] total 14 [2018-01-24 17:40:44,824 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:40:44,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 17:40:44,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 17:40:44,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-01-24 17:40:44,825 INFO L87 Difference]: Start difference. First operand 238 states and 270 transitions. Second operand 11 states. [2018-01-24 17:40:45,172 WARN L143 SmtUtils]: Spent 122ms on a formula simplification that was a NOOP. DAG size: 37 [2018-01-24 17:40:45,753 WARN L143 SmtUtils]: Spent 157ms on a formula simplification that was a NOOP. DAG size: 41 [2018-01-24 17:40:46,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:40:46,895 INFO L93 Difference]: Finished difference Result 479 states and 527 transitions. [2018-01-24 17:40:46,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 17:40:46,917 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2018-01-24 17:40:46,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:40:46,935 INFO L225 Difference]: With dead ends: 479 [2018-01-24 17:40:46,935 INFO L226 Difference]: Without dead ends: 383 [2018-01-24 17:40:46,936 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 160 SyntacticMatches, 10 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2018-01-24 17:40:46,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-01-24 17:40:46,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 285. [2018-01-24 17:40:46,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-01-24 17:40:46,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 329 transitions. [2018-01-24 17:40:46,957 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 329 transitions. Word has length 44 [2018-01-24 17:40:46,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:40:46,958 INFO L432 AbstractCegarLoop]: Abstraction has 285 states and 329 transitions. [2018-01-24 17:40:46,958 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 17:40:46,958 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 329 transitions. [2018-01-24 17:40:46,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-24 17:40:46,958 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:40:46,959 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:40:46,959 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:40:46,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1693979189, now seen corresponding path program 1 times [2018-01-24 17:40:46,959 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:40:46,960 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:46,960 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:40:46,960 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:46,960 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:40:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:40:46,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:40:47,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:40:47,204 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:40:47,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 17:40:47,204 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:40:47,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 17:40:47,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 17:40:47,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:40:47,205 INFO L87 Difference]: Start difference. First operand 285 states and 329 transitions. Second operand 8 states. [2018-01-24 17:40:47,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:40:47,810 INFO L93 Difference]: Finished difference Result 303 states and 349 transitions. [2018-01-24 17:40:47,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:40:47,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-01-24 17:40:47,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:40:47,811 INFO L225 Difference]: With dead ends: 303 [2018-01-24 17:40:47,811 INFO L226 Difference]: Without dead ends: 302 [2018-01-24 17:40:47,812 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-01-24 17:40:47,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-01-24 17:40:47,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 284. [2018-01-24 17:40:47,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-01-24 17:40:47,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 328 transitions. [2018-01-24 17:40:47,825 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 328 transitions. Word has length 46 [2018-01-24 17:40:47,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:40:47,825 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 328 transitions. [2018-01-24 17:40:47,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 17:40:47,825 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 328 transitions. [2018-01-24 17:40:47,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-24 17:40:47,826 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:40:47,826 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:40:47,826 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:40:47,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1693979188, now seen corresponding path program 1 times [2018-01-24 17:40:47,826 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:40:47,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:47,827 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:40:47,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:47,827 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:40:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:40:47,839 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:40:48,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:40:48,067 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:40:48,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 17:40:48,067 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:40:48,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 17:40:48,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 17:40:48,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:40:48,068 INFO L87 Difference]: Start difference. First operand 284 states and 328 transitions. Second operand 8 states. [2018-01-24 17:40:48,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:40:48,612 INFO L93 Difference]: Finished difference Result 302 states and 348 transitions. [2018-01-24 17:40:48,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:40:48,612 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-01-24 17:40:48,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:40:48,613 INFO L225 Difference]: With dead ends: 302 [2018-01-24 17:40:48,613 INFO L226 Difference]: Without dead ends: 301 [2018-01-24 17:40:48,614 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-01-24 17:40:48,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-01-24 17:40:48,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 283. [2018-01-24 17:40:48,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-01-24 17:40:48,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 327 transitions. [2018-01-24 17:40:48,635 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 327 transitions. Word has length 46 [2018-01-24 17:40:48,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:40:48,636 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 327 transitions. [2018-01-24 17:40:48,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 17:40:48,636 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 327 transitions. [2018-01-24 17:40:48,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 17:40:48,637 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:40:48,637 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:40:48,637 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:40:48,637 INFO L82 PathProgramCache]: Analyzing trace with hash -944056626, now seen corresponding path program 1 times [2018-01-24 17:40:48,637 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:40:48,638 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:48,638 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:40:48,638 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:48,639 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:40:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:40:48,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:40:48,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:40:48,883 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:40:48,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 17:40:48,884 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:40:48,884 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 17:40:48,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 17:40:48,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-24 17:40:48,885 INFO L87 Difference]: Start difference. First operand 283 states and 327 transitions. Second operand 11 states. [2018-01-24 17:40:49,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:40:49,539 INFO L93 Difference]: Finished difference Result 546 states and 612 transitions. [2018-01-24 17:40:49,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 17:40:49,539 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-01-24 17:40:49,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:40:49,542 INFO L225 Difference]: With dead ends: 546 [2018-01-24 17:40:49,542 INFO L226 Difference]: Without dead ends: 543 [2018-01-24 17:40:49,543 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2018-01-24 17:40:49,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-01-24 17:40:49,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 289. [2018-01-24 17:40:49,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-01-24 17:40:49,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 332 transitions. [2018-01-24 17:40:49,568 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 332 transitions. Word has length 47 [2018-01-24 17:40:49,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:40:49,569 INFO L432 AbstractCegarLoop]: Abstraction has 289 states and 332 transitions. [2018-01-24 17:40:49,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 17:40:49,569 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 332 transitions. [2018-01-24 17:40:49,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 17:40:49,570 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:40:49,570 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:40:49,570 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:40:49,570 INFO L82 PathProgramCache]: Analyzing trace with hash -944056625, now seen corresponding path program 1 times [2018-01-24 17:40:49,570 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:40:49,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:49,571 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:40:49,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:49,571 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:40:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:40:49,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:40:49,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:40:49,870 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:40:49,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 17:40:49,870 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:40:49,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 17:40:49,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 17:40:49,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-01-24 17:40:49,871 INFO L87 Difference]: Start difference. First operand 289 states and 332 transitions. Second operand 13 states. [2018-01-24 17:40:50,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:40:50,592 INFO L93 Difference]: Finished difference Result 603 states and 659 transitions. [2018-01-24 17:40:50,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 17:40:50,592 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-01-24 17:40:50,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:40:50,595 INFO L225 Difference]: With dead ends: 603 [2018-01-24 17:40:50,595 INFO L226 Difference]: Without dead ends: 600 [2018-01-24 17:40:50,596 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=205, Invalid=551, Unknown=0, NotChecked=0, Total=756 [2018-01-24 17:40:50,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-01-24 17:40:50,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 296. [2018-01-24 17:40:50,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-01-24 17:40:50,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 338 transitions. [2018-01-24 17:40:50,620 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 338 transitions. Word has length 47 [2018-01-24 17:40:50,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:40:50,620 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 338 transitions. [2018-01-24 17:40:50,620 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 17:40:50,621 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 338 transitions. [2018-01-24 17:40:50,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-24 17:40:50,621 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:40:50,622 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:40:50,622 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:40:50,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1546550031, now seen corresponding path program 1 times [2018-01-24 17:40:50,622 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:40:50,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:50,623 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:40:50,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:50,623 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:40:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:40:50,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:40:50,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 17:40:50,802 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:40:50,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 17:40:50,803 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:40:50,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 17:40:50,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 17:40:50,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:40:50,803 INFO L87 Difference]: Start difference. First operand 296 states and 338 transitions. Second operand 7 states. [2018-01-24 17:40:50,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:40:50,975 INFO L93 Difference]: Finished difference Result 363 states and 413 transitions. [2018-01-24 17:40:50,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 17:40:50,975 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-01-24 17:40:50,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:40:50,977 INFO L225 Difference]: With dead ends: 363 [2018-01-24 17:40:50,977 INFO L226 Difference]: Without dead ends: 312 [2018-01-24 17:40:50,977 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-01-24 17:40:50,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-01-24 17:40:50,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 308. [2018-01-24 17:40:50,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-01-24 17:40:51,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 350 transitions. [2018-01-24 17:40:51,000 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 350 transitions. Word has length 53 [2018-01-24 17:40:51,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:40:51,000 INFO L432 AbstractCegarLoop]: Abstraction has 308 states and 350 transitions. [2018-01-24 17:40:51,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 17:40:51,001 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 350 transitions. [2018-01-24 17:40:51,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-24 17:40:51,002 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:40:51,002 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:40:51,002 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:40:51,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1009176340, now seen corresponding path program 1 times [2018-01-24 17:40:51,002 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:40:51,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:51,003 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:40:51,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:51,004 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:40:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:40:51,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:40:51,133 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:40:51,134 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:40:51,134 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:40:51,134 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-01-24 17:40:51,134 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [13], [18], [22], [28], [31], [32], [58], [59], [62], [67], [68], [71], [77], [81], [87], [91], [93], [96], [207], [211], [216], [220], [228], [232], [234], [235], [238], [242], [246], [331], [336], [340], [346], [349], [355], [361], [362], [363], [365], [432], [434], [437], [438], [441], [448], [449], [450] [2018-01-24 17:40:51,137 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:40:51,137 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:40:51,499 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:40:51,499 INFO L268 AbstractInterpreter]: Visited 52 different actions 99 times. Merged at 22 different actions 43 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 36 variables. [2018-01-24 17:40:51,502 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:40:51,502 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:40:51,502 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:40:51,509 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:40:51,509 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:40:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:40:51,532 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:40:51,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 17:40:51,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 17:40:51,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:40:51,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:40:51,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:40:51,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-01-24 17:40:51,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-24 17:40:51,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 17:40:51,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 17:40:51,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:40:51,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-01-24 17:40:51,753 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:40:51,755 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:40:51,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2018-01-24 17:40:51,760 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-24 17:40:51,768 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:40:51,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:40:51,778 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-01-24 17:40:51,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:40:51,839 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:40:51,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-01-24 17:40:51,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-01-24 17:40:51,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:40:51,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:40:51,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2018-01-24 17:40:51,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-01-24 17:40:51,959 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:40:51,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-01-24 17:40:51,975 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 17:40:51,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-01-24 17:40:51,991 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 17:40:52,002 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:40:52,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:40:52,013 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:63, output treesize:39 [2018-01-24 17:40:52,050 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:40:52,070 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:40:52,070 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:40:52,073 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:40:52,073 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:40:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:40:52,116 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:40:52,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 17:40:52,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 17:40:52,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:40:52,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:40:52,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 17:40:52,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 17:40:52,207 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:40:52,209 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:40:52,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:40:52,214 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-01-24 17:40:52,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-24 17:40:52,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-01-24 17:40:52,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:40:52,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:40:52,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-24 17:40:52,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-01-24 17:40:52,361 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:40:52,361 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:40:52,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:40:52,364 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2018-01-24 17:40:52,381 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:40:52,381 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:40:52,473 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:40:52,475 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:40:52,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 10, 12, 9] total 33 [2018-01-24 17:40:52,475 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:40:52,475 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 17:40:52,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 17:40:52,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=910, Unknown=4, NotChecked=0, Total=1056 [2018-01-24 17:40:52,476 INFO L87 Difference]: Start difference. First operand 308 states and 350 transitions. Second operand 17 states. [2018-01-24 17:40:53,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:40:53,670 INFO L93 Difference]: Finished difference Result 636 states and 683 transitions. [2018-01-24 17:40:53,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-24 17:40:53,671 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2018-01-24 17:40:53,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:40:53,672 INFO L225 Difference]: With dead ends: 636 [2018-01-24 17:40:53,672 INFO L226 Difference]: Without dead ends: 601 [2018-01-24 17:40:53,673 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 189 SyntacticMatches, 11 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=430, Invalid=2317, Unknown=9, NotChecked=0, Total=2756 [2018-01-24 17:40:53,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-01-24 17:40:53,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 336. [2018-01-24 17:40:53,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-01-24 17:40:53,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 385 transitions. [2018-01-24 17:40:53,691 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 385 transitions. Word has length 55 [2018-01-24 17:40:53,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:40:53,691 INFO L432 AbstractCegarLoop]: Abstraction has 336 states and 385 transitions. [2018-01-24 17:40:53,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 17:40:53,691 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 385 transitions. [2018-01-24 17:40:53,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-24 17:40:53,692 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:40:53,692 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:40:53,692 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:40:53,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1219696535, now seen corresponding path program 1 times [2018-01-24 17:40:53,692 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:40:53,693 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:53,693 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:40:53,693 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:53,693 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:40:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:40:53,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:40:53,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 17:40:53,847 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:40:53,847 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:40:53,847 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-01-24 17:40:53,847 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [13], [18], [22], [28], [31], [32], [58], [59], [62], [67], [68], [71], [77], [81], [87], [91], [93], [96], [207], [211], [216], [220], [228], [232], [234], [235], [238], [242], [246], [331], [336], [340], [346], [349], [355], [359], [361], [362], [365], [432], [434], [437], [438], [441], [445], [447], [448], [449], [450] [2018-01-24 17:40:53,849 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:40:53,850 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:40:54,107 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:40:54,107 INFO L268 AbstractInterpreter]: Visited 54 different actions 104 times. Merged at 24 different actions 45 times. Never widened. Found 5 fixpoints after 4 different actions. Largest state had 37 variables. [2018-01-24 17:40:54,116 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:40:54,116 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:40:54,116 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-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-01-24 17:40:54,130 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:40:54,130 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:40:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:40:54,157 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:40:54,318 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~list~5.base Int)) (and (= 0 (select |c_old(#valid)| main_~list~5.base)) (= |c_#valid| (store |c_old(#valid)| main_~list~5.base 0)) (not (= 0 main_~list~5.base)))) is different from true [2018-01-24 17:40:54,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2018-01-24 17:40:54,333 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:40:54,398 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc0.base_3| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_3|))) (= 0 |v_main_#t~malloc0.base_3|) (= (store |c_#valid| |v_main_#t~malloc0.base_3| 0) |c_old(#valid)|))) is different from false [2018-01-24 17:40:54,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 17:40:54,428 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:40:54,428 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:40:54,431 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:40:54,431 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:40:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:40:54,474 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:40:54,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 17:40:54,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:40:54,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:40:54,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:40:54,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 17:40:54,566 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:40:54,583 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc0.base_4| Int)) (or (= (store |c_#valid| |v_main_#t~malloc0.base_4| 0) |c_old(#valid)|) (= 0 |v_main_#t~malloc0.base_4|) (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_4|))))) is different from false [2018-01-24 17:40:54,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 17:40:54,596 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:40:54,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7, 6, 5] total 20 [2018-01-24 17:40:54,596 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:40:54,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 17:40:54,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 17:40:54,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=243, Unknown=6, NotChecked=102, Total=420 [2018-01-24 17:40:54,597 INFO L87 Difference]: Start difference. First operand 336 states and 385 transitions. Second operand 10 states. [2018-01-24 17:40:54,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:40:54,857 INFO L93 Difference]: Finished difference Result 376 states and 425 transitions. [2018-01-24 17:40:54,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:40:54,857 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-01-24 17:40:54,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:40:54,858 INFO L225 Difference]: With dead ends: 376 [2018-01-24 17:40:54,858 INFO L226 Difference]: Without dead ends: 345 [2018-01-24 17:40:54,859 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 206 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=397, Unknown=6, NotChecked=132, Total=650 [2018-01-24 17:40:54,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-01-24 17:40:54,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 344. [2018-01-24 17:40:54,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-01-24 17:40:54,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 393 transitions. [2018-01-24 17:40:54,875 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 393 transitions. Word has length 56 [2018-01-24 17:40:54,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:40:54,875 INFO L432 AbstractCegarLoop]: Abstraction has 344 states and 393 transitions. [2018-01-24 17:40:54,875 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 17:40:54,876 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 393 transitions. [2018-01-24 17:40:54,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-24 17:40:54,876 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:40:54,876 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:40:54,876 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 17:40:54,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1674520475, now seen corresponding path program 1 times [2018-01-24 17:40:54,877 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:40:54,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:54,877 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:40:54,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:40:54,877 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:40:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 17:40:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 17:40:54,927 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-24 17:40:54,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 05:40:54 BoogieIcfgContainer [2018-01-24 17:40:54,978 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 17:40:54,979 INFO L168 Benchmark]: Toolchain (without parser) took 20221.21 ms. Allocated memory was 304.6 MB in the beginning and 676.3 MB in the end (delta: 371.7 MB). Free memory was 264.7 MB in the beginning and 380.1 MB in the end (delta: -115.4 MB). Peak memory consumption was 256.3 MB. Max. memory is 5.3 GB. [2018-01-24 17:40:54,979 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 304.6 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:40:54,980 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.75 ms. Allocated memory is still 304.6 MB. Free memory was 263.7 MB in the beginning and 251.5 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. [2018-01-24 17:40:54,980 INFO L168 Benchmark]: Boogie Preprocessor took 48.24 ms. Allocated memory is still 304.6 MB. Free memory was 251.5 MB in the beginning and 249.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:40:54,980 INFO L168 Benchmark]: RCFGBuilder took 647.21 ms. Allocated memory is still 304.6 MB. Free memory was 248.5 MB in the beginning and 205.5 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:40:54,981 INFO L168 Benchmark]: TraceAbstraction took 19285.47 ms. Allocated memory was 304.6 MB in the beginning and 676.3 MB in the end (delta: 371.7 MB). Free memory was 205.5 MB in the beginning and 380.1 MB in the end (delta: -174.6 MB). Peak memory consumption was 197.1 MB. Max. memory is 5.3 GB. [2018-01-24 17:40:54,982 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 304.6 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 232.75 ms. Allocated memory is still 304.6 MB. Free memory was 263.7 MB in the beginning and 251.5 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 48.24 ms. Allocated memory is still 304.6 MB. Free memory was 251.5 MB in the beginning and 249.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 647.21 ms. Allocated memory is still 304.6 MB. Free memory was 248.5 MB in the beginning and 205.5 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 19285.47 ms. Allocated memory was 304.6 MB in the beginning and 676.3 MB in the end (delta: 371.7 MB). Free memory was 205.5 MB in the beginning and 380.1 MB in the end (delta: -174.6 MB). Peak memory consumption was 197.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 41 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 525 LocStat_NO_SUPPORTING_DISEQUALITIES : 146 LocStat_NO_DISJUNCTIONS : -82 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 46 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 66 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 53 TransStat_MAX_NO_DISJUNCTIONS : 3 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.091144 RENAME_VARIABLES(MILLISECONDS) : 0.709496 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.003160 PROJECTAWAY(MILLISECONDS) : 0.729221 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001516 DISJOIN(MILLISECONDS) : 0.715634 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.755450 ADD_EQUALITY(MILLISECONDS) : 0.016329 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.043208 #CONJOIN_DISJUNCTIVE : 115 #RENAME_VARIABLES : 198 #UNFREEZE : 0 #CONJOIN : 171 #PROJECTAWAY : 147 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 13 #RENAME_VARIABLES_DISJUNCTIVE : 187 #ADD_EQUALITY : 67 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 13 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 50 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 637 LocStat_NO_SUPPORTING_DISEQUALITIES : 163 LocStat_NO_DISJUNCTIONS : -100 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 56 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 96 TransStat_NO_SUPPORTING_DISEQUALITIES : 20 TransStat_NO_DISJUNCTIONS : 67 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.705590 RENAME_VARIABLES(MILLISECONDS) : 0.693215 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.670370 PROJECTAWAY(MILLISECONDS) : 1.153947 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001774 DISJOIN(MILLISECONDS) : 0.615424 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.723337 ADD_EQUALITY(MILLISECONDS) : 0.014340 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010608 #CONJOIN_DISJUNCTIVE : 159 #RENAME_VARIABLES : 294 #UNFREEZE : 0 #CONJOIN : 268 #PROJECTAWAY : 197 #ADD_WEAK_EQUALITY : 12 #DISJOIN : 19 #RENAME_VARIABLES_DISJUNCTIVE : 259 #ADD_EQUALITY : 89 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 16 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 52 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 668 LocStat_NO_SUPPORTING_DISEQUALITIES : 167 LocStat_NO_DISJUNCTIONS : -104 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 58 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 99 TransStat_NO_SUPPORTING_DISEQUALITIES : 20 TransStat_NO_DISJUNCTIONS : 69 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.357133 RENAME_VARIABLES(MILLISECONDS) : 0.245599 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.338470 PROJECTAWAY(MILLISECONDS) : 0.892489 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.002403 DISJOIN(MILLISECONDS) : 0.367514 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.267089 ADD_EQUALITY(MILLISECONDS) : 0.098908 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.019221 #CONJOIN_DISJUNCTIVE : 167 #RENAME_VARIABLES : 308 #UNFREEZE : 0 #CONJOIN : 276 #PROJECTAWAY : 203 #ADD_WEAK_EQUALITY : 12 #DISJOIN : 18 #RENAME_VARIABLES_DISJUNCTIVE : 273 #ADD_EQUALITY : 92 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 16 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L991] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={11:0}] [L991] SLL* list = malloc(sizeof(SLL)); VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L992] FCALL list->next = ((void*)0) VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(0) VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] EXPR, FCALL malloc(sizeof(SLL)) VAL [list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] FCALL list->inner = malloc(sizeof(SLL)) VAL [list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR, FCALL list->inner VAL [list={11:0}, list->inner={9:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] FCALL list->inner->next = ((void*)0) VAL [list={11:0}, list->inner={9:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR, FCALL list->inner VAL [list={11:0}, list->inner={9:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] FCALL list->inner->inner = ((void*)0) VAL [list={11:0}, list->inner={9:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR, FCALL list->inner VAL [list={11:0}, list->inner={9:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={11:0}, list->inner={9:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L993] COND FALSE !(0) VAL [list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L995] SLL* end = list; VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1012] COND FALSE !(0) VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; VAL [end={11:0}, len=0, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1017] EXPR, FCALL end->inner VAL [end={11:0}, end->inner={9:0}, len=0, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner VAL [end={11:0}, inner={9:0}, len=0, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={11:0}, inner={9:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={11:0}, inner={9:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1024] COND FALSE !(0) VAL [end={11:0}, inner={9:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1025] EXPR, FCALL inner->inner VAL [end={11:0}, inner={9:0}, inner->inner={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1025] COND FALSE !(0) VAL [end={11:0}, inner={9:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1026] EXPR, FCALL inner->next VAL [end={11:0}, inner={9:0}, inner->next={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1026] COND FALSE !(0) VAL [end={11:0}, inner={9:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1027] EXPR, FCALL inner->inner VAL [end={11:0}, inner={9:0}, inner->inner={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1027] inner = inner->inner [L1028] COND TRUE len == 1 VAL [end={11:0}, inner={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1029] FCALL inner->inner VAL [end={11:0}, inner={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 188 locations, 65 error locations. UNSAFE Result, 19.2s OverallTime, 24 OverallIterations, 2 TraceHistogramMax, 11.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3785 SDtfs, 8694 SDslu, 12489 SDs, 0 SdLazy, 8492 SolverSat, 487 SolverUnsat, 51 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 906 GetRequests, 588 SyntacticMatches, 30 SemanticMatches, 288 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=344occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.1s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 2337 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1159 NumberOfCodeBlocks, 1159 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1377 ConstructedInterpolants, 21 QuantifiedInterpolants, 772389 SizeOfPredicates, 62 NumberOfNonLiveVariables, 1000 ConjunctsInSsa, 136 ConjunctsInUnsatCore, 35 InterpolantComputations, 20 PerfectInterpolantSequences, 22/62 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_17-40-54-992.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_17-40-54-992.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_17-40-54-992.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_17-40-54-992.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_17-40-54-992.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_17-40-54-992.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_17-40-54-992.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_17-40-54-992.csv Received shutdown request...