java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_parent_ptr_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 21:54:00,903 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 21:54:00,904 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 21:54:00,919 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 21:54:00,920 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 21:54:00,921 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 21:54:00,922 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 21:54:00,923 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 21:54:00,926 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 21:54:00,927 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 21:54:00,927 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 21:54:00,928 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 21:54:00,929 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 21:54:00,930 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 21:54:00,931 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 21:54:00,933 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 21:54:00,936 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 21:54:00,938 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 21:54:00,939 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 21:54:00,940 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 21:54:00,943 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 21:54:00,943 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 21:54:00,943 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 21:54:00,944 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 21:54:00,945 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 21:54:00,946 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 21:54:00,947 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 21:54:00,947 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 21:54:00,947 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 21:54:00,948 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 21:54:00,948 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 21:54:00,949 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 21:54:00,957 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 21:54:00,957 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 21:54:00,958 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 21:54:00,958 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 21:54:00,958 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 21:54:00,958 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 21:54:00,958 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 21:54:00,959 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 21:54:00,959 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 21:54:00,959 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 21:54:00,959 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 21:54:00,960 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 21:54:00,960 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 21:54:00,960 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 21:54:00,960 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 21:54:00,960 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 21:54:00,960 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 21:54:00,960 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 21:54:00,961 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 21:54:00,961 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 21:54:00,961 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 21:54:00,961 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 21:54:00,961 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 21:54:00,961 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 21:54:00,962 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 21:54:00,962 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 21:54:00,962 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 21:54:00,962 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 21:54:00,962 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 21:54:00,962 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 21:54:00,962 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 21:54:00,963 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 21:54:00,963 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 21:54:00,963 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 21:54:00,997 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 21:54:01,007 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 21:54:01,010 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 21:54:01,012 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 21:54:01,012 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 21:54:01,013 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-01-28 21:54:01,195 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 21:54:01,201 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 21:54:01,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 21:54:01,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 21:54:01,207 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 21:54:01,208 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:54:01" (1/1) ... [2018-01-28 21:54:01,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@672cf497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:54:01, skipping insertion in model container [2018-01-28 21:54:01,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:54:01" (1/1) ... [2018-01-28 21:54:01,226 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:54:01,263 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:54:01,391 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:54:01,416 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:54:01,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:54:01 WrapperNode [2018-01-28 21:54:01,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 21:54:01,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 21:54:01,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 21:54:01,428 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 21:54:01,443 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:54:01" (1/1) ... [2018-01-28 21:54:01,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:54:01" (1/1) ... [2018-01-28 21:54:01,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:54:01" (1/1) ... [2018-01-28 21:54:01,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:54:01" (1/1) ... [2018-01-28 21:54:01,463 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:54:01" (1/1) ... [2018-01-28 21:54:01,467 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:54:01" (1/1) ... [2018-01-28 21:54:01,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:54:01" (1/1) ... [2018-01-28 21:54:01,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 21:54:01,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 21:54:01,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 21:54:01,473 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 21:54:01,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:54:01" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 21:54:01,528 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 21:54:01,528 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 21:54:01,528 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 21:54:01,528 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-28 21:54:01,528 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-28 21:54:01,528 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 21:54:01,528 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 21:54:01,528 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 21:54:01,529 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 21:54:01,529 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-28 21:54:01,529 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 21:54:01,529 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 21:54:01,529 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 21:54:01,529 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 21:54:02,147 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 21:54:02,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:54:02 BoogieIcfgContainer [2018-01-28 21:54:02,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 21:54:02,149 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 21:54:02,149 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 21:54:02,153 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 21:54:02,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 09:54:01" (1/3) ... [2018-01-28 21:54:02,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ad666f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:54:02, skipping insertion in model container [2018-01-28 21:54:02,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:54:01" (2/3) ... [2018-01-28 21:54:02,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ad666f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:54:02, skipping insertion in model container [2018-01-28 21:54:02,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:54:02" (3/3) ... [2018-01-28 21:54:02,158 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-01-28 21:54:02,168 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 21:54:02,177 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 75 error locations. [2018-01-28 21:54:02,230 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 21:54:02,231 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 21:54:02,231 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 21:54:02,231 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 21:54:02,231 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 21:54:02,231 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 21:54:02,232 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 21:54:02,232 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 21:54:02,233 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 21:54:02,258 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2018-01-28 21:54:02,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-28 21:54:02,265 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:02,266 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:02,267 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-01-28 21:54:02,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1379988686, now seen corresponding path program 1 times [2018-01-28 21:54:02,274 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:02,275 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:02,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:02,336 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:02,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:02,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:02,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:02,460 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:02,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:54:02,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:54:02,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:54:02,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:54:02,566 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 4 states. [2018-01-28 21:54:02,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:02,869 INFO L93 Difference]: Finished difference Result 414 states and 442 transitions. [2018-01-28 21:54:02,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:54:02,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-28 21:54:02,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:02,881 INFO L225 Difference]: With dead ends: 414 [2018-01-28 21:54:02,881 INFO L226 Difference]: Without dead ends: 219 [2018-01-28 21:54:02,886 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:54:02,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-01-28 21:54:02,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 200. [2018-01-28 21:54:02,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-01-28 21:54:02,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 210 transitions. [2018-01-28 21:54:02,930 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 210 transitions. Word has length 10 [2018-01-28 21:54:02,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:02,930 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 210 transitions. [2018-01-28 21:54:02,930 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:54:02,930 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 210 transitions. [2018-01-28 21:54:02,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-28 21:54:02,931 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:02,931 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:02,931 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-01-28 21:54:02,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1379988685, now seen corresponding path program 1 times [2018-01-28 21:54:02,931 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:02,931 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:02,932 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:02,932 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:02,932 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:02,949 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:03,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:03,043 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:03,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:54:03,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:54:03,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:54:03,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:54:03,045 INFO L87 Difference]: Start difference. First operand 200 states and 210 transitions. Second operand 4 states. [2018-01-28 21:54:03,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:03,305 INFO L93 Difference]: Finished difference Result 200 states and 210 transitions. [2018-01-28 21:54:03,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:54:03,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-28 21:54:03,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:03,308 INFO L225 Difference]: With dead ends: 200 [2018-01-28 21:54:03,308 INFO L226 Difference]: Without dead ends: 197 [2018-01-28 21:54:03,309 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:54:03,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-01-28 21:54:03,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-01-28 21:54:03,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-01-28 21:54:03,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 207 transitions. [2018-01-28 21:54:03,323 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 207 transitions. Word has length 10 [2018-01-28 21:54:03,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:03,324 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 207 transitions. [2018-01-28 21:54:03,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:54:03,324 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 207 transitions. [2018-01-28 21:54:03,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-28 21:54:03,325 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:03,325 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:03,325 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-01-28 21:54:03,325 INFO L82 PathProgramCache]: Analyzing trace with hash -868488917, now seen corresponding path program 1 times [2018-01-28 21:54:03,325 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:03,326 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:03,327 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:03,327 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:03,327 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:03,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:03,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:03,382 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:03,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:54:03,383 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:54:03,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:54:03,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:54:03,383 INFO L87 Difference]: Start difference. First operand 197 states and 207 transitions. Second operand 4 states. [2018-01-28 21:54:03,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:03,549 INFO L93 Difference]: Finished difference Result 227 states and 238 transitions. [2018-01-28 21:54:03,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:54:03,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-28 21:54:03,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:03,551 INFO L225 Difference]: With dead ends: 227 [2018-01-28 21:54:03,551 INFO L226 Difference]: Without dead ends: 209 [2018-01-28 21:54:03,552 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:54:03,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-01-28 21:54:03,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 182. [2018-01-28 21:54:03,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-28 21:54:03,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2018-01-28 21:54:03,565 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 19 [2018-01-28 21:54:03,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:03,566 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2018-01-28 21:54:03,566 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:54:03,566 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2018-01-28 21:54:03,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-28 21:54:03,567 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:03,567 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:03,567 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-01-28 21:54:03,567 INFO L82 PathProgramCache]: Analyzing trace with hash -868488916, now seen corresponding path program 1 times [2018-01-28 21:54:03,567 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:03,568 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:03,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:03,569 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:03,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:03,586 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:03,703 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:03,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:54:03,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:54:03,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:54:03,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:54:03,704 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand 5 states. [2018-01-28 21:54:03,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:03,957 INFO L93 Difference]: Finished difference Result 280 states and 298 transitions. [2018-01-28 21:54:03,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:54:03,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-28 21:54:03,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:03,960 INFO L225 Difference]: With dead ends: 280 [2018-01-28 21:54:03,960 INFO L226 Difference]: Without dead ends: 266 [2018-01-28 21:54:03,960 INFO L533 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-01-28 21:54:03,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-01-28 21:54:03,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 240. [2018-01-28 21:54:03,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-01-28 21:54:03,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 267 transitions. [2018-01-28 21:54:03,972 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 267 transitions. Word has length 19 [2018-01-28 21:54:03,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:03,972 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 267 transitions. [2018-01-28 21:54:03,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:54:03,973 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 267 transitions. [2018-01-28 21:54:03,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-28 21:54:03,973 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:03,974 INFO L330 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-01-28 21:54:03,974 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-01-28 21:54:03,974 INFO L82 PathProgramCache]: Analyzing trace with hash 299244869, now seen corresponding path program 1 times [2018-01-28 21:54:03,974 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:03,974 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:03,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:03,976 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:03,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:03,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:04,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:04,023 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:04,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:54:04,024 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:54:04,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:54:04,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:54:04,024 INFO L87 Difference]: Start difference. First operand 240 states and 267 transitions. Second operand 4 states. [2018-01-28 21:54:04,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:04,144 INFO L93 Difference]: Finished difference Result 259 states and 286 transitions. [2018-01-28 21:54:04,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:54:04,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-28 21:54:04,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:04,146 INFO L225 Difference]: With dead ends: 259 [2018-01-28 21:54:04,146 INFO L226 Difference]: Without dead ends: 256 [2018-01-28 21:54:04,146 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:54:04,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-01-28 21:54:04,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 242. [2018-01-28 21:54:04,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-01-28 21:54:04,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 271 transitions. [2018-01-28 21:54:04,156 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 271 transitions. Word has length 21 [2018-01-28 21:54:04,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:04,157 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 271 transitions. [2018-01-28 21:54:04,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:54:04,157 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 271 transitions. [2018-01-28 21:54:04,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-28 21:54:04,158 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:04,158 INFO L330 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-01-28 21:54:04,158 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-01-28 21:54:04,158 INFO L82 PathProgramCache]: Analyzing trace with hash 299244870, now seen corresponding path program 1 times [2018-01-28 21:54:04,158 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:04,159 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:04,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:04,160 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:04,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:04,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:04,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:04,218 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:04,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:54:04,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:54:04,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:54:04,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:54:04,219 INFO L87 Difference]: Start difference. First operand 242 states and 271 transitions. Second operand 4 states. [2018-01-28 21:54:04,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:04,373 INFO L93 Difference]: Finished difference Result 247 states and 274 transitions. [2018-01-28 21:54:04,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:54:04,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-28 21:54:04,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:04,375 INFO L225 Difference]: With dead ends: 247 [2018-01-28 21:54:04,375 INFO L226 Difference]: Without dead ends: 244 [2018-01-28 21:54:04,375 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:54:04,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-01-28 21:54:04,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 240. [2018-01-28 21:54:04,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-01-28 21:54:04,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 268 transitions. [2018-01-28 21:54:04,382 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 268 transitions. Word has length 21 [2018-01-28 21:54:04,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:04,382 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 268 transitions. [2018-01-28 21:54:04,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:54:04,382 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 268 transitions. [2018-01-28 21:54:04,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-28 21:54:04,383 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:04,383 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:04,383 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-01-28 21:54:04,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1620293662, now seen corresponding path program 1 times [2018-01-28 21:54:04,384 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:04,384 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:04,385 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:04,385 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:04,385 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:04,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:04,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:04,443 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:04,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:54:04,444 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:54:04,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:54:04,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:54:04,445 INFO L87 Difference]: Start difference. First operand 240 states and 268 transitions. Second operand 4 states. [2018-01-28 21:54:04,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:04,484 INFO L93 Difference]: Finished difference Result 244 states and 271 transitions. [2018-01-28 21:54:04,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:54:04,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-28 21:54:04,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:04,485 INFO L225 Difference]: With dead ends: 244 [2018-01-28 21:54:04,485 INFO L226 Difference]: Without dead ends: 241 [2018-01-28 21:54:04,486 INFO L533 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-01-28 21:54:04,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-01-28 21:54:04,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 240. [2018-01-28 21:54:04,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-01-28 21:54:04,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 267 transitions. [2018-01-28 21:54:04,495 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 267 transitions. Word has length 26 [2018-01-28 21:54:04,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:04,496 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 267 transitions. [2018-01-28 21:54:04,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:54:04,496 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 267 transitions. [2018-01-28 21:54:04,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-28 21:54:04,497 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:04,497 INFO L330 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-01-28 21:54:04,497 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-01-28 21:54:04,498 INFO L82 PathProgramCache]: Analyzing trace with hash 961565968, now seen corresponding path program 1 times [2018-01-28 21:54:04,498 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:04,498 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:04,499 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:04,499 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:04,499 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:04,516 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:04,563 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:04,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:54:04,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:54:04,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:54:04,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:54:04,564 INFO L87 Difference]: Start difference. First operand 240 states and 267 transitions. Second operand 5 states. [2018-01-28 21:54:04,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:04,734 INFO L93 Difference]: Finished difference Result 263 states and 292 transitions. [2018-01-28 21:54:04,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:54:04,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-28 21:54:04,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:04,736 INFO L225 Difference]: With dead ends: 263 [2018-01-28 21:54:04,737 INFO L226 Difference]: Without dead ends: 259 [2018-01-28 21:54:04,737 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:54:04,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-01-28 21:54:04,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 240. [2018-01-28 21:54:04,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-01-28 21:54:04,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 268 transitions. [2018-01-28 21:54:04,748 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 268 transitions. Word has length 29 [2018-01-28 21:54:04,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:04,749 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 268 transitions. [2018-01-28 21:54:04,749 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:54:04,749 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 268 transitions. [2018-01-28 21:54:04,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-28 21:54:04,750 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:04,750 INFO L330 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-01-28 21:54:04,751 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-01-28 21:54:04,751 INFO L82 PathProgramCache]: Analyzing trace with hash 961565969, now seen corresponding path program 1 times [2018-01-28 21:54:04,751 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:04,751 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:04,752 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:04,752 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:04,752 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:04,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:04,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-01-28 21:54:04,848 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:04,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:54:04,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:54:04,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:54:04,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:54:04,849 INFO L87 Difference]: Start difference. First operand 240 states and 268 transitions. Second operand 5 states. [2018-01-28 21:54:05,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:05,071 INFO L93 Difference]: Finished difference Result 268 states and 297 transitions. [2018-01-28 21:54:05,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:54:05,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-28 21:54:05,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:05,073 INFO L225 Difference]: With dead ends: 268 [2018-01-28 21:54:05,073 INFO L226 Difference]: Without dead ends: 266 [2018-01-28 21:54:05,073 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:54:05,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-01-28 21:54:05,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 243. [2018-01-28 21:54:05,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-01-28 21:54:05,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 270 transitions. [2018-01-28 21:54:05,080 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 270 transitions. Word has length 29 [2018-01-28 21:54:05,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:05,081 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 270 transitions. [2018-01-28 21:54:05,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:54:05,081 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 270 transitions. [2018-01-28 21:54:05,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-28 21:54:05,082 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:05,083 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:05,083 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-01-28 21:54:05,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1068122348, now seen corresponding path program 1 times [2018-01-28 21:54:05,083 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:05,083 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:05,084 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:05,084 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:05,084 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:05,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:05,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:05,441 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:05,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-28 21:54:05,441 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-28 21:54:05,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-28 21:54:05,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-01-28 21:54:05,442 INFO L87 Difference]: Start difference. First operand 243 states and 270 transitions. Second operand 12 states. [2018-01-28 21:54:06,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:06,033 INFO L93 Difference]: Finished difference Result 267 states and 297 transitions. [2018-01-28 21:54:06,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-28 21:54:06,033 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-01-28 21:54:06,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:06,034 INFO L225 Difference]: With dead ends: 267 [2018-01-28 21:54:06,035 INFO L226 Difference]: Without dead ends: 266 [2018-01-28 21:54:06,035 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2018-01-28 21:54:06,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-01-28 21:54:06,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 244. [2018-01-28 21:54:06,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-01-28 21:54:06,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 272 transitions. [2018-01-28 21:54:06,044 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 272 transitions. Word has length 33 [2018-01-28 21:54:06,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:06,044 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 272 transitions. [2018-01-28 21:54:06,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-28 21:54:06,044 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 272 transitions. [2018-01-28 21:54:06,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-28 21:54:06,045 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:06,046 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:06,046 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-01-28 21:54:06,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1068122347, now seen corresponding path program 1 times [2018-01-28 21:54:06,046 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:06,046 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:06,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:06,047 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:06,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:06,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:06,372 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:06,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-28 21:54:06,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-28 21:54:06,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-28 21:54:06,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-01-28 21:54:06,373 INFO L87 Difference]: Start difference. First operand 244 states and 272 transitions. Second operand 13 states. [2018-01-28 21:54:07,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:07,169 INFO L93 Difference]: Finished difference Result 331 states and 353 transitions. [2018-01-28 21:54:07,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-28 21:54:07,188 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-01-28 21:54:07,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:07,190 INFO L225 Difference]: With dead ends: 331 [2018-01-28 21:54:07,190 INFO L226 Difference]: Without dead ends: 328 [2018-01-28 21:54:07,190 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2018-01-28 21:54:07,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-01-28 21:54:07,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 250. [2018-01-28 21:54:07,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-01-28 21:54:07,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 279 transitions. [2018-01-28 21:54:07,201 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 279 transitions. Word has length 33 [2018-01-28 21:54:07,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:07,201 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 279 transitions. [2018-01-28 21:54:07,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-28 21:54:07,201 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 279 transitions. [2018-01-28 21:54:07,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-28 21:54:07,202 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:07,203 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:07,203 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-01-28 21:54:07,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1548992989, now seen corresponding path program 1 times [2018-01-28 21:54:07,203 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:07,203 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:07,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:07,204 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:07,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:07,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:07,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:07,228 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:07,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:54:07,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 21:54:07,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 21:54:07,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:54:07,229 INFO L87 Difference]: Start difference. First operand 250 states and 279 transitions. Second operand 3 states. [2018-01-28 21:54:07,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:07,246 INFO L93 Difference]: Finished difference Result 490 states and 550 transitions. [2018-01-28 21:54:07,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 21:54:07,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-01-28 21:54:07,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:07,248 INFO L225 Difference]: With dead ends: 490 [2018-01-28 21:54:07,248 INFO L226 Difference]: Without dead ends: 252 [2018-01-28 21:54:07,249 INFO L533 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-01-28 21:54:07,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-01-28 21:54:07,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2018-01-28 21:54:07,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-01-28 21:54:07,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 281 transitions. [2018-01-28 21:54:07,262 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 281 transitions. Word has length 33 [2018-01-28 21:54:07,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:07,262 INFO L432 AbstractCegarLoop]: Abstraction has 252 states and 281 transitions. [2018-01-28 21:54:07,262 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 21:54:07,262 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 281 transitions. [2018-01-28 21:54:07,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-28 21:54:07,263 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:07,264 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:07,264 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-01-28 21:54:07,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1877154970, now seen corresponding path program 1 times [2018-01-28 21:54:07,264 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:07,264 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:07,265 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:07,265 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:07,265 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:07,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:07,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:07,377 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:07,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 21:54:07,377 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:54:07,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:54:07,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:54:07,378 INFO L87 Difference]: Start difference. First operand 252 states and 281 transitions. Second operand 6 states. [2018-01-28 21:54:08,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:08,038 INFO L93 Difference]: Finished difference Result 561 states and 626 transitions. [2018-01-28 21:54:08,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 21:54:08,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-28 21:54:08,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:08,040 INFO L225 Difference]: With dead ends: 561 [2018-01-28 21:54:08,040 INFO L226 Difference]: Without dead ends: 321 [2018-01-28 21:54:08,041 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:54:08,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-01-28 21:54:08,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 283. [2018-01-28 21:54:08,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-01-28 21:54:08,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 317 transitions. [2018-01-28 21:54:08,048 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 317 transitions. Word has length 35 [2018-01-28 21:54:08,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:08,048 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 317 transitions. [2018-01-28 21:54:08,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:54:08,048 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 317 transitions. [2018-01-28 21:54:08,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-28 21:54:08,049 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:08,049 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:08,049 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-01-28 21:54:08,049 INFO L82 PathProgramCache]: Analyzing trace with hash 105993709, now seen corresponding path program 1 times [2018-01-28 21:54:08,049 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:08,049 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:08,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:08,050 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:08,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:08,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:08,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:08,071 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:08,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:54:08,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 21:54:08,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 21:54:08,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:54:08,072 INFO L87 Difference]: Start difference. First operand 283 states and 317 transitions. Second operand 3 states. [2018-01-28 21:54:08,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:08,121 INFO L93 Difference]: Finished difference Result 526 states and 592 transitions. [2018-01-28 21:54:08,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 21:54:08,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-01-28 21:54:08,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:08,122 INFO L225 Difference]: With dead ends: 526 [2018-01-28 21:54:08,122 INFO L226 Difference]: Without dead ends: 286 [2018-01-28 21:54:08,123 INFO L533 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-01-28 21:54:08,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-01-28 21:54:08,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2018-01-28 21:54:08,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-01-28 21:54:08,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 320 transitions. [2018-01-28 21:54:08,130 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 320 transitions. Word has length 36 [2018-01-28 21:54:08,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:08,130 INFO L432 AbstractCegarLoop]: Abstraction has 286 states and 320 transitions. [2018-01-28 21:54:08,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 21:54:08,131 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 320 transitions. [2018-01-28 21:54:08,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 21:54:08,131 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:08,132 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:08,132 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-01-28 21:54:08,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1200880112, now seen corresponding path program 1 times [2018-01-28 21:54:08,132 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:08,132 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:08,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:08,133 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:08,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:08,144 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:08,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:08,171 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:08,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:54:08,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:54:08,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:54:08,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:54:08,172 INFO L87 Difference]: Start difference. First operand 286 states and 320 transitions. Second operand 4 states. [2018-01-28 21:54:08,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:08,501 INFO L93 Difference]: Finished difference Result 306 states and 341 transitions. [2018-01-28 21:54:08,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:54:08,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-01-28 21:54:08,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:08,505 INFO L225 Difference]: With dead ends: 306 [2018-01-28 21:54:08,505 INFO L226 Difference]: Without dead ends: 305 [2018-01-28 21:54:08,505 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:54:08,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-01-28 21:54:08,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 285. [2018-01-28 21:54:08,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-01-28 21:54:08,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 319 transitions. [2018-01-28 21:54:08,514 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 319 transitions. Word has length 38 [2018-01-28 21:54:08,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:08,514 INFO L432 AbstractCegarLoop]: Abstraction has 285 states and 319 transitions. [2018-01-28 21:54:08,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:54:08,514 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 319 transitions. [2018-01-28 21:54:08,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 21:54:08,515 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:08,515 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:08,515 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-01-28 21:54:08,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1200880113, now seen corresponding path program 1 times [2018-01-28 21:54:08,515 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:08,515 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:08,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:08,516 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:08,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:08,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:08,649 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:08,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:54:08,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:54:08,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:54:08,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:54:08,650 INFO L87 Difference]: Start difference. First operand 285 states and 319 transitions. Second operand 4 states. [2018-01-28 21:54:08,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:08,952 INFO L93 Difference]: Finished difference Result 343 states and 380 transitions. [2018-01-28 21:54:08,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:54:08,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-01-28 21:54:08,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:08,954 INFO L225 Difference]: With dead ends: 343 [2018-01-28 21:54:08,954 INFO L226 Difference]: Without dead ends: 341 [2018-01-28 21:54:08,954 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:54:08,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-01-28 21:54:08,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 283. [2018-01-28 21:54:08,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-01-28 21:54:08,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 317 transitions. [2018-01-28 21:54:08,966 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 317 transitions. Word has length 38 [2018-01-28 21:54:08,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:08,967 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 317 transitions. [2018-01-28 21:54:08,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:54:08,967 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 317 transitions. [2018-01-28 21:54:08,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 21:54:08,967 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:08,967 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:08,968 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-01-28 21:54:08,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1791562698, now seen corresponding path program 1 times [2018-01-28 21:54:08,968 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:08,968 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:08,969 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:08,969 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:08,969 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:08,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:09,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:09,008 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:09,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:54:09,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:54:09,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:54:09,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:54:09,009 INFO L87 Difference]: Start difference. First operand 283 states and 317 transitions. Second operand 5 states. [2018-01-28 21:54:09,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:09,332 INFO L93 Difference]: Finished difference Result 435 states and 488 transitions. [2018-01-28 21:54:09,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:54:09,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-01-28 21:54:09,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:09,334 INFO L225 Difference]: With dead ends: 435 [2018-01-28 21:54:09,335 INFO L226 Difference]: Without dead ends: 434 [2018-01-28 21:54:09,335 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:54:09,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-01-28 21:54:09,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 282. [2018-01-28 21:54:09,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-01-28 21:54:09,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 315 transitions. [2018-01-28 21:54:09,346 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 315 transitions. Word has length 38 [2018-01-28 21:54:09,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:09,347 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 315 transitions. [2018-01-28 21:54:09,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:54:09,347 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 315 transitions. [2018-01-28 21:54:09,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 21:54:09,348 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:09,348 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:09,348 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-01-28 21:54:09,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1791562699, now seen corresponding path program 1 times [2018-01-28 21:54:09,348 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:09,348 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:09,349 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:09,349 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:09,349 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:09,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:09,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:09,456 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:09,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:54:09,457 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:54:09,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:54:09,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:54:09,457 INFO L87 Difference]: Start difference. First operand 282 states and 315 transitions. Second operand 5 states. [2018-01-28 21:54:09,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:09,749 INFO L93 Difference]: Finished difference Result 420 states and 472 transitions. [2018-01-28 21:54:09,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:54:09,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-01-28 21:54:09,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:09,750 INFO L225 Difference]: With dead ends: 420 [2018-01-28 21:54:09,751 INFO L226 Difference]: Without dead ends: 419 [2018-01-28 21:54:09,751 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:54:09,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-01-28 21:54:09,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 281. [2018-01-28 21:54:09,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-01-28 21:54:09,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 313 transitions. [2018-01-28 21:54:09,762 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 313 transitions. Word has length 38 [2018-01-28 21:54:09,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:09,762 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 313 transitions. [2018-01-28 21:54:09,762 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:54:09,762 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 313 transitions. [2018-01-28 21:54:09,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-28 21:54:09,763 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:09,763 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:09,763 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-01-28 21:54:09,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1427421990, now seen corresponding path program 1 times [2018-01-28 21:54:09,763 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:09,764 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:09,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:09,764 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:09,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:09,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:09,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:09,831 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:09,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:54:09,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:54:09,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:54:09,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:54:09,832 INFO L87 Difference]: Start difference. First operand 281 states and 313 transitions. Second operand 5 states. [2018-01-28 21:54:10,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:10,060 INFO L93 Difference]: Finished difference Result 321 states and 355 transitions. [2018-01-28 21:54:10,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:54:10,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-01-28 21:54:10,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:10,062 INFO L225 Difference]: With dead ends: 321 [2018-01-28 21:54:10,062 INFO L226 Difference]: Without dead ends: 314 [2018-01-28 21:54:10,063 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:54:10,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-01-28 21:54:10,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 272. [2018-01-28 21:54:10,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-01-28 21:54:10,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 304 transitions. [2018-01-28 21:54:10,073 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 304 transitions. Word has length 39 [2018-01-28 21:54:10,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:10,073 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 304 transitions. [2018-01-28 21:54:10,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:54:10,074 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 304 transitions. [2018-01-28 21:54:10,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-28 21:54:10,074 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:10,074 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:10,075 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-01-28 21:54:10,075 INFO L82 PathProgramCache]: Analyzing trace with hash -2015874180, now seen corresponding path program 1 times [2018-01-28 21:54:10,075 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:10,075 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:10,076 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:10,076 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:10,076 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:10,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:10,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:10,132 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:10,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:54:10,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:54:10,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:54:10,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:54:10,133 INFO L87 Difference]: Start difference. First operand 272 states and 304 transitions. Second operand 4 states. [2018-01-28 21:54:10,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:10,245 INFO L93 Difference]: Finished difference Result 283 states and 316 transitions. [2018-01-28 21:54:10,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:54:10,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-01-28 21:54:10,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:10,248 INFO L225 Difference]: With dead ends: 283 [2018-01-28 21:54:10,248 INFO L226 Difference]: Without dead ends: 282 [2018-01-28 21:54:10,248 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:54:10,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-01-28 21:54:10,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 271. [2018-01-28 21:54:10,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-01-28 21:54:10,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 303 transitions. [2018-01-28 21:54:10,257 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 303 transitions. Word has length 41 [2018-01-28 21:54:10,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:10,258 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 303 transitions. [2018-01-28 21:54:10,258 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:54:10,258 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 303 transitions. [2018-01-28 21:54:10,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-28 21:54:10,259 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:10,259 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:10,259 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-01-28 21:54:10,259 INFO L82 PathProgramCache]: Analyzing trace with hash -2015874179, now seen corresponding path program 1 times [2018-01-28 21:54:10,259 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:10,259 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:10,260 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:10,260 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:10,260 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:10,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:10,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:10,309 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:10,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:54:10,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:54:10,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:54:10,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:54:10,310 INFO L87 Difference]: Start difference. First operand 271 states and 303 transitions. Second operand 4 states. [2018-01-28 21:54:10,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:10,497 INFO L93 Difference]: Finished difference Result 318 states and 352 transitions. [2018-01-28 21:54:10,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:54:10,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-01-28 21:54:10,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:10,499 INFO L225 Difference]: With dead ends: 318 [2018-01-28 21:54:10,499 INFO L226 Difference]: Without dead ends: 316 [2018-01-28 21:54:10,499 INFO L533 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-01-28 21:54:10,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-01-28 21:54:10,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 269. [2018-01-28 21:54:10,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-01-28 21:54:10,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 301 transitions. [2018-01-28 21:54:10,509 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 301 transitions. Word has length 41 [2018-01-28 21:54:10,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:10,510 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 301 transitions. [2018-01-28 21:54:10,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:54:10,510 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 301 transitions. [2018-01-28 21:54:10,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-28 21:54:10,510 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:10,511 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:10,511 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-01-28 21:54:10,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1114169813, now seen corresponding path program 1 times [2018-01-28 21:54:10,511 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:10,511 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:10,512 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:10,512 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:10,512 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:10,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:10,633 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:10,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:54:10,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 21:54:10,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 21:54:10,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:54:10,634 INFO L87 Difference]: Start difference. First operand 269 states and 301 transitions. Second operand 9 states. [2018-01-28 21:54:10,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:10,940 INFO L93 Difference]: Finished difference Result 335 states and 377 transitions. [2018-01-28 21:54:10,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:54:10,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-01-28 21:54:10,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:10,941 INFO L225 Difference]: With dead ends: 335 [2018-01-28 21:54:10,941 INFO L226 Difference]: Without dead ends: 334 [2018-01-28 21:54:10,942 INFO L533 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-01-28 21:54:10,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-01-28 21:54:10,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 268. [2018-01-28 21:54:10,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-01-28 21:54:10,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 299 transitions. [2018-01-28 21:54:10,948 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 299 transitions. Word has length 41 [2018-01-28 21:54:10,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:10,948 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 299 transitions. [2018-01-28 21:54:10,948 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 21:54:10,948 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 299 transitions. [2018-01-28 21:54:10,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-28 21:54:10,949 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:10,949 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:10,949 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-01-28 21:54:10,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1114169812, now seen corresponding path program 1 times [2018-01-28 21:54:10,949 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:10,949 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:10,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:10,950 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:10,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:10,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:11,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:11,112 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:11,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:54:11,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 21:54:11,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 21:54:11,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:54:11,113 INFO L87 Difference]: Start difference. First operand 268 states and 299 transitions. Second operand 9 states. [2018-01-28 21:54:11,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:11,529 INFO L93 Difference]: Finished difference Result 334 states and 375 transitions. [2018-01-28 21:54:11,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:54:11,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-01-28 21:54:11,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:11,530 INFO L225 Difference]: With dead ends: 334 [2018-01-28 21:54:11,530 INFO L226 Difference]: Without dead ends: 333 [2018-01-28 21:54:11,530 INFO L533 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-01-28 21:54:11,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-01-28 21:54:11,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 267. [2018-01-28 21:54:11,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-01-28 21:54:11,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 297 transitions. [2018-01-28 21:54:11,540 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 297 transitions. Word has length 41 [2018-01-28 21:54:11,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:11,540 INFO L432 AbstractCegarLoop]: Abstraction has 267 states and 297 transitions. [2018-01-28 21:54:11,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 21:54:11,541 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 297 transitions. [2018-01-28 21:54:11,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-28 21:54:11,541 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:11,542 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:11,542 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-01-28 21:54:11,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1932410086, now seen corresponding path program 1 times [2018-01-28 21:54:11,542 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:11,542 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:11,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:11,543 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:11,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:11,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:11,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:11,645 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:11,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:54:11,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:54:11,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:54:11,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:54:11,646 INFO L87 Difference]: Start difference. First operand 267 states and 297 transitions. Second operand 6 states. [2018-01-28 21:54:11,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:11,906 INFO L93 Difference]: Finished difference Result 350 states and 387 transitions. [2018-01-28 21:54:11,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 21:54:11,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-01-28 21:54:11,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:11,907 INFO L225 Difference]: With dead ends: 350 [2018-01-28 21:54:11,907 INFO L226 Difference]: Without dead ends: 343 [2018-01-28 21:54:11,907 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:54:11,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-01-28 21:54:11,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 235. [2018-01-28 21:54:11,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-01-28 21:54:11,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 257 transitions. [2018-01-28 21:54:11,916 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 257 transitions. Word has length 42 [2018-01-28 21:54:11,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:11,916 INFO L432 AbstractCegarLoop]: Abstraction has 235 states and 257 transitions. [2018-01-28 21:54:11,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:54:11,916 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 257 transitions. [2018-01-28 21:54:11,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-28 21:54:11,917 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:11,917 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:11,917 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-01-28 21:54:11,918 INFO L82 PathProgramCache]: Analyzing trace with hash 133893922, now seen corresponding path program 1 times [2018-01-28 21:54:11,918 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:11,918 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:11,919 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:11,919 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:11,919 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:11,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:12,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:12,480 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:12,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-28 21:54:12,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-28 21:54:12,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-28 21:54:12,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-01-28 21:54:12,500 INFO L87 Difference]: Start difference. First operand 235 states and 257 transitions. Second operand 15 states. [2018-01-28 21:54:13,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:13,851 INFO L93 Difference]: Finished difference Result 427 states and 461 transitions. [2018-01-28 21:54:13,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-28 21:54:13,851 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2018-01-28 21:54:13,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:13,852 INFO L225 Difference]: With dead ends: 427 [2018-01-28 21:54:13,852 INFO L226 Difference]: Without dead ends: 425 [2018-01-28 21:54:13,853 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=190, Invalid=1000, Unknown=0, NotChecked=0, Total=1190 [2018-01-28 21:54:13,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-01-28 21:54:13,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 251. [2018-01-28 21:54:13,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-01-28 21:54:13,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 273 transitions. [2018-01-28 21:54:13,862 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 273 transitions. Word has length 43 [2018-01-28 21:54:13,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:13,863 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 273 transitions. [2018-01-28 21:54:13,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-28 21:54:13,863 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 273 transitions. [2018-01-28 21:54:13,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-28 21:54:13,864 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:13,864 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:13,864 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-01-28 21:54:13,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1562467601, now seen corresponding path program 1 times [2018-01-28 21:54:13,864 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:13,865 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:13,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:13,865 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:13,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:13,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:14,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:14,914 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:54:14,914 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:54:14,920 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:14,969 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:54:15,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-28 21:54:15,278 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 10 treesize of output 9 [2018-01-28 21:54:15,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:54:15,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:54:15,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:54:15,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:57 [2018-01-28 21:54:15,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2018-01-28 21:54:15,526 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2018-01-28 21:54:15,529 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 21:54:15,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 21:54:15,570 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 2 xjuncts. [2018-01-28 21:54:15,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:72 [2018-01-28 21:54:15,929 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~n~4.base Int) (main_~st~4.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~n~4.base 1))) (and (= 0 (select .cse0 main_~st~4.base)) (not (= 0 main_~n~4.base)) (= |c_#valid| (store (store .cse0 main_~st~4.base 0) main_~n~4.base 0)) (not (= main_~st~4.base 0)) (= 0 (select |c_old(#valid)| main_~n~4.base))))) is different from true [2018-01-28 21:54:15,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-28 21:54:15,968 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:54:15,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-01-28 21:54:15,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-28 21:54:15,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-28 21:54:15,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=4, NotChecked=46, Total=650 [2018-01-28 21:54:15,972 INFO L87 Difference]: Start difference. First operand 251 states and 273 transitions. Second operand 26 states. [2018-01-28 21:54:16,743 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 64 DAG size of output 27 [2018-01-28 21:54:17,155 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 132 DAG size of output 48 [2018-01-28 21:54:17,691 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 142 DAG size of output 46 [2018-01-28 21:54:19,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:19,667 INFO L93 Difference]: Finished difference Result 312 states and 337 transitions. [2018-01-28 21:54:19,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-28 21:54:19,667 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 43 [2018-01-28 21:54:19,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:19,668 INFO L225 Difference]: With dead ends: 312 [2018-01-28 21:54:19,669 INFO L226 Difference]: Without dead ends: 309 [2018-01-28 21:54:19,669 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=215, Invalid=1495, Unknown=16, NotChecked=80, Total=1806 [2018-01-28 21:54:19,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-01-28 21:54:19,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 277. [2018-01-28 21:54:19,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-01-28 21:54:19,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 301 transitions. [2018-01-28 21:54:19,687 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 301 transitions. Word has length 43 [2018-01-28 21:54:19,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:19,687 INFO L432 AbstractCegarLoop]: Abstraction has 277 states and 301 transitions. [2018-01-28 21:54:19,687 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-28 21:54:19,687 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 301 transitions. [2018-01-28 21:54:19,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-28 21:54:19,688 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:19,688 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:19,688 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-01-28 21:54:19,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1562467348, now seen corresponding path program 1 times [2018-01-28 21:54:19,689 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:19,689 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:19,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:19,690 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:19,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:19,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:19,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:19,791 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:54:19,791 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:54:19,802 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:19,831 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:54:19,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 21:54:19,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 21:54:19,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:54:19,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:54:19,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 21:54:19,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 21:54:19,879 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:54:19,881 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:54:19,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:54:19,885 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-01-28 21:54:19,905 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 26 treesize of output 21 [2018-01-28 21:54:19,922 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:54:19,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-28 21:54:19,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:54:19,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:54:19,951 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 26 treesize of output 21 [2018-01-28 21:54:19,961 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:54:19,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-28 21:54:19,963 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:54:19,969 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:54:19,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:54:19,988 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2018-01-28 21:54:20,012 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-01-28 21:54:20,019 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-01-28 21:54:20,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:54:20,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:54:20,029 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-01-28 21:54:20,041 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-01-28 21:54:20,041 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:54:20,042 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:54:20,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:54:20,046 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:39, output treesize:7 [2018-01-28 21:54:20,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:20,082 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:54:20,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-28 21:54:20,083 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:54:20,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:54:20,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:54:20,083 INFO L87 Difference]: Start difference. First operand 277 states and 301 transitions. Second operand 5 states. [2018-01-28 21:54:20,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:20,307 INFO L93 Difference]: Finished difference Result 336 states and 364 transitions. [2018-01-28 21:54:20,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:54:20,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-01-28 21:54:20,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:20,309 INFO L225 Difference]: With dead ends: 336 [2018-01-28 21:54:20,309 INFO L226 Difference]: Without dead ends: 287 [2018-01-28 21:54:20,310 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:54:20,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-01-28 21:54:20,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 279. [2018-01-28 21:54:20,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-01-28 21:54:20,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 303 transitions. [2018-01-28 21:54:20,319 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 303 transitions. Word has length 43 [2018-01-28 21:54:20,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:20,319 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 303 transitions. [2018-01-28 21:54:20,319 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:54:20,319 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 303 transitions. [2018-01-28 21:54:20,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-28 21:54:20,319 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:20,320 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:20,320 INFO L371 AbstractCegarLoop]: === Iteration 28 === [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-01-28 21:54:20,320 INFO L82 PathProgramCache]: Analyzing trace with hash -934699668, now seen corresponding path program 1 times [2018-01-28 21:54:20,320 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:20,320 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:20,320 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:20,321 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:20,321 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:20,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:20,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:20,339 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:20,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:54:20,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 21:54:20,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 21:54:20,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:54:20,340 INFO L87 Difference]: Start difference. First operand 279 states and 303 transitions. Second operand 3 states. [2018-01-28 21:54:20,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:20,399 INFO L93 Difference]: Finished difference Result 494 states and 538 transitions. [2018-01-28 21:54:20,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 21:54:20,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-01-28 21:54:20,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:20,400 INFO L225 Difference]: With dead ends: 494 [2018-01-28 21:54:20,401 INFO L226 Difference]: Without dead ends: 281 [2018-01-28 21:54:20,401 INFO L533 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-01-28 21:54:20,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-01-28 21:54:20,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-01-28 21:54:20,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-01-28 21:54:20,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 305 transitions. [2018-01-28 21:54:20,408 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 305 transitions. Word has length 43 [2018-01-28 21:54:20,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:20,409 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 305 transitions. [2018-01-28 21:54:20,409 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 21:54:20,409 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 305 transitions. [2018-01-28 21:54:20,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-28 21:54:20,409 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:20,409 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:20,409 INFO L371 AbstractCegarLoop]: === Iteration 29 === [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-01-28 21:54:20,409 INFO L82 PathProgramCache]: Analyzing trace with hash -725547183, now seen corresponding path program 1 times [2018-01-28 21:54:20,409 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:20,409 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:20,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:20,410 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:20,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:20,420 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:20,664 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 27 DAG size of output 22 [2018-01-28 21:54:20,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:20,794 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:20,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 21:54:20,794 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 21:54:20,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 21:54:20,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:54:20,795 INFO L87 Difference]: Start difference. First operand 281 states and 305 transitions. Second operand 10 states. [2018-01-28 21:54:21,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:21,174 INFO L93 Difference]: Finished difference Result 334 states and 363 transitions. [2018-01-28 21:54:21,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-28 21:54:21,175 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-01-28 21:54:21,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:21,176 INFO L225 Difference]: With dead ends: 334 [2018-01-28 21:54:21,177 INFO L226 Difference]: Without dead ends: 333 [2018-01-28 21:54:21,177 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-01-28 21:54:21,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-01-28 21:54:21,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 280. [2018-01-28 21:54:21,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-01-28 21:54:21,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 303 transitions. [2018-01-28 21:54:21,192 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 303 transitions. Word has length 44 [2018-01-28 21:54:21,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:21,192 INFO L432 AbstractCegarLoop]: Abstraction has 280 states and 303 transitions. [2018-01-28 21:54:21,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 21:54:21,192 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 303 transitions. [2018-01-28 21:54:21,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-28 21:54:21,193 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:21,193 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:21,193 INFO L371 AbstractCegarLoop]: === Iteration 30 === [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-01-28 21:54:21,193 INFO L82 PathProgramCache]: Analyzing trace with hash -725547182, now seen corresponding path program 1 times [2018-01-28 21:54:21,193 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:21,194 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:21,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:21,194 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:21,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:21,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:21,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:21,413 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:21,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 21:54:21,413 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 21:54:21,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 21:54:21,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:54:21,414 INFO L87 Difference]: Start difference. First operand 280 states and 303 transitions. Second operand 10 states. [2018-01-28 21:54:21,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:21,779 INFO L93 Difference]: Finished difference Result 326 states and 353 transitions. [2018-01-28 21:54:21,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 21:54:21,780 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-01-28 21:54:21,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:21,781 INFO L225 Difference]: With dead ends: 326 [2018-01-28 21:54:21,781 INFO L226 Difference]: Without dead ends: 325 [2018-01-28 21:54:21,781 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2018-01-28 21:54:21,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-01-28 21:54:21,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 279. [2018-01-28 21:54:21,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-01-28 21:54:21,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 301 transitions. [2018-01-28 21:54:21,789 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 301 transitions. Word has length 44 [2018-01-28 21:54:21,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:21,790 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 301 transitions. [2018-01-28 21:54:21,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 21:54:21,790 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 301 transitions. [2018-01-28 21:54:21,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-28 21:54:21,790 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:21,790 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:21,790 INFO L371 AbstractCegarLoop]: === Iteration 31 === [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-01-28 21:54:21,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1882359319, now seen corresponding path program 1 times [2018-01-28 21:54:21,791 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:21,791 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:21,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:21,791 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:21,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:21,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:21,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:21,953 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:21,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 21:54:21,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 21:54:21,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 21:54:21,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:54:21,954 INFO L87 Difference]: Start difference. First operand 279 states and 301 transitions. Second operand 7 states. [2018-01-28 21:54:22,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:22,182 INFO L93 Difference]: Finished difference Result 606 states and 656 transitions. [2018-01-28 21:54:22,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 21:54:22,182 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-01-28 21:54:22,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:22,184 INFO L225 Difference]: With dead ends: 606 [2018-01-28 21:54:22,184 INFO L226 Difference]: Without dead ends: 339 [2018-01-28 21:54:22,185 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-01-28 21:54:22,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-01-28 21:54:22,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 283. [2018-01-28 21:54:22,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-01-28 21:54:22,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 303 transitions. [2018-01-28 21:54:22,197 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 303 transitions. Word has length 45 [2018-01-28 21:54:22,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:22,197 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 303 transitions. [2018-01-28 21:54:22,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 21:54:22,197 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 303 transitions. [2018-01-28 21:54:22,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-28 21:54:22,198 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:22,198 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:22,198 INFO L371 AbstractCegarLoop]: === Iteration 32 === [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-01-28 21:54:22,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1562444972, now seen corresponding path program 1 times [2018-01-28 21:54:22,198 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:22,199 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:22,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:22,199 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:22,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:22,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:22,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:22,270 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:22,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:54:22,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:54:22,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:54:22,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:54:22,271 INFO L87 Difference]: Start difference. First operand 283 states and 303 transitions. Second operand 5 states. [2018-01-28 21:54:22,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:22,564 INFO L93 Difference]: Finished difference Result 396 states and 426 transitions. [2018-01-28 21:54:22,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:54:22,564 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-01-28 21:54:22,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:22,566 INFO L225 Difference]: With dead ends: 396 [2018-01-28 21:54:22,566 INFO L226 Difference]: Without dead ends: 395 [2018-01-28 21:54:22,567 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:54:22,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-01-28 21:54:22,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 282. [2018-01-28 21:54:22,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-01-28 21:54:22,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 302 transitions. [2018-01-28 21:54:22,581 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 302 transitions. Word has length 47 [2018-01-28 21:54:22,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:22,582 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 302 transitions. [2018-01-28 21:54:22,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:54:22,582 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 302 transitions. [2018-01-28 21:54:22,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-28 21:54:22,582 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:22,583 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:22,583 INFO L371 AbstractCegarLoop]: === Iteration 33 === [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-01-28 21:54:22,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1562444971, now seen corresponding path program 1 times [2018-01-28 21:54:22,583 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:22,583 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:22,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:22,585 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:22,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:22,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:22,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-01-28 21:54:22,679 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:22,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:54:22,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:54:22,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:54:22,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:54:22,680 INFO L87 Difference]: Start difference. First operand 282 states and 302 transitions. Second operand 5 states. [2018-01-28 21:54:22,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:22,858 INFO L93 Difference]: Finished difference Result 409 states and 439 transitions. [2018-01-28 21:54:22,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:54:22,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-01-28 21:54:22,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:22,859 INFO L225 Difference]: With dead ends: 409 [2018-01-28 21:54:22,859 INFO L226 Difference]: Without dead ends: 408 [2018-01-28 21:54:22,859 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:54:22,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-01-28 21:54:22,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 281. [2018-01-28 21:54:22,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-01-28 21:54:22,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 301 transitions. [2018-01-28 21:54:22,867 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 301 transitions. Word has length 47 [2018-01-28 21:54:22,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:22,868 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 301 transitions. [2018-01-28 21:54:22,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:54:22,868 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 301 transitions. [2018-01-28 21:54:22,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-28 21:54:22,869 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:22,869 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:22,869 INFO L371 AbstractCegarLoop]: === Iteration 34 === [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-01-28 21:54:22,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1508072976, now seen corresponding path program 1 times [2018-01-28 21:54:22,869 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:22,870 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:22,870 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:22,870 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:22,870 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:22,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:22,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:22,951 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:22,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:54:22,952 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:54:22,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:54:22,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:54:22,952 INFO L87 Difference]: Start difference. First operand 281 states and 301 transitions. Second operand 5 states. [2018-01-28 21:54:23,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:23,045 INFO L93 Difference]: Finished difference Result 385 states and 410 transitions. [2018-01-28 21:54:23,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:54:23,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-01-28 21:54:23,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:23,047 INFO L225 Difference]: With dead ends: 385 [2018-01-28 21:54:23,047 INFO L226 Difference]: Without dead ends: 382 [2018-01-28 21:54:23,048 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:54:23,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-01-28 21:54:23,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 288. [2018-01-28 21:54:23,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-01-28 21:54:23,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 311 transitions. [2018-01-28 21:54:23,061 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 311 transitions. Word has length 50 [2018-01-28 21:54:23,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:23,061 INFO L432 AbstractCegarLoop]: Abstraction has 288 states and 311 transitions. [2018-01-28 21:54:23,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:54:23,061 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 311 transitions. [2018-01-28 21:54:23,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-28 21:54:23,062 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:23,062 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:23,062 INFO L371 AbstractCegarLoop]: === Iteration 35 === [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-01-28 21:54:23,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1508073229, now seen corresponding path program 1 times [2018-01-28 21:54:23,063 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:23,063 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:23,063 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:23,063 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:23,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:23,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:23,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:23,166 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:23,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:54:23,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:54:23,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:54:23,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:54:23,166 INFO L87 Difference]: Start difference. First operand 288 states and 311 transitions. Second operand 5 states. [2018-01-28 21:54:23,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:23,314 INFO L93 Difference]: Finished difference Result 382 states and 407 transitions. [2018-01-28 21:54:23,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:54:23,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-01-28 21:54:23,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:23,315 INFO L225 Difference]: With dead ends: 382 [2018-01-28 21:54:23,315 INFO L226 Difference]: Without dead ends: 379 [2018-01-28 21:54:23,315 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:54:23,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-01-28 21:54:23,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 296. [2018-01-28 21:54:23,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-01-28 21:54:23,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 321 transitions. [2018-01-28 21:54:23,323 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 321 transitions. Word has length 50 [2018-01-28 21:54:23,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:23,324 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 321 transitions. [2018-01-28 21:54:23,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:54:23,324 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 321 transitions. [2018-01-28 21:54:23,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-28 21:54:23,324 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:23,324 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:23,324 INFO L371 AbstractCegarLoop]: === Iteration 36 === [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-01-28 21:54:23,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1508073230, now seen corresponding path program 1 times [2018-01-28 21:54:23,325 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:23,325 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:23,325 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:23,325 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:23,325 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:23,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:23,523 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:23,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 21:54:23,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 21:54:23,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 21:54:23,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:54:23,524 INFO L87 Difference]: Start difference. First operand 296 states and 321 transitions. Second operand 7 states. [2018-01-28 21:54:23,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:23,813 INFO L93 Difference]: Finished difference Result 341 states and 363 transitions. [2018-01-28 21:54:23,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-28 21:54:23,813 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-01-28 21:54:23,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:23,815 INFO L225 Difference]: With dead ends: 341 [2018-01-28 21:54:23,815 INFO L226 Difference]: Without dead ends: 339 [2018-01-28 21:54:23,815 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-01-28 21:54:23,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-01-28 21:54:23,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 296. [2018-01-28 21:54:23,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-01-28 21:54:23,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 319 transitions. [2018-01-28 21:54:23,830 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 319 transitions. Word has length 50 [2018-01-28 21:54:23,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:23,830 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 319 transitions. [2018-01-28 21:54:23,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 21:54:23,830 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 319 transitions. [2018-01-28 21:54:23,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-28 21:54:23,831 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:23,831 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:23,831 INFO L371 AbstractCegarLoop]: === Iteration 37 === [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-01-28 21:54:23,832 INFO L82 PathProgramCache]: Analyzing trace with hash -369882350, now seen corresponding path program 1 times [2018-01-28 21:54:23,832 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:23,832 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:23,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:23,833 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:23,833 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:23,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:23,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:23,880 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:23,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:54:23,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:54:23,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:54:23,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:54:23,881 INFO L87 Difference]: Start difference. First operand 296 states and 319 transitions. Second operand 5 states. [2018-01-28 21:54:24,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:24,007 INFO L93 Difference]: Finished difference Result 392 states and 422 transitions. [2018-01-28 21:54:24,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:54:24,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-01-28 21:54:24,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:24,035 INFO L225 Difference]: With dead ends: 392 [2018-01-28 21:54:24,035 INFO L226 Difference]: Without dead ends: 389 [2018-01-28 21:54:24,035 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:54:24,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-01-28 21:54:24,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 299. [2018-01-28 21:54:24,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-01-28 21:54:24,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 323 transitions. [2018-01-28 21:54:24,049 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 323 transitions. Word has length 50 [2018-01-28 21:54:24,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:24,049 INFO L432 AbstractCegarLoop]: Abstraction has 299 states and 323 transitions. [2018-01-28 21:54:24,049 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:54:24,049 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 323 transitions. [2018-01-28 21:54:24,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-28 21:54:24,050 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:24,050 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:24,050 INFO L371 AbstractCegarLoop]: === Iteration 38 === [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-01-28 21:54:24,050 INFO L82 PathProgramCache]: Analyzing trace with hash -369882603, now seen corresponding path program 1 times [2018-01-28 21:54:24,051 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:24,051 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:24,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:24,051 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:24,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:24,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:24,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:24,154 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:24,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:54:24,154 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:54:24,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:54:24,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:54:24,154 INFO L87 Difference]: Start difference. First operand 299 states and 323 transitions. Second operand 5 states. [2018-01-28 21:54:24,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:24,331 INFO L93 Difference]: Finished difference Result 389 states and 419 transitions. [2018-01-28 21:54:24,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:54:24,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-01-28 21:54:24,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:24,333 INFO L225 Difference]: With dead ends: 389 [2018-01-28 21:54:24,333 INFO L226 Difference]: Without dead ends: 386 [2018-01-28 21:54:24,333 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:54:24,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-01-28 21:54:24,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 304. [2018-01-28 21:54:24,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-01-28 21:54:24,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 330 transitions. [2018-01-28 21:54:24,344 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 330 transitions. Word has length 50 [2018-01-28 21:54:24,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:24,345 INFO L432 AbstractCegarLoop]: Abstraction has 304 states and 330 transitions. [2018-01-28 21:54:24,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:54:24,345 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 330 transitions. [2018-01-28 21:54:24,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-28 21:54:24,345 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:24,346 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:24,346 INFO L371 AbstractCegarLoop]: === Iteration 39 === [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-01-28 21:54:24,346 INFO L82 PathProgramCache]: Analyzing trace with hash -369882604, now seen corresponding path program 1 times [2018-01-28 21:54:24,346 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:24,346 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:24,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:24,347 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:24,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:24,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:24,413 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:24,413 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:24,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 21:54:24,414 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 21:54:24,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 21:54:24,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:54:24,414 INFO L87 Difference]: Start difference. First operand 304 states and 330 transitions. Second operand 7 states. [2018-01-28 21:54:24,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:24,613 INFO L93 Difference]: Finished difference Result 315 states and 339 transitions. [2018-01-28 21:54:24,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 21:54:24,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-01-28 21:54:24,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:24,615 INFO L225 Difference]: With dead ends: 315 [2018-01-28 21:54:24,615 INFO L226 Difference]: Without dead ends: 313 [2018-01-28 21:54:24,615 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-01-28 21:54:24,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-01-28 21:54:24,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 295. [2018-01-28 21:54:24,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-01-28 21:54:24,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 318 transitions. [2018-01-28 21:54:24,623 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 318 transitions. Word has length 50 [2018-01-28 21:54:24,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:24,623 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 318 transitions. [2018-01-28 21:54:24,623 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 21:54:24,623 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 318 transitions. [2018-01-28 21:54:24,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-28 21:54:24,623 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:24,623 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:24,623 INFO L371 AbstractCegarLoop]: === Iteration 40 === [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-01-28 21:54:24,624 INFO L82 PathProgramCache]: Analyzing trace with hash -2057292869, now seen corresponding path program 1 times [2018-01-28 21:54:24,624 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:24,624 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:24,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:24,624 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:24,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:24,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:24,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:24,772 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:24,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:54:24,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 21:54:24,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 21:54:24,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:54:24,773 INFO L87 Difference]: Start difference. First operand 295 states and 318 transitions. Second operand 9 states. [2018-01-28 21:54:25,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:25,003 INFO L93 Difference]: Finished difference Result 309 states and 334 transitions. [2018-01-28 21:54:25,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:54:25,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-01-28 21:54:25,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:25,004 INFO L225 Difference]: With dead ends: 309 [2018-01-28 21:54:25,004 INFO L226 Difference]: Without dead ends: 308 [2018-01-28 21:54:25,004 INFO L533 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-01-28 21:54:25,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-01-28 21:54:25,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 294. [2018-01-28 21:54:25,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-01-28 21:54:25,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 317 transitions. [2018-01-28 21:54:25,012 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 317 transitions. Word has length 50 [2018-01-28 21:54:25,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:25,012 INFO L432 AbstractCegarLoop]: Abstraction has 294 states and 317 transitions. [2018-01-28 21:54:25,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 21:54:25,012 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 317 transitions. [2018-01-28 21:54:25,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-28 21:54:25,013 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:25,013 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:25,013 INFO L371 AbstractCegarLoop]: === Iteration 41 === [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-01-28 21:54:25,013 INFO L82 PathProgramCache]: Analyzing trace with hash -2057292868, now seen corresponding path program 1 times [2018-01-28 21:54:25,013 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:25,013 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:25,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:25,014 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:25,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:25,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:25,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:25,143 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:25,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:54:25,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 21:54:25,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 21:54:25,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:54:25,144 INFO L87 Difference]: Start difference. First operand 294 states and 317 transitions. Second operand 9 states. [2018-01-28 21:54:25,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:25,454 INFO L93 Difference]: Finished difference Result 308 states and 333 transitions. [2018-01-28 21:54:25,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:54:25,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-01-28 21:54:25,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:25,455 INFO L225 Difference]: With dead ends: 308 [2018-01-28 21:54:25,455 INFO L226 Difference]: Without dead ends: 307 [2018-01-28 21:54:25,456 INFO L533 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-01-28 21:54:25,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-01-28 21:54:25,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 293. [2018-01-28 21:54:25,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-01-28 21:54:25,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 316 transitions. [2018-01-28 21:54:25,464 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 316 transitions. Word has length 50 [2018-01-28 21:54:25,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:25,464 INFO L432 AbstractCegarLoop]: Abstraction has 293 states and 316 transitions. [2018-01-28 21:54:25,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 21:54:25,464 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 316 transitions. [2018-01-28 21:54:25,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-28 21:54:25,465 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:25,465 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:25,465 INFO L371 AbstractCegarLoop]: === Iteration 42 === [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-01-28 21:54:25,465 INFO L82 PathProgramCache]: Analyzing trace with hash 371590610, now seen corresponding path program 1 times [2018-01-28 21:54:25,465 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:25,465 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:25,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:25,466 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:25,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:25,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:25,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:25,598 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:25,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 21:54:25,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 21:54:25,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 21:54:25,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:54:25,599 INFO L87 Difference]: Start difference. First operand 293 states and 316 transitions. Second operand 10 states. [2018-01-28 21:54:26,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:26,028 INFO L93 Difference]: Finished difference Result 307 states and 332 transitions. [2018-01-28 21:54:26,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-28 21:54:26,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-01-28 21:54:26,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:26,029 INFO L225 Difference]: With dead ends: 307 [2018-01-28 21:54:26,029 INFO L226 Difference]: Without dead ends: 306 [2018-01-28 21:54:26,029 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-01-28 21:54:26,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-01-28 21:54:26,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 292. [2018-01-28 21:54:26,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-01-28 21:54:26,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 315 transitions. [2018-01-28 21:54:26,038 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 315 transitions. Word has length 53 [2018-01-28 21:54:26,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:26,038 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 315 transitions. [2018-01-28 21:54:26,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 21:54:26,038 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 315 transitions. [2018-01-28 21:54:26,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-28 21:54:26,039 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:26,039 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:26,039 INFO L371 AbstractCegarLoop]: === Iteration 43 === [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-01-28 21:54:26,039 INFO L82 PathProgramCache]: Analyzing trace with hash 371590611, now seen corresponding path program 1 times [2018-01-28 21:54:26,039 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:26,039 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:26,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:26,040 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:26,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:26,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:26,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:26,210 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:26,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 21:54:26,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 21:54:26,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 21:54:26,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:54:26,211 INFO L87 Difference]: Start difference. First operand 292 states and 315 transitions. Second operand 10 states. [2018-01-28 21:54:26,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:26,501 INFO L93 Difference]: Finished difference Result 306 states and 331 transitions. [2018-01-28 21:54:26,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 21:54:26,502 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-01-28 21:54:26,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:26,503 INFO L225 Difference]: With dead ends: 306 [2018-01-28 21:54:26,503 INFO L226 Difference]: Without dead ends: 305 [2018-01-28 21:54:26,503 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-01-28 21:54:26,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-01-28 21:54:26,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 291. [2018-01-28 21:54:26,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-01-28 21:54:26,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 314 transitions. [2018-01-28 21:54:26,512 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 314 transitions. Word has length 53 [2018-01-28 21:54:26,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:26,512 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 314 transitions. [2018-01-28 21:54:26,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 21:54:26,513 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 314 transitions. [2018-01-28 21:54:26,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-28 21:54:26,513 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:26,513 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:26,513 INFO L371 AbstractCegarLoop]: === Iteration 44 === [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-01-28 21:54:26,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1413703354, now seen corresponding path program 1 times [2018-01-28 21:54:26,513 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:26,513 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:26,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:26,514 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:26,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:26,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:27,095 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:27,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-28 21:54:27,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-28 21:54:27,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-28 21:54:27,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-01-28 21:54:27,096 INFO L87 Difference]: Start difference. First operand 291 states and 314 transitions. Second operand 17 states. [2018-01-28 21:54:28,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:28,260 INFO L93 Difference]: Finished difference Result 391 states and 421 transitions. [2018-01-28 21:54:28,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-28 21:54:28,261 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2018-01-28 21:54:28,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:28,262 INFO L225 Difference]: With dead ends: 391 [2018-01-28 21:54:28,262 INFO L226 Difference]: Without dead ends: 312 [2018-01-28 21:54:28,262 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=274, Invalid=986, Unknown=0, NotChecked=0, Total=1260 [2018-01-28 21:54:28,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-01-28 21:54:28,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 291. [2018-01-28 21:54:28,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-01-28 21:54:28,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 313 transitions. [2018-01-28 21:54:28,271 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 313 transitions. Word has length 57 [2018-01-28 21:54:28,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:28,271 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 313 transitions. [2018-01-28 21:54:28,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-28 21:54:28,271 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 313 transitions. [2018-01-28 21:54:28,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-28 21:54:28,271 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:28,271 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:28,272 INFO L371 AbstractCegarLoop]: === Iteration 45 === [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-01-28 21:54:28,272 INFO L82 PathProgramCache]: Analyzing trace with hash -548076060, now seen corresponding path program 1 times [2018-01-28 21:54:28,272 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:28,272 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:28,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:28,272 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:28,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:28,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:28,697 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 42 DAG size of output 32 [2018-01-28 21:54:29,052 WARN L146 SmtUtils]: Spent 197ms on a formula simplification. DAG size of input: 41 DAG size of output 32 [2018-01-28 21:54:29,310 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:29,310 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:54:29,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-01-28 21:54:29,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-28 21:54:29,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-28 21:54:29,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-01-28 21:54:29,311 INFO L87 Difference]: Start difference. First operand 291 states and 313 transitions. Second operand 18 states. [2018-01-28 21:54:30,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:54:30,378 INFO L93 Difference]: Finished difference Result 384 states and 412 transitions. [2018-01-28 21:54:30,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-28 21:54:30,378 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2018-01-28 21:54:30,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:54:30,379 INFO L225 Difference]: With dead ends: 384 [2018-01-28 21:54:30,379 INFO L226 Difference]: Without dead ends: 292 [2018-01-28 21:54:30,380 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=258, Invalid=1224, Unknown=0, NotChecked=0, Total=1482 [2018-01-28 21:54:30,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-01-28 21:54:30,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 269. [2018-01-28 21:54:30,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-01-28 21:54:30,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 290 transitions. [2018-01-28 21:54:30,393 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 290 transitions. Word has length 57 [2018-01-28 21:54:30,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:54:30,394 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 290 transitions. [2018-01-28 21:54:30,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-28 21:54:30,394 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 290 transitions. [2018-01-28 21:54:30,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-28 21:54:30,395 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:54:30,395 INFO L330 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:54:30,395 INFO L371 AbstractCegarLoop]: === Iteration 46 === [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-01-28 21:54:30,395 INFO L82 PathProgramCache]: Analyzing trace with hash 699456494, now seen corresponding path program 1 times [2018-01-28 21:54:30,395 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:54:30,395 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:54:30,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:30,396 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:30,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:54:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:30,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:54:30,591 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:30,592 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:54:30,592 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:54:30,597 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:54:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:54:30,630 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:54:30,666 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:54:30,667 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:54:30,667 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-01-28 21:54:30,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:54:30,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:54:30,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-01-28 21:54:30,686 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-01-28 21:54:30,687 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-01-28 21:54:30,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:54:30,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:54:30,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:54:30,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-01-28 21:54:30,733 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 28 treesize of output 24 [2018-01-28 21:54:30,738 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-01-28 21:54:30,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:54:30,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:54:30,747 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-01-28 21:54:30,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-01-28 21:54:30,805 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 41 treesize of output 31 [2018-01-28 21:54:30,809 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-01-28 21:54:30,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:54:30,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:54:30,833 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-01-28 21:54:30,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:39 [2018-01-28 21:54:34,890 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 52 treesize of output 42 [2018-01-28 21:54:34,898 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 2 case distinctions, treesize of input 22 treesize of output 35 [2018-01-28 21:54:34,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:54:34,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:54:34,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-28 21:54:34,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:76 [2018-01-28 21:54:46,983 WARN L143 SmtUtils]: Spent 12035ms on a formula simplification that was a NOOP. DAG size: 33 [2018-01-28 21:54:51,051 WARN L146 SmtUtils]: Spent 4023ms on a formula simplification. DAG size of input: 33 DAG size of output 19 [2018-01-28 21:54:51,064 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-01-28 21:54:51,066 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-01-28 21:54:51,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:54:51,072 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-01-28 21:54:51,072 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:54:51,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:54:51,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:54:51,081 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:5 [2018-01-28 21:54:51,107 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:54:51,127 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:54:51,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 23 [2018-01-28 21:54:51,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-28 21:54:51,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-28 21:54:51,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=475, Unknown=2, NotChecked=0, Total=552 [2018-01-28 21:54:51,128 INFO L87 Difference]: Start difference. First operand 269 states and 290 transitions. Second operand 24 states. [2018-01-28 21:55:36,162 WARN L146 SmtUtils]: Spent 22088ms on a formula simplification. DAG size of input: 59 DAG size of output 50 [2018-01-28 21:56:02,243 WARN L146 SmtUtils]: Spent 22055ms on a formula simplification. DAG size of input: 56 DAG size of output 47 Received shutdown request... [2018-01-28 21:56:20,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-28 21:56:20,315 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-28 21:56:20,322 WARN L185 ceAbstractionStarter]: Timeout [2018-01-28 21:56:20,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 09:56:20 BoogieIcfgContainer [2018-01-28 21:56:20,322 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 21:56:20,323 INFO L168 Benchmark]: Toolchain (without parser) took 139127.57 ms. Allocated memory was 302.5 MB in the beginning and 757.1 MB in the end (delta: 454.6 MB). Free memory was 259.4 MB in the beginning and 634.0 MB in the end (delta: -374.6 MB). Peak memory consumption was 80.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:56:20,325 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 302.5 MB. Free memory is still 267.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 21:56:20,325 INFO L168 Benchmark]: CACSL2BoogieTranslator took 225.43 ms. Allocated memory is still 302.5 MB. Free memory was 259.4 MB in the beginning and 247.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:56:20,325 INFO L168 Benchmark]: Boogie Preprocessor took 44.87 ms. Allocated memory is still 302.5 MB. Free memory was 247.4 MB in the beginning and 245.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:56:20,325 INFO L168 Benchmark]: RCFGBuilder took 675.70 ms. Allocated memory is still 302.5 MB. Free memory was 245.5 MB in the beginning and 200.3 MB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 5.3 GB. [2018-01-28 21:56:20,326 INFO L168 Benchmark]: TraceAbstraction took 138173.30 ms. Allocated memory was 302.5 MB in the beginning and 757.1 MB in the end (delta: 454.6 MB). Free memory was 200.3 MB in the beginning and 634.0 MB in the end (delta: -433.7 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB. [2018-01-28 21:56:20,328 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 302.5 MB. Free memory is still 267.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 225.43 ms. Allocated memory is still 302.5 MB. Free memory was 259.4 MB in the beginning and 247.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.87 ms. Allocated memory is still 302.5 MB. Free memory was 247.4 MB in the beginning and 245.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 675.70 ms. Allocated memory is still 302.5 MB. Free memory was 245.5 MB in the beginning and 200.3 MB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 138173.30 ms. Allocated memory was 302.5 MB in the beginning and 757.1 MB in the end (delta: 454.6 MB). Free memory was 200.3 MB in the beginning and 634.0 MB in the end (delta: -433.7 MB). Peak memory consumption was 20.9 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 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 15 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 206 locations, 75 error locations. TIMEOUT Result, 138.1s OverallTime, 46 OverallIterations, 3 TraceHistogramMax, 107.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7205 SDtfs, 9873 SDslu, 21629 SDs, 0 SdLazy, 14253 SolverSat, 663 SolverUnsat, 47 SolverUnknown, 0 SolverNotchecked, 34.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 734 GetRequests, 215 SyntacticMatches, 29 SemanticMatches, 490 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1357 ImplicationChecksByTransitivity, 97.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=38, 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.4s AutomataMinimizationTime, 45 MinimizatonAttempts, 2098 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 29.1s InterpolantComputationTime, 2006 NumberOfCodeBlocks, 2006 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 1957 ConstructedInterpolants, 52 QuantifiedInterpolants, 757229 SizeOfPredicates, 44 NumberOfNonLiveVariables, 561 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 49 InterpolantComputations, 43 PerfectInterpolantSequences, 55/86 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_parent_ptr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_21-56-20-337.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_parent_ptr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_21-56-20-337.csv Completed graceful shutdown