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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_dsw_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 18:51:29,593 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 18:51:29,595 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 18:51:29,608 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 18:51:29,608 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 18:51:29,609 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 18:51:29,609 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 18:51:29,611 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 18:51:29,612 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 18:51:29,613 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 18:51:29,614 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 18:51:29,614 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 18:51:29,615 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 18:51:29,616 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 18:51:29,617 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 18:51:29,619 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 18:51:29,620 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 18:51:29,622 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 18:51:29,623 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 18:51:29,624 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 18:51:29,626 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 18:51:29,626 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 18:51:29,627 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 18:51:29,628 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 18:51:29,628 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 18:51:29,629 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 18:51:29,630 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 18:51:29,630 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 18:51:29,630 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 18:51:29,631 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 18:51:29,631 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 18:51:29,631 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 18:51:29,641 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 18:51:29,642 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 18:51:29,643 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 18:51:29,643 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 18:51:29,643 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 18:51:29,643 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 18:51:29,643 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 18:51:29,644 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 18:51:29,644 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 18:51:29,644 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 18:51:29,644 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 18:51:29,644 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 18:51:29,644 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 18:51:29,645 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 18:51:29,645 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 18:51:29,645 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 18:51:29,645 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 18:51:29,645 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 18:51:29,645 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 18:51:29,645 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 18:51:29,646 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 18:51:29,646 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 18:51:29,646 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 18:51:29,646 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 18:51:29,646 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 18:51:29,676 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 18:51:29,686 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 18:51:29,689 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 18:51:29,691 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 18:51:29,691 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 18:51:29,692 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_dsw_true-valid-memsafety_false-termination.i [2018-02-02 18:51:29,819 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 18:51:29,820 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 18:51:29,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 18:51:29,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 18:51:29,827 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 18:51:29,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:51:29" (1/1) ... [2018-02-02 18:51:29,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24c37600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:51:29, skipping insertion in model container [2018-02-02 18:51:29,831 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:51:29" (1/1) ... [2018-02-02 18:51:29,845 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:51:29,881 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:51:29,977 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:51:29,995 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:51:30,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:51:30 WrapperNode [2018-02-02 18:51:30,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 18:51:30,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 18:51:30,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 18:51:30,002 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 18:51:30,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:51:30" (1/1) ... [2018-02-02 18:51:30,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:51:30" (1/1) ... [2018-02-02 18:51:30,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:51:30" (1/1) ... [2018-02-02 18:51:30,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:51:30" (1/1) ... [2018-02-02 18:51:30,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:51:30" (1/1) ... [2018-02-02 18:51:30,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:51:30" (1/1) ... [2018-02-02 18:51:30,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:51:30" (1/1) ... [2018-02-02 18:51:30,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 18:51:30,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 18:51:30,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 18:51:30,032 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 18:51:30,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:51:30" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-02 18:51:30,068 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 18:51:30,068 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 18:51:30,069 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 18:51:30,069 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 18:51:30,069 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 18:51:30,069 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 18:51:30,069 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 18:51:30,069 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 18:51:30,069 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 18:51:30,069 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 18:51:30,069 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 18:51:30,069 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 18:51:30,069 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 18:51:30,069 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 18:51:30,476 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 18:51:30,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:51:30 BoogieIcfgContainer [2018-02-02 18:51:30,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 18:51:30,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 18:51:30,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 18:51:30,481 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 18:51:30,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 06:51:29" (1/3) ... [2018-02-02 18:51:30,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b1f628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:51:30, skipping insertion in model container [2018-02-02 18:51:30,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:51:30" (2/3) ... [2018-02-02 18:51:30,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b1f628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:51:30, skipping insertion in model container [2018-02-02 18:51:30,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:51:30" (3/3) ... [2018-02-02 18:51:30,485 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_dsw_true-valid-memsafety_false-termination.i [2018-02-02 18:51:30,493 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 18:51:30,501 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 75 error locations. [2018-02-02 18:51:30,526 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 18:51:30,526 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 18:51:30,527 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 18:51:30,527 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 18:51:30,527 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 18:51:30,527 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 18:51:30,527 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 18:51:30,527 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 18:51:30,528 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 18:51:30,540 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states. [2018-02-02 18:51:30,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 18:51:30,548 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:51:30,549 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:51:30,549 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:51:30,554 INFO L82 PathProgramCache]: Analyzing trace with hash -985735074, now seen corresponding path program 1 times [2018-02-02 18:51:30,556 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:51:30,556 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:51:30,594 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:30,595 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:30,595 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:30,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:51:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:51:30,681 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:51:30,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:51:30,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:51:30,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:51:30,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:51:30,698 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 4 states. [2018-02-02 18:51:30,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:51:30,978 INFO L93 Difference]: Finished difference Result 186 states and 200 transitions. [2018-02-02 18:51:30,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:51:30,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 18:51:30,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:51:30,987 INFO L225 Difference]: With dead ends: 186 [2018-02-02 18:51:30,988 INFO L226 Difference]: Without dead ends: 183 [2018-02-02 18:51:30,989 INFO L554 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-02-02 18:51:31,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-02-02 18:51:31,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 168. [2018-02-02 18:51:31,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-02 18:51:31,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 181 transitions. [2018-02-02 18:51:31,022 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 181 transitions. Word has length 8 [2018-02-02 18:51:31,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:51:31,022 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 181 transitions. [2018-02-02 18:51:31,022 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:51:31,022 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 181 transitions. [2018-02-02 18:51:31,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 18:51:31,022 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:51:31,023 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:51:31,023 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:51:31,023 INFO L82 PathProgramCache]: Analyzing trace with hash -985735073, now seen corresponding path program 1 times [2018-02-02 18:51:31,023 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:51:31,023 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:51:31,024 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:31,024 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:31,024 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:31,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:51:31,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:51:31,094 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:51:31,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:51:31,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:51:31,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:51:31,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:51:31,096 INFO L87 Difference]: Start difference. First operand 168 states and 181 transitions. Second operand 4 states. [2018-02-02 18:51:31,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:51:31,229 INFO L93 Difference]: Finished difference Result 166 states and 179 transitions. [2018-02-02 18:51:31,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:51:31,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 18:51:31,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:51:31,231 INFO L225 Difference]: With dead ends: 166 [2018-02-02 18:51:31,231 INFO L226 Difference]: Without dead ends: 166 [2018-02-02 18:51:31,232 INFO L554 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-02-02 18:51:31,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-02 18:51:31,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-02-02 18:51:31,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-02 18:51:31,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 179 transitions. [2018-02-02 18:51:31,241 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 179 transitions. Word has length 8 [2018-02-02 18:51:31,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:51:31,241 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 179 transitions. [2018-02-02 18:51:31,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:51:31,241 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2018-02-02 18:51:31,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 18:51:31,242 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:51:31,242 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:51:31,242 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:51:31,242 INFO L82 PathProgramCache]: Analyzing trace with hash 473226571, now seen corresponding path program 1 times [2018-02-02 18:51:31,242 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:51:31,242 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:51:31,243 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:31,243 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:31,244 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:31,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:51:31,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:51:31,289 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:51:31,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:51:31,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:51:31,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:51:31,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:51:31,291 INFO L87 Difference]: Start difference. First operand 166 states and 179 transitions. Second operand 4 states. [2018-02-02 18:51:31,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:51:31,464 INFO L93 Difference]: Finished difference Result 180 states and 197 transitions. [2018-02-02 18:51:31,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:51:31,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 18:51:31,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:51:31,466 INFO L225 Difference]: With dead ends: 180 [2018-02-02 18:51:31,466 INFO L226 Difference]: Without dead ends: 180 [2018-02-02 18:51:31,467 INFO L554 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-02-02 18:51:31,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-02 18:51:31,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 153. [2018-02-02 18:51:31,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-02 18:51:31,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 169 transitions. [2018-02-02 18:51:31,476 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 169 transitions. Word has length 14 [2018-02-02 18:51:31,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:51:31,476 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 169 transitions. [2018-02-02 18:51:31,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:51:31,476 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 169 transitions. [2018-02-02 18:51:31,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 18:51:31,477 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:51:31,477 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:51:31,477 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:51:31,478 INFO L82 PathProgramCache]: Analyzing trace with hash 473226572, now seen corresponding path program 1 times [2018-02-02 18:51:31,478 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:51:31,478 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:51:31,479 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:31,479 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:31,479 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:31,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:51:31,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:51:31,554 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:51:31,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:51:31,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:51:31,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:51:31,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:51:31,555 INFO L87 Difference]: Start difference. First operand 153 states and 169 transitions. Second operand 5 states. [2018-02-02 18:51:31,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:51:31,780 INFO L93 Difference]: Finished difference Result 211 states and 234 transitions. [2018-02-02 18:51:31,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:51:31,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 18:51:31,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:51:31,783 INFO L225 Difference]: With dead ends: 211 [2018-02-02 18:51:31,783 INFO L226 Difference]: Without dead ends: 211 [2018-02-02 18:51:31,783 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-02-02 18:51:31,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-02 18:51:31,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 188. [2018-02-02 18:51:31,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-02 18:51:31,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 215 transitions. [2018-02-02 18:51:31,790 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 215 transitions. Word has length 14 [2018-02-02 18:51:31,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:51:31,790 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 215 transitions. [2018-02-02 18:51:31,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:51:31,790 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 215 transitions. [2018-02-02 18:51:31,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 18:51:31,791 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:51:31,791 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:51:31,791 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:51:31,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1727604301, now seen corresponding path program 1 times [2018-02-02 18:51:31,791 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:51:31,792 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:51:31,792 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:31,792 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:31,793 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:31,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:51:31,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:51:31,848 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:51:31,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 18:51:31,849 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 18:51:31,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 18:51:31,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 18:51:31,849 INFO L87 Difference]: Start difference. First operand 188 states and 215 transitions. Second operand 7 states. [2018-02-02 18:51:31,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:51:31,978 INFO L93 Difference]: Finished difference Result 249 states and 278 transitions. [2018-02-02 18:51:31,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 18:51:31,978 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-02-02 18:51:31,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:51:31,979 INFO L225 Difference]: With dead ends: 249 [2018-02-02 18:51:31,979 INFO L226 Difference]: Without dead ends: 249 [2018-02-02 18:51:31,979 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-02-02 18:51:31,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-02-02 18:51:31,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 189. [2018-02-02 18:51:31,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-02-02 18:51:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 216 transitions. [2018-02-02 18:51:31,983 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 216 transitions. Word has length 18 [2018-02-02 18:51:31,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:51:31,984 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 216 transitions. [2018-02-02 18:51:31,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 18:51:31,984 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 216 transitions. [2018-02-02 18:51:31,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 18:51:31,985 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:51:31,985 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:51:31,985 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:51:31,985 INFO L82 PathProgramCache]: Analyzing trace with hash 471570443, now seen corresponding path program 1 times [2018-02-02 18:51:31,985 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:51:31,985 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:51:31,986 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:31,986 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:31,986 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:31,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:51:32,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:51:32,025 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:51:32,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:51:32,026 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:51:32,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:51:32,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:51:32,026 INFO L87 Difference]: Start difference. First operand 189 states and 216 transitions. Second operand 5 states. [2018-02-02 18:51:32,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:51:32,151 INFO L93 Difference]: Finished difference Result 207 states and 233 transitions. [2018-02-02 18:51:32,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:51:32,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-02-02 18:51:32,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:51:32,152 INFO L225 Difference]: With dead ends: 207 [2018-02-02 18:51:32,152 INFO L226 Difference]: Without dead ends: 207 [2018-02-02 18:51:32,153 INFO L554 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-02-02 18:51:32,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-02 18:51:32,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 188. [2018-02-02 18:51:32,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-02 18:51:32,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 214 transitions. [2018-02-02 18:51:32,157 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 214 transitions. Word has length 21 [2018-02-02 18:51:32,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:51:32,157 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 214 transitions. [2018-02-02 18:51:32,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:51:32,158 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 214 transitions. [2018-02-02 18:51:32,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 18:51:32,158 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:51:32,158 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:51:32,158 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:51:32,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1608607228, now seen corresponding path program 1 times [2018-02-02 18:51:32,158 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:51:32,158 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:51:32,159 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:32,159 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:32,159 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:32,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:51:32,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:51:32,184 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:51:32,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:51:32,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:51:32,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:51:32,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:51:32,185 INFO L87 Difference]: Start difference. First operand 188 states and 214 transitions. Second operand 3 states. [2018-02-02 18:51:32,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:51:32,189 INFO L93 Difference]: Finished difference Result 190 states and 216 transitions. [2018-02-02 18:51:32,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:51:32,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-02-02 18:51:32,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:51:32,190 INFO L225 Difference]: With dead ends: 190 [2018-02-02 18:51:32,190 INFO L226 Difference]: Without dead ends: 190 [2018-02-02 18:51:32,191 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:51:32,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-02-02 18:51:32,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-02-02 18:51:32,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-02-02 18:51:32,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 216 transitions. [2018-02-02 18:51:32,193 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 216 transitions. Word has length 22 [2018-02-02 18:51:32,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:51:32,194 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 216 transitions. [2018-02-02 18:51:32,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:51:32,194 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 216 transitions. [2018-02-02 18:51:32,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 18:51:32,195 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:51:32,195 INFO L351 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] [2018-02-02 18:51:32,195 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:51:32,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1343010439, now seen corresponding path program 1 times [2018-02-02 18:51:32,195 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:51:32,195 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:51:32,196 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:32,196 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:32,196 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:32,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:51:32,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:51:32,289 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:51:32,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 18:51:32,289 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 18:51:32,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 18:51:32,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:51:32,290 INFO L87 Difference]: Start difference. First operand 190 states and 216 transitions. Second operand 6 states. [2018-02-02 18:51:32,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:51:32,460 INFO L93 Difference]: Finished difference Result 238 states and 271 transitions. [2018-02-02 18:51:32,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 18:51:32,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 18:51:32,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:51:32,461 INFO L225 Difference]: With dead ends: 238 [2018-02-02 18:51:32,461 INFO L226 Difference]: Without dead ends: 238 [2018-02-02 18:51:32,462 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:51:32,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-02-02 18:51:32,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 206. [2018-02-02 18:51:32,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 18:51:32,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 237 transitions. [2018-02-02 18:51:32,464 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 237 transitions. Word has length 24 [2018-02-02 18:51:32,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:51:32,465 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 237 transitions. [2018-02-02 18:51:32,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 18:51:32,465 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 237 transitions. [2018-02-02 18:51:32,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 18:51:32,465 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:51:32,465 INFO L351 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] [2018-02-02 18:51:32,465 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:51:32,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1202174280, now seen corresponding path program 1 times [2018-02-02 18:51:32,466 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:51:32,466 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:51:32,466 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:32,466 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:32,466 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:32,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:51:32,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:51:32,511 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:51:32,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:51:32,511 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:51:32,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:51:32,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:51:32,512 INFO L87 Difference]: Start difference. First operand 206 states and 237 transitions. Second operand 5 states. [2018-02-02 18:51:32,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:51:32,799 INFO L93 Difference]: Finished difference Result 331 states and 382 transitions. [2018-02-02 18:51:32,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:51:32,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-02 18:51:32,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:51:32,800 INFO L225 Difference]: With dead ends: 331 [2018-02-02 18:51:32,800 INFO L226 Difference]: Without dead ends: 331 [2018-02-02 18:51:32,801 INFO L554 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-02-02 18:51:32,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-02-02 18:51:32,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 205. [2018-02-02 18:51:32,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-02-02 18:51:32,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 235 transitions. [2018-02-02 18:51:32,809 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 235 transitions. Word has length 25 [2018-02-02 18:51:32,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:51:32,811 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 235 transitions. [2018-02-02 18:51:32,811 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:51:32,812 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 235 transitions. [2018-02-02 18:51:32,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 18:51:32,813 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:51:32,814 INFO L351 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] [2018-02-02 18:51:32,814 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:51:32,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1202174281, now seen corresponding path program 1 times [2018-02-02 18:51:32,815 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:51:32,815 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:51:32,816 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:32,816 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:32,816 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:32,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:51:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:51:32,891 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:51:32,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:51:32,891 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:51:32,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:51:32,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:51:32,895 INFO L87 Difference]: Start difference. First operand 205 states and 235 transitions. Second operand 5 states. [2018-02-02 18:51:33,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:51:33,131 INFO L93 Difference]: Finished difference Result 364 states and 415 transitions. [2018-02-02 18:51:33,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:51:33,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-02 18:51:33,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:51:33,132 INFO L225 Difference]: With dead ends: 364 [2018-02-02 18:51:33,132 INFO L226 Difference]: Without dead ends: 364 [2018-02-02 18:51:33,132 INFO L554 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-02-02 18:51:33,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-02-02 18:51:33,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 204. [2018-02-02 18:51:33,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-02 18:51:33,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 233 transitions. [2018-02-02 18:51:33,135 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 233 transitions. Word has length 25 [2018-02-02 18:51:33,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:51:33,135 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 233 transitions. [2018-02-02 18:51:33,135 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:51:33,135 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 233 transitions. [2018-02-02 18:51:33,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 18:51:33,136 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:51:33,136 INFO L351 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] [2018-02-02 18:51:33,136 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:51:33,136 INFO L82 PathProgramCache]: Analyzing trace with hash -2086605704, now seen corresponding path program 1 times [2018-02-02 18:51:33,136 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:51:33,136 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:51:33,137 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:33,137 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:33,137 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:33,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:51:33,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:51:33,157 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:51:33,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:51:33,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:51:33,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:51:33,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:51:33,157 INFO L87 Difference]: Start difference. First operand 204 states and 233 transitions. Second operand 4 states. [2018-02-02 18:51:33,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:51:33,308 INFO L93 Difference]: Finished difference Result 250 states and 283 transitions. [2018-02-02 18:51:33,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:51:33,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-02-02 18:51:33,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:51:33,309 INFO L225 Difference]: With dead ends: 250 [2018-02-02 18:51:33,309 INFO L226 Difference]: Without dead ends: 250 [2018-02-02 18:51:33,310 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-02 18:51:33,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-02 18:51:33,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 207. [2018-02-02 18:51:33,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-02 18:51:33,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 238 transitions. [2018-02-02 18:51:33,314 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 238 transitions. Word has length 27 [2018-02-02 18:51:33,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:51:33,314 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 238 transitions. [2018-02-02 18:51:33,314 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:51:33,314 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 238 transitions. [2018-02-02 18:51:33,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 18:51:33,315 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:51:33,315 INFO L351 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] [2018-02-02 18:51:33,315 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:51:33,316 INFO L82 PathProgramCache]: Analyzing trace with hash -2086605703, now seen corresponding path program 1 times [2018-02-02 18:51:33,316 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:51:33,316 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:51:33,316 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:33,317 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:33,317 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:33,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:51:33,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 18:51:33,417 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:51:33,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 18:51:33,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 18:51:33,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 18:51:33,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:51:33,418 INFO L87 Difference]: Start difference. First operand 207 states and 238 transitions. Second operand 8 states. [2018-02-02 18:51:33,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:51:33,700 INFO L93 Difference]: Finished difference Result 317 states and 353 transitions. [2018-02-02 18:51:33,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 18:51:33,701 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-02-02 18:51:33,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:51:33,701 INFO L225 Difference]: With dead ends: 317 [2018-02-02 18:51:33,701 INFO L226 Difference]: Without dead ends: 317 [2018-02-02 18:51:33,702 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-02-02 18:51:33,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-02-02 18:51:33,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 211. [2018-02-02 18:51:33,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-02-02 18:51:33,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 244 transitions. [2018-02-02 18:51:33,706 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 244 transitions. Word has length 27 [2018-02-02 18:51:33,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:51:33,706 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 244 transitions. [2018-02-02 18:51:33,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 18:51:33,706 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 244 transitions. [2018-02-02 18:51:33,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 18:51:33,707 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:51:33,707 INFO L351 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] [2018-02-02 18:51:33,707 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:51:33,707 INFO L82 PathProgramCache]: Analyzing trace with hash -2086546122, now seen corresponding path program 1 times [2018-02-02 18:51:33,707 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:51:33,707 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:51:33,708 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:33,708 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:33,708 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:33,716 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:51:33,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:51:33,795 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:51:33,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 18:51:33,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 18:51:33,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 18:51:33,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 18:51:33,796 INFO L87 Difference]: Start difference. First operand 211 states and 244 transitions. Second operand 7 states. [2018-02-02 18:51:34,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:51:34,002 INFO L93 Difference]: Finished difference Result 343 states and 382 transitions. [2018-02-02 18:51:34,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 18:51:34,002 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-02 18:51:34,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:51:34,003 INFO L225 Difference]: With dead ends: 343 [2018-02-02 18:51:34,003 INFO L226 Difference]: Without dead ends: 343 [2018-02-02 18:51:34,003 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-02-02 18:51:34,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-02-02 18:51:34,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 223. [2018-02-02 18:51:34,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-02 18:51:34,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 256 transitions. [2018-02-02 18:51:34,006 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 256 transitions. Word has length 27 [2018-02-02 18:51:34,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:51:34,006 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 256 transitions. [2018-02-02 18:51:34,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 18:51:34,006 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 256 transitions. [2018-02-02 18:51:34,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 18:51:34,010 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:51:34,010 INFO L351 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] [2018-02-02 18:51:34,011 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:51:34,011 INFO L82 PathProgramCache]: Analyzing trace with hash -260268355, now seen corresponding path program 1 times [2018-02-02 18:51:34,011 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:51:34,011 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:51:34,011 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:34,011 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:34,012 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:34,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:51:34,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:51:34,069 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:51:34,069 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:51:34,078 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:34,127 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:51:34,182 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:34,182 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:34,193 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 18:51:34,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:34,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:34,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-02-02 18:51:34,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 18:51:34,253 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:51:34,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2018-02-02 18:51:34,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 18:51:34,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 18:51:34,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 18:51:34,254 INFO L87 Difference]: Start difference. First operand 223 states and 256 transitions. Second operand 10 states. [2018-02-02 18:51:34,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:51:34,637 INFO L93 Difference]: Finished difference Result 338 states and 376 transitions. [2018-02-02 18:51:34,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 18:51:34,637 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-02-02 18:51:34,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:51:34,638 INFO L225 Difference]: With dead ends: 338 [2018-02-02 18:51:34,638 INFO L226 Difference]: Without dead ends: 338 [2018-02-02 18:51:34,638 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=316, Unknown=0, NotChecked=0, Total=462 [2018-02-02 18:51:34,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-02-02 18:51:34,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 221. [2018-02-02 18:51:34,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-02 18:51:34,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 253 transitions. [2018-02-02 18:51:34,643 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 253 transitions. Word has length 28 [2018-02-02 18:51:34,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:51:34,643 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 253 transitions. [2018-02-02 18:51:34,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 18:51:34,644 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 253 transitions. [2018-02-02 18:51:34,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 18:51:34,644 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:51:34,644 INFO L351 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-02-02 18:51:34,644 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:51:34,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1758248235, now seen corresponding path program 1 times [2018-02-02 18:51:34,645 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:51:34,645 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:51:34,646 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:34,646 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:34,646 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:34,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:51:34,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:51:34,721 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:51:34,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 18:51:34,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 18:51:34,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 18:51:34,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:51:34,722 INFO L87 Difference]: Start difference. First operand 221 states and 253 transitions. Second operand 9 states. [2018-02-02 18:51:35,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:51:35,151 INFO L93 Difference]: Finished difference Result 278 states and 318 transitions. [2018-02-02 18:51:35,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 18:51:35,152 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-02-02 18:51:35,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:51:35,152 INFO L225 Difference]: With dead ends: 278 [2018-02-02 18:51:35,152 INFO L226 Difference]: Without dead ends: 278 [2018-02-02 18:51:35,153 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 18:51:35,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-02-02 18:51:35,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 220. [2018-02-02 18:51:35,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-02 18:51:35,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 251 transitions. [2018-02-02 18:51:35,156 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 251 transitions. Word has length 28 [2018-02-02 18:51:35,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:51:35,157 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 251 transitions. [2018-02-02 18:51:35,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 18:51:35,157 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 251 transitions. [2018-02-02 18:51:35,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 18:51:35,157 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:51:35,157 INFO L351 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-02-02 18:51:35,157 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:51:35,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1758248234, now seen corresponding path program 1 times [2018-02-02 18:51:35,157 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:51:35,157 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:51:35,158 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:35,158 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:35,158 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:35,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:51:35,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:51:35,240 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:51:35,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 18:51:35,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 18:51:35,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 18:51:35,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:51:35,241 INFO L87 Difference]: Start difference. First operand 220 states and 251 transitions. Second operand 9 states. [2018-02-02 18:51:35,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:51:35,733 INFO L93 Difference]: Finished difference Result 277 states and 316 transitions. [2018-02-02 18:51:35,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 18:51:35,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-02-02 18:51:35,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:51:35,734 INFO L225 Difference]: With dead ends: 277 [2018-02-02 18:51:35,734 INFO L226 Difference]: Without dead ends: 277 [2018-02-02 18:51:35,735 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 18:51:35,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-02-02 18:51:35,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 219. [2018-02-02 18:51:35,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 18:51:35,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 249 transitions. [2018-02-02 18:51:35,737 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 249 transitions. Word has length 28 [2018-02-02 18:51:35,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:51:35,737 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 249 transitions. [2018-02-02 18:51:35,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 18:51:35,738 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 249 transitions. [2018-02-02 18:51:35,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 18:51:35,738 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:51:35,738 INFO L351 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] [2018-02-02 18:51:35,738 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:51:35,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1399776421, now seen corresponding path program 1 times [2018-02-02 18:51:35,738 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:51:35,739 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:51:35,739 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:35,739 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:35,739 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:35,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:51:35,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:51:35,777 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:51:35,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:51:35,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:51:35,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:51:35,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:51:35,778 INFO L87 Difference]: Start difference. First operand 219 states and 249 transitions. Second operand 5 states. [2018-02-02 18:51:35,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:51:35,957 INFO L93 Difference]: Finished difference Result 347 states and 398 transitions. [2018-02-02 18:51:35,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:51:35,958 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-02 18:51:35,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:51:35,958 INFO L225 Difference]: With dead ends: 347 [2018-02-02 18:51:35,958 INFO L226 Difference]: Without dead ends: 347 [2018-02-02 18:51:35,959 INFO L554 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-02-02 18:51:35,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-02-02 18:51:35,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 218. [2018-02-02 18:51:35,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 18:51:35,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 247 transitions. [2018-02-02 18:51:35,962 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 247 transitions. Word has length 29 [2018-02-02 18:51:35,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:51:35,962 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 247 transitions. [2018-02-02 18:51:35,962 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:51:35,962 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 247 transitions. [2018-02-02 18:51:35,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 18:51:35,963 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:51:35,963 INFO L351 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] [2018-02-02 18:51:35,963 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:51:35,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1399776422, now seen corresponding path program 1 times [2018-02-02 18:51:35,963 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:51:35,963 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:51:35,964 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:35,964 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:35,964 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:35,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:51:36,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:51:36,015 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:51:36,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:51:36,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:51:36,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:51:36,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:51:36,016 INFO L87 Difference]: Start difference. First operand 218 states and 247 transitions. Second operand 5 states. [2018-02-02 18:51:36,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:51:36,321 INFO L93 Difference]: Finished difference Result 380 states and 431 transitions. [2018-02-02 18:51:36,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:51:36,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-02 18:51:36,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:51:36,323 INFO L225 Difference]: With dead ends: 380 [2018-02-02 18:51:36,323 INFO L226 Difference]: Without dead ends: 380 [2018-02-02 18:51:36,324 INFO L554 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-02-02 18:51:36,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-02-02 18:51:36,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 217. [2018-02-02 18:51:36,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-02 18:51:36,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 245 transitions. [2018-02-02 18:51:36,329 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 245 transitions. Word has length 29 [2018-02-02 18:51:36,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:51:36,329 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 245 transitions. [2018-02-02 18:51:36,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:51:36,330 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 245 transitions. [2018-02-02 18:51:36,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 18:51:36,330 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:51:36,330 INFO L351 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] [2018-02-02 18:51:36,330 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:51:36,330 INFO L82 PathProgramCache]: Analyzing trace with hash 901972539, now seen corresponding path program 1 times [2018-02-02 18:51:36,331 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:51:36,331 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:51:36,331 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:36,331 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:36,331 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:36,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:51:36,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:51:36,433 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:51:36,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 18:51:36,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 18:51:36,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 18:51:36,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:51:36,434 INFO L87 Difference]: Start difference. First operand 217 states and 245 transitions. Second operand 9 states. [2018-02-02 18:51:36,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:51:36,853 INFO L93 Difference]: Finished difference Result 244 states and 275 transitions. [2018-02-02 18:51:36,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 18:51:36,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-02 18:51:36,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:51:36,854 INFO L225 Difference]: With dead ends: 244 [2018-02-02 18:51:36,854 INFO L226 Difference]: Without dead ends: 244 [2018-02-02 18:51:36,854 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 18:51:36,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-02 18:51:36,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 216. [2018-02-02 18:51:36,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-02 18:51:36,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 244 transitions. [2018-02-02 18:51:36,857 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 244 transitions. Word has length 32 [2018-02-02 18:51:36,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:51:36,858 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 244 transitions. [2018-02-02 18:51:36,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 18:51:36,858 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 244 transitions. [2018-02-02 18:51:36,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 18:51:36,858 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:51:36,858 INFO L351 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] [2018-02-02 18:51:36,858 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:51:36,859 INFO L82 PathProgramCache]: Analyzing trace with hash 901972538, now seen corresponding path program 1 times [2018-02-02 18:51:36,859 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:51:36,859 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:51:36,859 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:36,860 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:36,860 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:36,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:51:36,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:51:36,927 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:51:36,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 18:51:36,928 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 18:51:36,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 18:51:36,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:51:36,928 INFO L87 Difference]: Start difference. First operand 216 states and 244 transitions. Second operand 9 states. [2018-02-02 18:51:37,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:51:37,188 INFO L93 Difference]: Finished difference Result 243 states and 274 transitions. [2018-02-02 18:51:37,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 18:51:37,189 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-02 18:51:37,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:51:37,190 INFO L225 Difference]: With dead ends: 243 [2018-02-02 18:51:37,190 INFO L226 Difference]: Without dead ends: 243 [2018-02-02 18:51:37,190 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 18:51:37,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-02 18:51:37,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 215. [2018-02-02 18:51:37,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-02 18:51:37,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 243 transitions. [2018-02-02 18:51:37,193 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 243 transitions. Word has length 32 [2018-02-02 18:51:37,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:51:37,193 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 243 transitions. [2018-02-02 18:51:37,193 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 18:51:37,193 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 243 transitions. [2018-02-02 18:51:37,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 18:51:37,194 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:51:37,194 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:51:37,194 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:51:37,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1252448966, now seen corresponding path program 1 times [2018-02-02 18:51:37,194 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:51:37,194 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:51:37,195 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:37,195 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:37,195 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:37,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:51:37,334 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:51:37,334 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:51:37,334 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:51:37,339 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:37,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:37,356 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:51:37,361 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-02-02 18:51:37,363 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-02-02 18:51:37,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:37,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:37,374 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-02-02 18:51:37,375 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-02-02 18:51:37,376 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:37,377 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:37,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:37,380 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-02-02 18:51:37,406 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 27 treesize of output 20 [2018-02-02 18:51:37,409 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:37,409 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 20 treesize of output 29 [2018-02-02 18:51:37,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:37,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:37,421 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 27 treesize of output 20 [2018-02-02 18:51:37,423 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:37,424 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 20 treesize of output 29 [2018-02-02 18:51:37,424 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:37,427 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:37,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:37,431 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-02-02 18:51:37,446 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 36 treesize of output 27 [2018-02-02 18:51:37,447 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:37,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 27 treesize of output 23 [2018-02-02 18:51:37,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:37,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:37,461 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 36 treesize of output 27 [2018-02-02 18:51:37,463 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:37,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 27 treesize of output 23 [2018-02-02 18:51:37,466 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:37,470 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:37,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:37,477 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:71, output treesize:15 [2018-02-02 18:51:37,514 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 20 treesize of output 16 [2018-02-02 18:51:37,517 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 11 treesize of output 3 [2018-02-02 18:51:37,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:37,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:37,522 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 20 treesize of output 16 [2018-02-02 18:51:37,526 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 11 treesize of output 3 [2018-02-02 18:51:37,526 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:37,527 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:37,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:37,528 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:39, output treesize:7 [2018-02-02 18:51:37,552 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:51:37,569 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:51:37,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 12 [2018-02-02 18:51:37,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 18:51:37,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 18:51:37,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 18:51:37,569 INFO L87 Difference]: Start difference. First operand 215 states and 243 transitions. Second operand 12 states. [2018-02-02 18:51:37,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:51:37,843 INFO L93 Difference]: Finished difference Result 270 states and 302 transitions. [2018-02-02 18:51:37,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 18:51:37,843 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-02-02 18:51:37,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:51:37,844 INFO L225 Difference]: With dead ends: 270 [2018-02-02 18:51:37,844 INFO L226 Difference]: Without dead ends: 270 [2018-02-02 18:51:37,844 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-02-02 18:51:37,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-02-02 18:51:37,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 225. [2018-02-02 18:51:37,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-02 18:51:37,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 253 transitions. [2018-02-02 18:51:37,846 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 253 transitions. Word has length 37 [2018-02-02 18:51:37,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:51:37,846 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 253 transitions. [2018-02-02 18:51:37,847 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 18:51:37,847 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 253 transitions. [2018-02-02 18:51:37,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 18:51:37,847 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:51:37,847 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:51:37,847 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:51:37,847 INFO L82 PathProgramCache]: Analyzing trace with hash 126757974, now seen corresponding path program 2 times [2018-02-02 18:51:37,847 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:51:37,847 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:51:37,848 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:37,848 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:37,848 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:37,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:51:38,056 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:51:38,056 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:51:38,056 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:51:38,063 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 18:51:38,087 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 18:51:38,088 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:51:38,090 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:51:38,093 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-02-02 18:51:38,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:38,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:38,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 18:51:38,115 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-02-02 18:51:38,116 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-02-02 18:51:38,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:38,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:38,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:38,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-02-02 18:51:38,177 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 29 treesize of output 22 [2018-02-02 18:51:38,181 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:38,182 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 22 treesize of output 31 [2018-02-02 18:51:38,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:38,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:38,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:38,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-02-02 18:51:38,213 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 38 treesize of output 29 [2018-02-02 18:51:38,225 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:38,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-02-02 18:51:38,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:38,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:38,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:38,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:13 [2018-02-02 18:51:38,268 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 17 treesize of output 13 [2018-02-02 18:51:38,270 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 13 treesize of output 5 [2018-02-02 18:51:38,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:38,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:38,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:38,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-02-02 18:51:38,325 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:51:38,343 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:51:38,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-02-02 18:51:38,343 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 18:51:38,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 18:51:38,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2018-02-02 18:51:38,343 INFO L87 Difference]: Start difference. First operand 225 states and 253 transitions. Second operand 25 states. [2018-02-02 18:51:39,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:51:39,854 INFO L93 Difference]: Finished difference Result 402 states and 444 transitions. [2018-02-02 18:51:39,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 18:51:39,854 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2018-02-02 18:51:39,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:51:39,855 INFO L225 Difference]: With dead ends: 402 [2018-02-02 18:51:39,855 INFO L226 Difference]: Without dead ends: 402 [2018-02-02 18:51:39,856 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=433, Invalid=2537, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 18:51:39,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-02-02 18:51:39,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 257. [2018-02-02 18:51:39,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-02-02 18:51:39,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 288 transitions. [2018-02-02 18:51:39,858 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 288 transitions. Word has length 47 [2018-02-02 18:51:39,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:51:39,858 INFO L432 AbstractCegarLoop]: Abstraction has 257 states and 288 transitions. [2018-02-02 18:51:39,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 18:51:39,859 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 288 transitions. [2018-02-02 18:51:39,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 18:51:39,859 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:51:39,859 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:51:39,859 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:51:39,859 INFO L82 PathProgramCache]: Analyzing trace with hash -365471073, now seen corresponding path program 1 times [2018-02-02 18:51:39,859 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:51:39,859 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:51:39,860 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:39,860 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:51:39,860 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:39,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:51:39,892 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-02 18:51:39,892 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:51:39,892 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:51:39,902 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:39,924 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:51:39,936 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-02 18:51:39,967 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:51:39,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-02-02 18:51:39,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:51:39,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:51:39,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:51:39,968 INFO L87 Difference]: Start difference. First operand 257 states and 288 transitions. Second operand 4 states. [2018-02-02 18:51:40,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:51:40,075 INFO L93 Difference]: Finished difference Result 344 states and 380 transitions. [2018-02-02 18:51:40,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:51:40,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-02-02 18:51:40,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:51:40,076 INFO L225 Difference]: With dead ends: 344 [2018-02-02 18:51:40,076 INFO L226 Difference]: Without dead ends: 344 [2018-02-02 18:51:40,077 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:51:40,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-02-02 18:51:40,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 260. [2018-02-02 18:51:40,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-02-02 18:51:40,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 292 transitions. [2018-02-02 18:51:40,080 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 292 transitions. Word has length 48 [2018-02-02 18:51:40,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:51:40,080 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 292 transitions. [2018-02-02 18:51:40,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:51:40,080 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 292 transitions. [2018-02-02 18:51:40,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 18:51:40,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:51:40,081 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:51:40,081 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:51:40,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1428269570, now seen corresponding path program 1 times [2018-02-02 18:51:40,081 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:51:40,081 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:51:40,082 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:40,082 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:40,082 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:40,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:51:40,466 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:51:40,467 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:51:40,467 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:51:40,471 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:40,487 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:51:40,586 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:40,587 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:40,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-02 18:51:40,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:40,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:40,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:38 [2018-02-02 18:51:40,618 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-02-02 18:51:40,620 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:40,620 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-02-02 18:51:40,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:40,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:40,635 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-02-02 18:51:40,637 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:40,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-02-02 18:51:40,638 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:40,641 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:40,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:40,649 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:61, output treesize:56 [2018-02-02 18:51:40,713 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:40,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-02-02 18:51:40,737 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 14 treesize of output 13 [2018-02-02 18:51:40,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:40,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:40,758 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:40,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 62 [2018-02-02 18:51:40,773 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 14 treesize of output 13 [2018-02-02 18:51:40,773 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:40,780 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:40,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:40,791 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:102, output treesize:82 [2018-02-02 18:51:40,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2018-02-02 18:51:40,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 22 treesize of output 29 [2018-02-02 18:51:40,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:40,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:40,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 81 [2018-02-02 18:51:40,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 22 treesize of output 29 [2018-02-02 18:51:40,939 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:40,946 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:40,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:40,956 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:126, output treesize:106 [2018-02-02 18:51:45,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-02-02 18:51:45,978 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 7 treesize of output 1 [2018-02-02 18:51:45,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:45,984 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:45,985 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-02-02 18:51:45,985 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:45,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:46,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:46,003 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:94, output treesize:59 [2018-02-02 18:51:46,088 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:51:46,112 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:51:46,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 33 [2018-02-02 18:51:46,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 18:51:46,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 18:51:46,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=890, Unknown=3, NotChecked=0, Total=1056 [2018-02-02 18:51:46,113 INFO L87 Difference]: Start difference. First operand 260 states and 292 transitions. Second operand 33 states. [2018-02-02 18:51:50,696 WARN L146 SmtUtils]: Spent 2038ms on a formula simplification. DAG size of input: 77 DAG size of output 54 [2018-02-02 18:51:52,828 WARN L146 SmtUtils]: Spent 2044ms on a formula simplification. DAG size of input: 97 DAG size of output 54 [2018-02-02 18:51:53,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:51:53,513 INFO L93 Difference]: Finished difference Result 350 states and 394 transitions. [2018-02-02 18:51:53,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 18:51:53,513 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 48 [2018-02-02 18:51:53,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:51:53,514 INFO L225 Difference]: With dead ends: 350 [2018-02-02 18:51:53,514 INFO L226 Difference]: Without dead ends: 350 [2018-02-02 18:51:53,515 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=498, Invalid=1851, Unknown=3, NotChecked=0, Total=2352 [2018-02-02 18:51:53,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-02-02 18:51:53,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 283. [2018-02-02 18:51:53,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-02-02 18:51:53,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 319 transitions. [2018-02-02 18:51:53,518 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 319 transitions. Word has length 48 [2018-02-02 18:51:53,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:51:53,518 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 319 transitions. [2018-02-02 18:51:53,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 18:51:53,518 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 319 transitions. [2018-02-02 18:51:53,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 18:51:53,518 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:51:53,518 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:51:53,519 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:51:53,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1743211522, now seen corresponding path program 1 times [2018-02-02 18:51:53,519 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:51:53,519 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:51:53,519 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:53,519 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:53,519 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:53,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:51:53,646 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:51:53,647 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:51:53,647 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:51:53,651 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:53,670 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:51:53,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:53,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:53,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-02 18:51:53,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:53,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:53,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-02-02 18:51:53,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-02-02 18:51:53,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-02-02 18:51:53,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:53,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:53,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:53,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-02-02 18:51:53,735 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:53,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-02-02 18:51:53,740 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 12 treesize of output 11 [2018-02-02 18:51:53,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:53,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:53,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:53,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-02-02 18:51:53,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-02-02 18:51:53,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 20 treesize of output 25 [2018-02-02 18:51:53,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:53,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:53,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 18:51:53,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:47 [2018-02-02 18:51:59,823 WARN L146 SmtUtils]: Spent 2009ms on a formula simplification. DAG size of input: 26 DAG size of output 22 [2018-02-02 18:52:01,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-02-02 18:52:01,874 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-02-02 18:52:01,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:52:01,881 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 7 treesize of output 1 [2018-02-02 18:52:01,881 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:52:01,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:52:01,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:52:01,886 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:15 [2018-02-02 18:52:01,965 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:52:01,990 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:52:01,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-02 18:52:01,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 18:52:01,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 18:52:01,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=367, Unknown=3, NotChecked=0, Total=462 [2018-02-02 18:52:01,991 INFO L87 Difference]: Start difference. First operand 283 states and 319 transitions. Second operand 22 states. [2018-02-02 18:52:47,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:52:47,171 INFO L93 Difference]: Finished difference Result 602 states and 705 transitions. [2018-02-02 18:52:47,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 18:52:47,173 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-02-02 18:52:47,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:52:47,174 INFO L225 Difference]: With dead ends: 602 [2018-02-02 18:52:47,174 INFO L226 Difference]: Without dead ends: 602 [2018-02-02 18:52:47,175 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 40.6s TimeCoverageRelationStatistics Valid=344, Invalid=897, Unknown=19, NotChecked=0, Total=1260 [2018-02-02 18:52:47,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-02-02 18:52:47,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 328. [2018-02-02 18:52:47,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-02-02 18:52:47,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 387 transitions. [2018-02-02 18:52:47,178 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 387 transitions. Word has length 48 [2018-02-02 18:52:47,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:52:47,178 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 387 transitions. [2018-02-02 18:52:47,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 18:52:47,179 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 387 transitions. [2018-02-02 18:52:47,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 18:52:47,179 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:52:47,179 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:52:47,179 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:52:47,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1743211521, now seen corresponding path program 1 times [2018-02-02 18:52:47,179 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:52:47,179 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:52:47,180 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:52:47,180 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:52:47,180 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:52:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:52:47,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:52:47,370 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:52:47,371 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:52:47,371 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:52:47,376 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:52:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:52:47,394 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:52:47,399 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-02-02 18:52:47,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:52:47,404 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:52:47,405 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:52:47,405 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 18:52:47,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:52:47,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:52:47,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-02-02 18:52:47,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-02-02 18:52:47,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-02-02 18:52:47,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:52:47,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:52:47,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-02-02 18:52:47,427 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-02-02 18:52:47,428 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:52:47,428 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:52:47,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:52:47,433 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-02-02 18:52:47,459 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:52:47,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 63 [2018-02-02 18:52:47,482 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 12 treesize of output 11 [2018-02-02 18:52:47,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:52:47,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:52:47,495 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:52:47,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-02-02 18:52:47,498 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 12 treesize of output 11 [2018-02-02 18:52:47,498 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:52:47,502 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:52:47,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:52:47,511 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-02-02 18:52:47,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-02-02 18:52:47,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 20 treesize of output 25 [2018-02-02 18:52:47,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:52:47,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:52:47,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-02-02 18:52:47,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 20 treesize of output 25 [2018-02-02 18:52:47,596 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:52:47,601 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:52:47,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 18:52:47,608 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:73 [2018-02-02 18:52:53,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-02-02 18:52:53,714 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 7 treesize of output 1 [2018-02-02 18:52:53,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:52:53,726 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-02-02 18:52:53,726 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:52:53,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:52:53,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-02-02 18:52:53,739 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 7 treesize of output 1 [2018-02-02 18:52:53,739 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:52:53,743 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 11 treesize of output 3 [2018-02-02 18:52:53,744 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 18:52:53,745 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:52:53,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:52:53,748 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-02-02 18:52:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:52:53,787 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:52:53,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2018-02-02 18:52:53,787 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 18:52:53,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 18:52:53,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=277, Unknown=3, NotChecked=0, Total=342 [2018-02-02 18:52:53,788 INFO L87 Difference]: Start difference. First operand 328 states and 387 transitions. Second operand 19 states. [2018-02-02 18:52:56,112 WARN L146 SmtUtils]: Spent 2032ms on a formula simplification. DAG size of input: 91 DAG size of output 47 [2018-02-02 18:52:56,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:52:56,880 INFO L93 Difference]: Finished difference Result 584 states and 681 transitions. [2018-02-02 18:52:57,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 18:52:57,009 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-02-02 18:52:57,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:52:57,010 INFO L225 Difference]: With dead ends: 584 [2018-02-02 18:52:57,010 INFO L226 Difference]: Without dead ends: 584 [2018-02-02 18:52:57,011 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=215, Invalid=712, Unknown=3, NotChecked=0, Total=930 [2018-02-02 18:52:57,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-02-02 18:52:57,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 348. [2018-02-02 18:52:57,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-02-02 18:52:57,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 411 transitions. [2018-02-02 18:52:57,016 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 411 transitions. Word has length 48 [2018-02-02 18:52:57,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:52:57,016 INFO L432 AbstractCegarLoop]: Abstraction has 348 states and 411 transitions. [2018-02-02 18:52:57,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 18:52:57,016 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 411 transitions. [2018-02-02 18:52:57,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 18:52:57,017 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:52:57,017 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:52:57,017 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:52:57,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1737485884, now seen corresponding path program 1 times [2018-02-02 18:52:57,017 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:52:57,017 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:52:57,018 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:52:57,018 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:52:57,018 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:52:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:52:57,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:52:57,184 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:52:57,184 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:52:57,184 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:52:57,189 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:52:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:52:57,205 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:52:57,225 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-02-02 18:52:57,226 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-02-02 18:52:57,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:52:57,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:52:57,232 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-02-02 18:52:57,233 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-02-02 18:52:57,233 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:52:57,234 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:52:57,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:52:57,238 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-02-02 18:52:57,264 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:52:57,265 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:52:57,265 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 18:52:57,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:52:57,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:52:57,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2018-02-02 18:52:57,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-02-02 18:52:57,289 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:52:57,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-02-02 18:52:57,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:52:57,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:52:57,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-02-02 18:52:57,309 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:52:57,310 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-02-02 18:52:57,310 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:52:57,313 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:52:57,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:52:57,320 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:36 [2018-02-02 18:52:57,356 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:52:57,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-02-02 18:52:57,360 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 12 treesize of output 11 [2018-02-02 18:52:57,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:52:57,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:52:57,373 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:52:57,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-02-02 18:52:57,378 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 12 treesize of output 11 [2018-02-02 18:52:57,378 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:52:57,383 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:52:57,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:52:57,390 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:74, output treesize:58 [2018-02-02 18:52:57,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-02-02 18:52:57,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 20 treesize of output 25 [2018-02-02 18:52:57,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:52:57,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:52:57,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-02-02 18:52:57,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 20 treesize of output 25 [2018-02-02 18:52:57,495 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:52:57,499 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:52:57,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 18:52:57,512 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:97, output treesize:81 [2018-02-02 18:53:03,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 58 [2018-02-02 18:53:03,732 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 0 case distinctions, treesize of input 13 treesize of output 1 [2018-02-02 18:53:03,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:03,740 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:53:03,740 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:53:03,743 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-02-02 18:53:03,744 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:53:03,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:53:03,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-02-02 18:53:03,769 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 0 case distinctions, treesize of input 13 treesize of output 1 [2018-02-02 18:53:03,769 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:03,774 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:53:03,774 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 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-02 18:53:03,774 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:03,788 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:03,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:03,821 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:105, output treesize:7 [2018-02-02 18:53:03,857 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:53:03,877 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:53:03,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 26 [2018-02-02 18:53:03,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 18:53:03,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 18:53:03,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=571, Unknown=3, NotChecked=0, Total=650 [2018-02-02 18:53:03,878 INFO L87 Difference]: Start difference. First operand 348 states and 411 transitions. Second operand 26 states. Received shutdown request... [2018-02-02 18:53:10,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 18:53:10,375 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 18:53:10,379 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 18:53:10,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 06:53:10 BoogieIcfgContainer [2018-02-02 18:53:10,379 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 18:53:10,380 INFO L168 Benchmark]: Toolchain (without parser) took 100560.40 ms. Allocated memory was 398.5 MB in the beginning and 785.9 MB in the end (delta: 387.4 MB). Free memory was 352.3 MB in the beginning and 424.9 MB in the end (delta: -72.6 MB). Peak memory consumption was 314.8 MB. Max. memory is 5.3 GB. [2018-02-02 18:53:10,381 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 398.5 MB. Free memory is still 358.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 18:53:10,381 INFO L168 Benchmark]: CACSL2BoogieTranslator took 180.81 ms. Allocated memory is still 398.5 MB. Free memory was 352.3 MB in the beginning and 340.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-02 18:53:10,381 INFO L168 Benchmark]: Boogie Preprocessor took 29.45 ms. Allocated memory is still 398.5 MB. Free memory was 340.4 MB in the beginning and 339.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 18:53:10,381 INFO L168 Benchmark]: RCFGBuilder took 445.35 ms. Allocated memory is still 398.5 MB. Free memory was 339.1 MB in the beginning and 293.8 MB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 5.3 GB. [2018-02-02 18:53:10,381 INFO L168 Benchmark]: TraceAbstraction took 99901.73 ms. Allocated memory was 398.5 MB in the beginning and 785.9 MB in the end (delta: 387.4 MB). Free memory was 293.8 MB in the beginning and 424.9 MB in the end (delta: -131.1 MB). Peak memory consumption was 256.4 MB. Max. memory is 5.3 GB. [2018-02-02 18:53:10,383 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.16 ms. Allocated memory is still 398.5 MB. Free memory is still 358.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 180.81 ms. Allocated memory is still 398.5 MB. Free memory was 352.3 MB in the beginning and 340.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.45 ms. Allocated memory is still 398.5 MB. Free memory was 340.4 MB in the beginning and 339.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 445.35 ms. Allocated memory is still 398.5 MB. Free memory was 339.1 MB in the beginning and 293.8 MB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 99901.73 ms. Allocated memory was 398.5 MB in the beginning and 785.9 MB in the end (delta: 387.4 MB). Free memory was 293.8 MB in the beginning and 424.9 MB in the end (delta: -131.1 MB). Peak memory consumption was 256.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 685). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 683). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 683). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 689). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 685). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 689). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (348states) and interpolant automaton (currently 13 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 36 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 173 locations, 75 error locations. TIMEOUT Result, 99.8s OverallTime, 27 OverallIterations, 4 TraceHistogramMax, 69.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3356 SDtfs, 10507 SDslu, 11610 SDs, 0 SdLazy, 14319 SolverSat, 1103 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 26.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 725 GetRequests, 318 SyntacticMatches, 33 SemanticMatches, 373 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1819 ImplicationChecksByTransitivity, 68.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=348occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 2163 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 29.7s InterpolantComputationTime, 1142 NumberOfCodeBlocks, 1142 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1107 ConstructedInterpolants, 70 QuantifiedInterpolants, 532638 SizeOfPredicates, 100 NumberOfNonLiveVariables, 1543 ConjunctsInSsa, 254 ConjunctsInUnsatCore, 35 InterpolantComputations, 20 PerfectInterpolantSequences, 112/295 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_dsw_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_18-53-10-389.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_dsw_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_18-53-10-389.csv Completed graceful shutdown