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.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_cnstr_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:05:13,215 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:05:13,217 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:05:13,230 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:05:13,231 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:05:13,232 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:05:13,233 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:05:13,234 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:05:13,237 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:05:13,237 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:05:13,238 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:05:13,238 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:05:13,239 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:05:13,240 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:05:13,240 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:05:13,242 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:05:13,245 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:05:13,247 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:05:13,248 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:05:13,249 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:05:13,251 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:05:13,252 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:05:13,252 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:05:13,253 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:05:13,254 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:05:13,255 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:05:13,255 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:05:13,256 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:05:13,256 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:05:13,256 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:05:13,257 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:05:13,257 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.epf [2018-01-24 12:05:13,267 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:05:13,267 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:05:13,268 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:05:13,268 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:05:13,268 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:05:13,269 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:05:13,269 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:05:13,269 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:05:13,269 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:05:13,270 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:05:13,270 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:05:13,270 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:05:13,270 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:05:13,270 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:05:13,271 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:05:13,271 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:05:13,271 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:05:13,271 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:05:13,271 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:05:13,272 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:05:13,272 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:05:13,272 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:05:13,272 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:05:13,272 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:05:13,272 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:05:13,273 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:05:13,273 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:05:13,273 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:05:13,273 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:05:13,273 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:05:13,274 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:05:13,274 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:05:13,275 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:05:13,275 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:05:13,309 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:05:13,321 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:05:13,325 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:05:13,326 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:05:13,327 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:05:13,327 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_cnstr_true-valid-memsafety_false-termination.i [2018-01-24 12:05:13,519 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:05:13,525 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:05:13,526 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:05:13,526 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:05:13,530 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:05:13,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:05:13" (1/1) ... [2018-01-24 12:05:13,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14e135de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:05:13, skipping insertion in model container [2018-01-24 12:05:13,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:05:13" (1/1) ... [2018-01-24 12:05:13,550 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:05:13,590 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:05:13,699 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:05:13,716 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:05:13,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:05:13 WrapperNode [2018-01-24 12:05:13,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:05:13,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:05:13,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:05:13,727 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:05:13,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:05:13" (1/1) ... [2018-01-24 12:05:13,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:05:13" (1/1) ... [2018-01-24 12:05:13,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:05:13" (1/1) ... [2018-01-24 12:05:13,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:05:13" (1/1) ... [2018-01-24 12:05:13,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:05:13" (1/1) ... [2018-01-24 12:05:13,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:05:13" (1/1) ... [2018-01-24 12:05:13,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:05:13" (1/1) ... [2018-01-24 12:05:13,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:05:13,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:05:13,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:05:13,766 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:05:13,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:05:13" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:05:13,811 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:05:13,811 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:05:13,811 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:05:13,812 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 12:05:13,812 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 12:05:13,812 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:05:13,812 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:05:13,812 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:05:13,812 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:05:13,812 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 12:05:13,813 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 12:05:13,813 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:05:13,813 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:05:13,813 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:05:14,283 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:05:14,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:05:14 BoogieIcfgContainer [2018-01-24 12:05:14,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:05:14,285 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:05:14,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:05:14,287 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:05:14,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:05:13" (1/3) ... [2018-01-24 12:05:14,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26522c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:05:14, skipping insertion in model container [2018-01-24 12:05:14,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:05:13" (2/3) ... [2018-01-24 12:05:14,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26522c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:05:14, skipping insertion in model container [2018-01-24 12:05:14,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:05:14" (3/3) ... [2018-01-24 12:05:14,290 INFO L105 eAbstractionObserver]: Analyzing ICFG tree_cnstr_true-valid-memsafety_false-termination.i [2018-01-24 12:05:14,297 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:05:14,305 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-01-24 12:05:14,343 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:05:14,343 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:05:14,344 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:05:14,344 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:05:14,344 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:05:14,344 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:05:14,344 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:05:14,344 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:05:14,345 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:05:14,364 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2018-01-24 12:05:14,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 12:05:14,370 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:14,371 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:14,371 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:14,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1341839433, now seen corresponding path program 1 times [2018-01-24 12:05:14,376 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:14,376 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:14,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:14,416 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:14,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:14,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:14,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:14,521 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:14,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:05:14,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:05:14,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:05:14,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:05:14,536 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 4 states. [2018-01-24 12:05:14,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:14,921 INFO L93 Difference]: Finished difference Result 293 states and 335 transitions. [2018-01-24 12:05:14,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:05:14,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 12:05:14,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:14,934 INFO L225 Difference]: With dead ends: 293 [2018-01-24 12:05:14,934 INFO L226 Difference]: Without dead ends: 170 [2018-01-24 12:05:14,938 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:05:14,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-01-24 12:05:14,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 125. [2018-01-24 12:05:14,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-24 12:05:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2018-01-24 12:05:14,978 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 8 [2018-01-24 12:05:14,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:14,979 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2018-01-24 12:05:14,979 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:05:14,979 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2018-01-24 12:05:14,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 12:05:14,979 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:14,979 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:14,980 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:14,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1341839434, now seen corresponding path program 1 times [2018-01-24 12:05:14,980 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:14,980 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:14,981 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:14,981 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:14,981 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:14,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:15,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:15,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:15,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:05:15,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:05:15,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:05:15,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:05:15,065 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand 4 states. [2018-01-24 12:05:15,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:15,239 INFO L93 Difference]: Finished difference Result 167 states and 185 transitions. [2018-01-24 12:05:15,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:05:15,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 12:05:15,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:15,243 INFO L225 Difference]: With dead ends: 167 [2018-01-24 12:05:15,243 INFO L226 Difference]: Without dead ends: 165 [2018-01-24 12:05:15,244 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:05:15,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-24 12:05:15,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 123. [2018-01-24 12:05:15,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-24 12:05:15,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2018-01-24 12:05:15,257 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 8 [2018-01-24 12:05:15,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:15,257 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2018-01-24 12:05:15,258 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:05:15,258 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2018-01-24 12:05:15,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:05:15,258 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:15,258 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:15,259 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:15,259 INFO L82 PathProgramCache]: Analyzing trace with hash 557054198, now seen corresponding path program 1 times [2018-01-24 12:05:15,259 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:15,259 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:15,260 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:15,260 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:15,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:15,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:15,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-24 12:05:15,310 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:15,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:05:15,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:05:15,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:05:15,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:05:15,311 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand 4 states. [2018-01-24 12:05:15,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:15,470 INFO L93 Difference]: Finished difference Result 172 states and 196 transitions. [2018-01-24 12:05:15,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:05:15,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 12:05:15,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:15,472 INFO L225 Difference]: With dead ends: 172 [2018-01-24 12:05:15,472 INFO L226 Difference]: Without dead ends: 154 [2018-01-24 12:05:15,473 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:05:15,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-24 12:05:15,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 113. [2018-01-24 12:05:15,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-24 12:05:15,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2018-01-24 12:05:15,486 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 14 [2018-01-24 12:05:15,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:15,487 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2018-01-24 12:05:15,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:05:15,487 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2018-01-24 12:05:15,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:05:15,488 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:15,488 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:15,488 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:15,488 INFO L82 PathProgramCache]: Analyzing trace with hash 557054199, now seen corresponding path program 1 times [2018-01-24 12:05:15,488 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:15,489 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:15,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:15,490 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:15,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:15,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:15,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-24 12:05:15,562 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:15,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:05:15,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:05:15,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:05:15,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:05:15,563 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand 5 states. [2018-01-24 12:05:15,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:15,844 INFO L93 Difference]: Finished difference Result 251 states and 285 transitions. [2018-01-24 12:05:15,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:05:15,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 12:05:15,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:15,846 INFO L225 Difference]: With dead ends: 251 [2018-01-24 12:05:15,846 INFO L226 Difference]: Without dead ends: 233 [2018-01-24 12:05:15,847 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:05:15,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-01-24 12:05:15,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 182. [2018-01-24 12:05:15,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-24 12:05:15,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 240 transitions. [2018-01-24 12:05:15,862 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 240 transitions. Word has length 14 [2018-01-24 12:05:15,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:15,863 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 240 transitions. [2018-01-24 12:05:15,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:05:15,863 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 240 transitions. [2018-01-24 12:05:15,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:05:15,863 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:15,864 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:15,864 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:15,864 INFO L82 PathProgramCache]: Analyzing trace with hash -505191267, now seen corresponding path program 1 times [2018-01-24 12:05:15,864 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:15,864 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:15,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:15,865 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:15,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:15,876 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:15,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:15,909 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:15,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:05:15,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:05:15,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:05:15,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:05:15,910 INFO L87 Difference]: Start difference. First operand 182 states and 240 transitions. Second operand 4 states. [2018-01-24 12:05:15,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:15,932 INFO L93 Difference]: Finished difference Result 198 states and 242 transitions. [2018-01-24 12:05:15,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:05:15,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-01-24 12:05:15,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:15,934 INFO L225 Difference]: With dead ends: 198 [2018-01-24 12:05:15,934 INFO L226 Difference]: Without dead ends: 195 [2018-01-24 12:05:15,935 INFO L525 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-24 12:05:15,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-01-24 12:05:15,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 182. [2018-01-24 12:05:15,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-24 12:05:15,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 238 transitions. [2018-01-24 12:05:15,949 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 238 transitions. Word has length 17 [2018-01-24 12:05:15,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:15,949 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 238 transitions. [2018-01-24 12:05:15,950 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:05:15,950 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 238 transitions. [2018-01-24 12:05:15,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:05:15,951 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:15,951 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:15,951 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:15,951 INFO L82 PathProgramCache]: Analyzing trace with hash -605576120, now seen corresponding path program 1 times [2018-01-24 12:05:15,951 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:15,952 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:15,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:15,953 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:15,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:15,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:15,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:16,000 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:16,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:05:16,000 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:05:16,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:05:16,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:05:16,001 INFO L87 Difference]: Start difference. First operand 182 states and 238 transitions. Second operand 3 states. [2018-01-24 12:05:16,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:16,013 INFO L93 Difference]: Finished difference Result 261 states and 355 transitions. [2018-01-24 12:05:16,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:05:16,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-01-24 12:05:16,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:16,014 INFO L225 Difference]: With dead ends: 261 [2018-01-24 12:05:16,014 INFO L226 Difference]: Without dead ends: 185 [2018-01-24 12:05:16,015 INFO L525 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-24 12:05:16,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-01-24 12:05:16,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-01-24 12:05:16,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-24 12:05:16,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 241 transitions. [2018-01-24 12:05:16,023 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 241 transitions. Word has length 22 [2018-01-24 12:05:16,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:16,024 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 241 transitions. [2018-01-24 12:05:16,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:05:16,024 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 241 transitions. [2018-01-24 12:05:16,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:05:16,025 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:16,025 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:16,025 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:16,025 INFO L82 PathProgramCache]: Analyzing trace with hash 927704743, now seen corresponding path program 1 times [2018-01-24 12:05:16,025 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:16,025 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:16,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:16,026 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:16,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:16,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:16,056 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-24 12:05:16,056 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:16,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:05:16,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:05:16,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:05:16,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:05:16,057 INFO L87 Difference]: Start difference. First operand 185 states and 241 transitions. Second operand 3 states. [2018-01-24 12:05:16,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:16,073 INFO L93 Difference]: Finished difference Result 363 states and 477 transitions. [2018-01-24 12:05:16,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:05:16,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-01-24 12:05:16,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:16,074 INFO L225 Difference]: With dead ends: 363 [2018-01-24 12:05:16,074 INFO L226 Difference]: Without dead ends: 187 [2018-01-24 12:05:16,075 INFO L525 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-24 12:05:16,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-24 12:05:16,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-01-24 12:05:16,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-24 12:05:16,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 243 transitions. [2018-01-24 12:05:16,082 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 243 transitions. Word has length 22 [2018-01-24 12:05:16,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:16,083 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 243 transitions. [2018-01-24 12:05:16,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:05:16,083 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 243 transitions. [2018-01-24 12:05:16,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 12:05:16,084 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:16,084 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:16,084 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:16,084 INFO L82 PathProgramCache]: Analyzing trace with hash -2088156413, now seen corresponding path program 1 times [2018-01-24 12:05:16,084 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:16,084 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:16,085 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:16,085 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:16,085 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:16,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:16,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:16,120 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:16,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:05:16,120 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:05:16,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:05:16,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:05:16,121 INFO L87 Difference]: Start difference. First operand 187 states and 243 transitions. Second operand 3 states. [2018-01-24 12:05:16,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:16,148 INFO L93 Difference]: Finished difference Result 280 states and 367 transitions. [2018-01-24 12:05:16,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:05:16,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-01-24 12:05:16,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:16,150 INFO L225 Difference]: With dead ends: 280 [2018-01-24 12:05:16,150 INFO L226 Difference]: Without dead ends: 201 [2018-01-24 12:05:16,151 INFO L525 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-24 12:05:16,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-01-24 12:05:16,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 190. [2018-01-24 12:05:16,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-01-24 12:05:16,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 243 transitions. [2018-01-24 12:05:16,162 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 243 transitions. Word has length 24 [2018-01-24 12:05:16,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:16,162 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 243 transitions. [2018-01-24 12:05:16,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:05:16,162 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 243 transitions. [2018-01-24 12:05:16,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 12:05:16,163 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:16,164 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:16,164 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:16,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1439697764, now seen corresponding path program 1 times [2018-01-24 12:05:16,164 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:16,164 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:16,165 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:16,165 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:16,165 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:16,181 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:16,296 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-24 12:05:16,296 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:16,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:05:16,296 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:05:16,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:05:16,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:05:16,297 INFO L87 Difference]: Start difference. First operand 190 states and 243 transitions. Second operand 6 states. [2018-01-24 12:05:16,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:16,567 INFO L93 Difference]: Finished difference Result 471 states and 593 transitions. [2018-01-24 12:05:16,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:05:16,568 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-24 12:05:16,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:16,570 INFO L225 Difference]: With dead ends: 471 [2018-01-24 12:05:16,570 INFO L226 Difference]: Without dead ends: 290 [2018-01-24 12:05:16,571 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:05:16,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-01-24 12:05:16,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 206. [2018-01-24 12:05:16,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-01-24 12:05:16,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 264 transitions. [2018-01-24 12:05:16,581 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 264 transitions. Word has length 24 [2018-01-24 12:05:16,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:16,581 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 264 transitions. [2018-01-24 12:05:16,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:05:16,582 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 264 transitions. [2018-01-24 12:05:16,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 12:05:16,582 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:16,583 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:16,583 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:16,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1566782653, now seen corresponding path program 1 times [2018-01-24 12:05:16,583 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:16,583 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:16,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:16,584 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:16,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:16,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:16,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:16,642 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:16,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:05:16,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:05:16,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:05:16,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:05:16,644 INFO L87 Difference]: Start difference. First operand 206 states and 264 transitions. Second operand 5 states. [2018-01-24 12:05:16,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:16,952 INFO L93 Difference]: Finished difference Result 330 states and 414 transitions. [2018-01-24 12:05:16,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:05:16,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-24 12:05:16,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:16,954 INFO L225 Difference]: With dead ends: 330 [2018-01-24 12:05:16,954 INFO L226 Difference]: Without dead ends: 329 [2018-01-24 12:05:16,955 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:05:16,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-01-24 12:05:16,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 205. [2018-01-24 12:05:16,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-01-24 12:05:16,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 262 transitions. [2018-01-24 12:05:16,970 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 262 transitions. Word has length 25 [2018-01-24 12:05:16,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:16,970 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 262 transitions. [2018-01-24 12:05:16,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:05:16,970 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 262 transitions. [2018-01-24 12:05:16,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 12:05:16,971 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:16,971 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:16,971 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:16,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1566782654, now seen corresponding path program 1 times [2018-01-24 12:05:16,972 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:16,972 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:16,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:16,973 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:16,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:16,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:17,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:17,081 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:17,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:05:17,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:05:17,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:05:17,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:05:17,082 INFO L87 Difference]: Start difference. First operand 205 states and 262 transitions. Second operand 5 states. [2018-01-24 12:05:17,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:17,367 INFO L93 Difference]: Finished difference Result 365 states and 471 transitions. [2018-01-24 12:05:17,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:05:17,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-24 12:05:17,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:17,369 INFO L225 Difference]: With dead ends: 365 [2018-01-24 12:05:17,369 INFO L226 Difference]: Without dead ends: 364 [2018-01-24 12:05:17,370 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:05:17,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-01-24 12:05:17,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 204. [2018-01-24 12:05:17,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-01-24 12:05:17,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 260 transitions. [2018-01-24 12:05:17,385 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 260 transitions. Word has length 25 [2018-01-24 12:05:17,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:17,385 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 260 transitions. [2018-01-24 12:05:17,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:05:17,385 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 260 transitions. [2018-01-24 12:05:17,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 12:05:17,386 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:17,386 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:17,387 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:17,387 INFO L82 PathProgramCache]: Analyzing trace with hash -554334541, now seen corresponding path program 1 times [2018-01-24 12:05:17,387 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:17,387 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:17,388 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:17,388 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:17,388 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:17,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:17,492 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-24 12:05:17,493 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:17,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:05:17,493 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:05:17,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:05:17,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:05:17,494 INFO L87 Difference]: Start difference. First operand 204 states and 260 transitions. Second operand 6 states. [2018-01-24 12:05:17,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:17,799 INFO L93 Difference]: Finished difference Result 369 states and 467 transitions. [2018-01-24 12:05:17,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:05:17,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-24 12:05:17,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:17,801 INFO L225 Difference]: With dead ends: 369 [2018-01-24 12:05:17,801 INFO L226 Difference]: Without dead ends: 287 [2018-01-24 12:05:17,802 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:05:17,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-01-24 12:05:17,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 242. [2018-01-24 12:05:17,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-01-24 12:05:17,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 319 transitions. [2018-01-24 12:05:17,820 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 319 transitions. Word has length 26 [2018-01-24 12:05:17,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:17,820 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 319 transitions. [2018-01-24 12:05:17,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:05:17,821 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 319 transitions. [2018-01-24 12:05:17,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:05:17,824 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:17,824 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:17,824 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:17,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1703794537, now seen corresponding path program 1 times [2018-01-24 12:05:17,825 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:17,825 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:17,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:17,826 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:17,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:17,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:18,004 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-24 12:05:18,004 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:05:18,004 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-24 12:05:18,016 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:18,049 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:05:18,247 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~n~4.base Int)) (and (not (= 0 main_~n~4.base)) (= |c_#valid| (store |c_old(#valid)| main_~n~4.base 0)) (= 0 (select |c_old(#valid)| main_~n~4.base)))) is different from true [2018-01-24 12:05:18,260 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-24 12:05:18,295 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:05:18,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-01-24 12:05:18,296 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:05:18,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:05:18,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2018-01-24 12:05:18,297 INFO L87 Difference]: Start difference. First operand 242 states and 319 transitions. Second operand 11 states. [2018-01-24 12:05:19,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:19,051 INFO L93 Difference]: Finished difference Result 342 states and 437 transitions. [2018-01-24 12:05:19,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:05:19,052 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-01-24 12:05:19,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:19,053 INFO L225 Difference]: With dead ends: 342 [2018-01-24 12:05:19,053 INFO L226 Difference]: Without dead ends: 339 [2018-01-24 12:05:19,054 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=204, Unknown=1, NotChecked=30, Total=306 [2018-01-24 12:05:19,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-01-24 12:05:19,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 251. [2018-01-24 12:05:19,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-01-24 12:05:19,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 329 transitions. [2018-01-24 12:05:19,072 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 329 transitions. Word has length 28 [2018-01-24 12:05:19,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:19,072 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 329 transitions. [2018-01-24 12:05:19,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:05:19,073 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 329 transitions. [2018-01-24 12:05:19,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:05:19,073 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:19,073 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:19,074 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:19,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1703794284, now seen corresponding path program 1 times [2018-01-24 12:05:19,074 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:19,074 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:19,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:19,075 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:19,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:19,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:19,135 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-24 12:05:19,136 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:19,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:05:19,136 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:05:19,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:05:19,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:05:19,137 INFO L87 Difference]: Start difference. First operand 251 states and 329 transitions. Second operand 3 states. [2018-01-24 12:05:19,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:19,158 INFO L93 Difference]: Finished difference Result 271 states and 336 transitions. [2018-01-24 12:05:19,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:05:19,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-01-24 12:05:19,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:19,160 INFO L225 Difference]: With dead ends: 271 [2018-01-24 12:05:19,160 INFO L226 Difference]: Without dead ends: 221 [2018-01-24 12:05:19,161 INFO L525 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-24 12:05:19,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-01-24 12:05:19,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2018-01-24 12:05:19,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-01-24 12:05:19,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 274 transitions. [2018-01-24 12:05:19,177 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 274 transitions. Word has length 28 [2018-01-24 12:05:19,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:19,177 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 274 transitions. [2018-01-24 12:05:19,177 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:05:19,177 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 274 transitions. [2018-01-24 12:05:19,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:05:19,178 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:19,178 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:19,178 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:19,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1964814354, now seen corresponding path program 1 times [2018-01-24 12:05:19,178 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:19,179 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:19,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:19,179 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:19,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:19,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:19,247 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-24 12:05:19,247 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:19,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:05:19,248 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:05:19,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:05:19,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:05:19,248 INFO L87 Difference]: Start difference. First operand 220 states and 274 transitions. Second operand 6 states. [2018-01-24 12:05:19,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:19,521 INFO L93 Difference]: Finished difference Result 320 states and 409 transitions. [2018-01-24 12:05:19,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:05:19,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-24 12:05:19,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:19,523 INFO L225 Difference]: With dead ends: 320 [2018-01-24 12:05:19,523 INFO L226 Difference]: Without dead ends: 232 [2018-01-24 12:05:19,524 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:05:19,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-01-24 12:05:19,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 225. [2018-01-24 12:05:19,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-01-24 12:05:19,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 280 transitions. [2018-01-24 12:05:19,543 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 280 transitions. Word has length 28 [2018-01-24 12:05:19,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:19,544 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 280 transitions. [2018-01-24 12:05:19,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:05:19,544 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 280 transitions. [2018-01-24 12:05:19,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:05:19,544 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:19,544 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:19,544 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:19,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1959088716, now seen corresponding path program 1 times [2018-01-24 12:05:19,545 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:19,545 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:19,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:19,546 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:19,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:19,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:19,721 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-24 12:05:19,722 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:19,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:05:19,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:05:19,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:05:19,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:05:19,723 INFO L87 Difference]: Start difference. First operand 225 states and 280 transitions. Second operand 8 states. [2018-01-24 12:05:20,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:20,395 INFO L93 Difference]: Finished difference Result 426 states and 516 transitions. [2018-01-24 12:05:20,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:05:20,396 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-01-24 12:05:20,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:20,397 INFO L225 Difference]: With dead ends: 426 [2018-01-24 12:05:20,397 INFO L226 Difference]: Without dead ends: 322 [2018-01-24 12:05:20,398 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:05:20,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-01-24 12:05:20,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 273. [2018-01-24 12:05:20,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-01-24 12:05:20,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 352 transitions. [2018-01-24 12:05:20,410 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 352 transitions. Word has length 28 [2018-01-24 12:05:20,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:20,411 INFO L432 AbstractCegarLoop]: Abstraction has 273 states and 352 transitions. [2018-01-24 12:05:20,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:05:20,411 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 352 transitions. [2018-01-24 12:05:20,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:05:20,411 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:20,411 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:20,411 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:20,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1682499776, now seen corresponding path program 1 times [2018-01-24 12:05:20,411 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:20,411 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:20,412 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:20,412 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:20,412 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:20,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:20,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:20,715 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:20,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:05:20,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:05:20,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:05:20,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:05:20,716 INFO L87 Difference]: Start difference. First operand 273 states and 352 transitions. Second operand 9 states. [2018-01-24 12:05:21,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:21,321 INFO L93 Difference]: Finished difference Result 398 states and 517 transitions. [2018-01-24 12:05:21,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:05:21,322 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-01-24 12:05:21,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:21,324 INFO L225 Difference]: With dead ends: 398 [2018-01-24 12:05:21,324 INFO L226 Difference]: Without dead ends: 397 [2018-01-24 12:05:21,325 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:05:21,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-01-24 12:05:21,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 272. [2018-01-24 12:05:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-01-24 12:05:21,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 349 transitions. [2018-01-24 12:05:21,348 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 349 transitions. Word has length 28 [2018-01-24 12:05:21,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:21,348 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 349 transitions. [2018-01-24 12:05:21,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:05:21,348 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 349 transitions. [2018-01-24 12:05:21,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:05:21,349 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:21,349 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:21,349 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:21,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1682499775, now seen corresponding path program 1 times [2018-01-24 12:05:21,349 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:21,350 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:21,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:21,351 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:21,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:21,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:21,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:21,472 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:21,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:05:21,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:05:21,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:05:21,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:05:21,472 INFO L87 Difference]: Start difference. First operand 272 states and 349 transitions. Second operand 9 states. [2018-01-24 12:05:22,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:22,001 INFO L93 Difference]: Finished difference Result 397 states and 514 transitions. [2018-01-24 12:05:22,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:05:22,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-01-24 12:05:22,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:22,004 INFO L225 Difference]: With dead ends: 397 [2018-01-24 12:05:22,004 INFO L226 Difference]: Without dead ends: 396 [2018-01-24 12:05:22,005 INFO L525 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-24 12:05:22,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-01-24 12:05:22,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 271. [2018-01-24 12:05:22,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-01-24 12:05:22,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 346 transitions. [2018-01-24 12:05:22,023 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 346 transitions. Word has length 28 [2018-01-24 12:05:22,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:22,023 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 346 transitions. [2018-01-24 12:05:22,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:05:22,024 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 346 transitions. [2018-01-24 12:05:22,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 12:05:22,024 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:22,024 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:22,024 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:22,025 INFO L82 PathProgramCache]: Analyzing trace with hash -546988646, now seen corresponding path program 1 times [2018-01-24 12:05:22,025 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:22,025 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:22,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:22,026 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:22,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:22,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:22,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:22,064 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:22,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:05:22,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:05:22,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:05:22,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:05:22,065 INFO L87 Difference]: Start difference. First operand 271 states and 346 transitions. Second operand 5 states. [2018-01-24 12:05:22,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:22,273 INFO L93 Difference]: Finished difference Result 397 states and 497 transitions. [2018-01-24 12:05:22,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:05:22,274 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-24 12:05:22,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:22,276 INFO L225 Difference]: With dead ends: 397 [2018-01-24 12:05:22,276 INFO L226 Difference]: Without dead ends: 396 [2018-01-24 12:05:22,276 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:05:22,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-01-24 12:05:22,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 270. [2018-01-24 12:05:22,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-01-24 12:05:22,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 344 transitions. [2018-01-24 12:05:22,294 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 344 transitions. Word has length 29 [2018-01-24 12:05:22,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:22,294 INFO L432 AbstractCegarLoop]: Abstraction has 270 states and 344 transitions. [2018-01-24 12:05:22,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:05:22,294 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 344 transitions. [2018-01-24 12:05:22,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 12:05:22,295 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:22,295 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:22,295 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:22,295 INFO L82 PathProgramCache]: Analyzing trace with hash -546988645, now seen corresponding path program 1 times [2018-01-24 12:05:22,295 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:22,295 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:22,296 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:22,296 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:22,296 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:22,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:22,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:22,357 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:22,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:05:22,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:05:22,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:05:22,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:05:22,358 INFO L87 Difference]: Start difference. First operand 270 states and 344 transitions. Second operand 5 states. [2018-01-24 12:05:22,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:22,590 INFO L93 Difference]: Finished difference Result 405 states and 504 transitions. [2018-01-24 12:05:22,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:05:22,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-24 12:05:22,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:22,593 INFO L225 Difference]: With dead ends: 405 [2018-01-24 12:05:22,593 INFO L226 Difference]: Without dead ends: 404 [2018-01-24 12:05:22,593 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:05:22,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-01-24 12:05:22,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 269. [2018-01-24 12:05:22,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-01-24 12:05:22,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 342 transitions. [2018-01-24 12:05:22,612 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 342 transitions. Word has length 29 [2018-01-24 12:05:22,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:22,612 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 342 transitions. [2018-01-24 12:05:22,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:05:22,612 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 342 transitions. [2018-01-24 12:05:22,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 12:05:22,613 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:22,613 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:22,613 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:22,613 INFO L82 PathProgramCache]: Analyzing trace with hash -232740570, now seen corresponding path program 1 times [2018-01-24 12:05:22,613 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:22,613 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:22,614 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:22,614 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:22,614 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:22,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:22,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:22,774 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:22,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:05:22,775 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:05:22,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:05:22,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:05:22,775 INFO L87 Difference]: Start difference. First operand 269 states and 342 transitions. Second operand 9 states. [2018-01-24 12:05:23,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:23,206 INFO L93 Difference]: Finished difference Result 356 states and 460 transitions. [2018-01-24 12:05:23,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:05:23,206 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-01-24 12:05:23,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:23,208 INFO L225 Difference]: With dead ends: 356 [2018-01-24 12:05:23,208 INFO L226 Difference]: Without dead ends: 355 [2018-01-24 12:05:23,208 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:05:23,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-01-24 12:05:23,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 268. [2018-01-24 12:05:23,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-01-24 12:05:23,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 341 transitions. [2018-01-24 12:05:23,220 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 341 transitions. Word has length 32 [2018-01-24 12:05:23,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:23,220 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 341 transitions. [2018-01-24 12:05:23,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:05:23,220 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 341 transitions. [2018-01-24 12:05:23,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 12:05:23,220 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:23,221 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:23,221 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:23,221 INFO L82 PathProgramCache]: Analyzing trace with hash -232740571, now seen corresponding path program 1 times [2018-01-24 12:05:23,221 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:23,221 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:23,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:23,222 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:23,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:23,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:23,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:23,370 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:05:23,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:05:23,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:05:23,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:05:23,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:05:23,370 INFO L87 Difference]: Start difference. First operand 268 states and 341 transitions. Second operand 9 states. [2018-01-24 12:05:23,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:05:23,655 INFO L93 Difference]: Finished difference Result 355 states and 459 transitions. [2018-01-24 12:05:23,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:05:23,656 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-01-24 12:05:23,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:05:23,657 INFO L225 Difference]: With dead ends: 355 [2018-01-24 12:05:23,658 INFO L226 Difference]: Without dead ends: 354 [2018-01-24 12:05:23,658 INFO L525 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-24 12:05:23,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-01-24 12:05:23,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 267. [2018-01-24 12:05:23,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-01-24 12:05:23,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 340 transitions. [2018-01-24 12:05:23,668 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 340 transitions. Word has length 32 [2018-01-24 12:05:23,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:05:23,668 INFO L432 AbstractCegarLoop]: Abstraction has 267 states and 340 transitions. [2018-01-24 12:05:23,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:05:23,669 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 340 transitions. [2018-01-24 12:05:23,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 12:05:23,669 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:05:23,669 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:05:23,669 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:05:23,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1058981609, now seen corresponding path program 1 times [2018-01-24 12:05:23,669 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:05:23,669 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:05:23,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:23,670 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:23,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:05:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:23,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:05:24,126 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:24,126 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:05:24,127 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-24 12:05:24,132 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:05:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:05:24,155 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:05:24,255 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:05:24,256 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:05:24,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 12:05:24,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:24,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:24,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:38 [2018-01-24 12:05:24,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-24 12:05:24,306 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:05:24,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 12:05:24,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:24,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:24,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-24 12:05:24,331 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:05:24,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 12:05:24,332 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:24,336 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:24,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:24,347 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:61, output treesize:56 [2018-01-24 12:05:24,414 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 75 treesize of output 79 [2018-01-24 12:05:24,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-24 12:05:24,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:24,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:24,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-01-24 12:05:24,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-24 12:05:24,444 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:24,449 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:24,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:05:24,462 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:102, output treesize:82 [2018-01-24 12:05:24,549 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 105 treesize of output 91 [2018-01-24 12:05:24,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-01-24 12:05:24,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:24,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:24,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2018-01-24 12:05:24,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-01-24 12:05:24,584 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:24,591 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:24,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:05:24,607 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:126, output treesize:106 [2018-01-24 12:05:30,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-01-24 12:05:30,723 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:05:30,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-01-24 12:05:30,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:30,729 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-24 12:05:30,730 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:05:30,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:05:30,739 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-24 12:05:30,739 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:94, output treesize:59 [2018-01-24 12:05:30,829 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:05:30,850 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:05:30,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 33 [2018-01-24 12:05:30,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-24 12:05:30,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-24 12:05:30,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=890, Unknown=3, NotChecked=0, Total=1056 [2018-01-24 12:05:30,851 INFO L87 Difference]: Start difference. First operand 267 states and 340 transitions. Second operand 33 states. Received shutdown request... [2018-01-24 12:06:20,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-24 12:06:20,669 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 12:06:20,673 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 12:06:20,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:06:20 BoogieIcfgContainer [2018-01-24 12:06:20,674 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:06:20,674 INFO L168 Benchmark]: Toolchain (without parser) took 67154.95 ms. Allocated memory was 304.6 MB in the beginning and 605.0 MB in the end (delta: 300.4 MB). Free memory was 263.7 MB in the beginning and 492.9 MB in the end (delta: -229.2 MB). Peak memory consumption was 71.2 MB. Max. memory is 5.3 GB. [2018-01-24 12:06:20,676 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 304.6 MB. Free memory is still 269.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:06:20,676 INFO L168 Benchmark]: CACSL2BoogieTranslator took 200.78 ms. Allocated memory is still 304.6 MB. Free memory was 263.7 MB in the beginning and 251.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:06:20,676 INFO L168 Benchmark]: Boogie Preprocessor took 39.31 ms. Allocated memory is still 304.6 MB. Free memory was 251.7 MB in the beginning and 249.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:06:20,677 INFO L168 Benchmark]: RCFGBuilder took 517.65 ms. Allocated memory is still 304.6 MB. Free memory was 249.7 MB in the beginning and 217.2 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 5.3 GB. [2018-01-24 12:06:20,677 INFO L168 Benchmark]: TraceAbstraction took 66388.98 ms. Allocated memory was 304.6 MB in the beginning and 605.0 MB in the end (delta: 300.4 MB). Free memory was 217.2 MB in the beginning and 492.9 MB in the end (delta: -275.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 5.3 GB. [2018-01-24 12:06:20,679 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.23 ms. Allocated memory is still 304.6 MB. Free memory is still 269.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 200.78 ms. Allocated memory is still 304.6 MB. Free memory was 263.7 MB in the beginning and 251.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.31 ms. Allocated memory is still 304.6 MB. Free memory was 251.7 MB in the beginning and 249.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 517.65 ms. Allocated memory is still 304.6 MB. Free memory was 249.7 MB in the beginning and 217.2 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 66388.98 ms. Allocated memory was 304.6 MB in the beginning and 605.0 MB in the end (delta: 300.4 MB). Free memory was 217.2 MB in the beginning and 492.9 MB in the end (delta: -275.7 MB). Peak memory consumption was 24.7 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 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (267states) and interpolant automaton (currently 27 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 53 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 130 locations, 55 error locations. TIMEOUT Result, 66.3s OverallTime, 23 OverallIterations, 3 TraceHistogramMax, 56.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2378 SDtfs, 4828 SDslu, 5269 SDs, 0 SdLazy, 5317 SolverSat, 313 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 13.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 299 GetRequests, 93 SyntacticMatches, 6 SemanticMatches, 199 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 47.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=273occurred in iteration=16, 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, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 1446 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 643 NumberOfCodeBlocks, 643 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 618 ConstructedInterpolants, 15 QuantifiedInterpolants, 181529 SizeOfPredicates, 22 NumberOfNonLiveVariables, 302 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 25 InterpolantComputations, 21 PerfectInterpolantSequences, 22/42 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: 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_cnstr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-06-20-690.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_cnstr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-06-20-690.csv Completed graceful shutdown