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/forester-heap/dll-optional_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:35:11,964 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:35:11,966 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:35:11,981 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:35:11,982 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:35:11,982 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:35:11,983 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:35:11,985 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:35:11,987 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:35:11,988 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:35:11,989 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:35:11,989 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:35:11,990 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:35:11,991 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:35:11,992 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:35:11,994 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:35:11,996 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:35:11,998 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:35:11,999 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:35:12,001 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:35:12,003 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:35:12,003 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:35:12,003 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:35:12,004 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:35:12,005 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:35:12,006 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:35:12,007 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:35:12,007 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:35:12,007 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:35:12,008 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:35:12,008 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:35:12,009 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:35:12,018 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:35:12,018 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:35:12,019 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:35:12,019 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:35:12,019 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:35:12,019 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:35:12,019 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:35:12,019 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:35:12,019 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:35:12,020 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:35:12,020 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:35:12,020 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:35:12,020 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:35:12,020 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:35:12,020 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:35:12,020 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:35:12,020 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:35:12,021 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:35:12,021 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:35:12,021 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:35:12,021 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:35:12,021 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:35:12,021 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:35:12,022 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:35:12,022 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:35:12,022 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:35:12,022 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:35:12,022 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:35:12,022 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:35:12,023 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:35:12,023 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:35:12,023 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:35:12,023 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:35:12,023 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:35:12,054 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:35:12,064 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:35:12,067 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:35:12,069 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:35:12,069 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:35:12,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-optional_true-unreach-call_true-valid-memsafety.i [2018-01-24 12:35:12,258 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:35:12,263 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:35:12,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:35:12,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:35:12,269 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:35:12,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:35:12" (1/1) ... [2018-01-24 12:35:12,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@428be157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:35:12, skipping insertion in model container [2018-01-24 12:35:12,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:35:12" (1/1) ... [2018-01-24 12:35:12,287 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:35:12,326 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:35:12,440 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:35:12,459 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:35:12,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:35:12 WrapperNode [2018-01-24 12:35:12,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:35:12,467 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:35:12,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:35:12,467 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:35:12,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:35:12" (1/1) ... [2018-01-24 12:35:12,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:35:12" (1/1) ... [2018-01-24 12:35:12,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:35:12" (1/1) ... [2018-01-24 12:35:12,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:35:12" (1/1) ... [2018-01-24 12:35:12,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:35:12" (1/1) ... [2018-01-24 12:35:12,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:35:12" (1/1) ... [2018-01-24 12:35:12,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:35:12" (1/1) ... [2018-01-24 12:35:12,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:35:12,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:35:12,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:35:12,506 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:35:12,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:35:12" (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:35:12,551 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:35:12,551 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:35:12,551 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:35:12,551 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 12:35:12,551 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 12:35:12,551 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:35:12,551 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:35:12,552 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:35:12,552 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:35:12,552 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:35:12,552 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 12:35:12,552 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 12:35:12,552 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:35:12,553 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 12:35:12,553 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:35:12,553 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:35:12,553 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:35:13,076 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:35:13,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:35:13 BoogieIcfgContainer [2018-01-24 12:35:13,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:35:13,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:35:13,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:35:13,080 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:35:13,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:35:12" (1/3) ... [2018-01-24 12:35:13,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e728a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:35:13, skipping insertion in model container [2018-01-24 12:35:13,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:35:12" (2/3) ... [2018-01-24 12:35:13,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e728a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:35:13, skipping insertion in model container [2018-01-24 12:35:13,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:35:13" (3/3) ... [2018-01-24 12:35:13,083 INFO L105 eAbstractionObserver]: Analyzing ICFG dll-optional_true-unreach-call_true-valid-memsafety.i [2018-01-24 12:35:13,090 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:35:13,096 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 69 error locations. [2018-01-24 12:35:13,136 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:35:13,136 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:35:13,136 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:35:13,136 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:35:13,136 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:35:13,136 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:35:13,136 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:35:13,137 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:35:13,137 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:35:13,157 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2018-01-24 12:35:13,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 12:35:13,163 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:35:13,164 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:35:13,164 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:35:13,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1266701268, now seen corresponding path program 1 times [2018-01-24 12:35:13,169 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:35:13,170 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:35:13,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:13,212 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:13,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:13,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:35:13,315 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:35:13,317 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:35:13,318 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:35:13,319 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:35:13,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:35:13,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:35:13,332 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 4 states. [2018-01-24 12:35:13,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:35:13,718 INFO L93 Difference]: Finished difference Result 237 states and 270 transitions. [2018-01-24 12:35:13,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:35:13,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 12:35:13,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:35:13,731 INFO L225 Difference]: With dead ends: 237 [2018-01-24 12:35:13,731 INFO L226 Difference]: Without dead ends: 163 [2018-01-24 12:35:13,735 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:35:13,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-01-24 12:35:13,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 142. [2018-01-24 12:35:13,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-24 12:35:13,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2018-01-24 12:35:13,778 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 8 [2018-01-24 12:35:13,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:35:13,778 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2018-01-24 12:35:13,778 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:35:13,779 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2018-01-24 12:35:13,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 12:35:13,779 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:35:13,779 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:35:13,779 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:35:13,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1266701269, now seen corresponding path program 1 times [2018-01-24 12:35:13,780 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:35:13,780 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:35:13,781 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:13,781 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:13,781 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:13,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:35:13,873 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:35:13,873 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:35:13,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:35:13,875 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:35:13,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:35:13,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:35:13,876 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 4 states. [2018-01-24 12:35:14,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:35:14,112 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2018-01-24 12:35:14,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:35:14,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 12:35:14,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:35:14,114 INFO L225 Difference]: With dead ends: 147 [2018-01-24 12:35:14,114 INFO L226 Difference]: Without dead ends: 138 [2018-01-24 12:35:14,116 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:35:14,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-24 12:35:14,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 133. [2018-01-24 12:35:14,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-24 12:35:14,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2018-01-24 12:35:14,126 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 8 [2018-01-24 12:35:14,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:35:14,127 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2018-01-24 12:35:14,127 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:35:14,127 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2018-01-24 12:35:14,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 12:35:14,127 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:35:14,127 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:35:14,128 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:35:14,128 INFO L82 PathProgramCache]: Analyzing trace with hash -235797476, now seen corresponding path program 1 times [2018-01-24 12:35:14,128 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:35:14,128 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:35:14,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:14,129 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:14,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:14,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:35:14,194 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:35:14,194 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:35:14,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:35:14,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:35:14,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:35:14,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:35:14,195 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand 5 states. [2018-01-24 12:35:14,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:35:14,547 INFO L93 Difference]: Finished difference Result 286 states and 310 transitions. [2018-01-24 12:35:14,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:35:14,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-24 12:35:14,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:35:14,551 INFO L225 Difference]: With dead ends: 286 [2018-01-24 12:35:14,551 INFO L226 Difference]: Without dead ends: 285 [2018-01-24 12:35:14,552 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:35:14,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-01-24 12:35:14,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 132. [2018-01-24 12:35:14,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-24 12:35:14,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2018-01-24 12:35:14,570 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 16 [2018-01-24 12:35:14,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:35:14,570 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2018-01-24 12:35:14,570 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:35:14,570 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2018-01-24 12:35:14,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 12:35:14,571 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:35:14,571 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:35:14,571 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:35:14,571 INFO L82 PathProgramCache]: Analyzing trace with hash -235797475, now seen corresponding path program 1 times [2018-01-24 12:35:14,572 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:35:14,572 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:35:14,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:14,573 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:14,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:14,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:35:14,658 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:35:14,658 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:35:14,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:35:14,659 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:35:14,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:35:14,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:35:14,660 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand 5 states. [2018-01-24 12:35:14,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:35:14,976 INFO L93 Difference]: Finished difference Result 241 states and 261 transitions. [2018-01-24 12:35:14,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:35:14,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-24 12:35:14,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:35:14,979 INFO L225 Difference]: With dead ends: 241 [2018-01-24 12:35:14,979 INFO L226 Difference]: Without dead ends: 240 [2018-01-24 12:35:14,979 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:35:14,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-01-24 12:35:14,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 131. [2018-01-24 12:35:14,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-24 12:35:14,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2018-01-24 12:35:14,991 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 16 [2018-01-24 12:35:14,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:35:14,992 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2018-01-24 12:35:14,992 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:35:14,992 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2018-01-24 12:35:14,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 12:35:14,993 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:35:14,993 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:35:14,993 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:35:14,993 INFO L82 PathProgramCache]: Analyzing trace with hash -2104820849, now seen corresponding path program 1 times [2018-01-24 12:35:14,994 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:35:14,994 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:35:14,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:14,995 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:14,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:15,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:35:15,101 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:35:15,101 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:35:15,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:35:15,101 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:35:15,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:35:15,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:35:15,102 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand 4 states. [2018-01-24 12:35:15,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:35:15,282 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2018-01-24 12:35:15,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:35:15,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-24 12:35:15,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:35:15,283 INFO L225 Difference]: With dead ends: 151 [2018-01-24 12:35:15,283 INFO L226 Difference]: Without dead ends: 134 [2018-01-24 12:35:15,284 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 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:35:15,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-24 12:35:15,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 126. [2018-01-24 12:35:15,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-24 12:35:15,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2018-01-24 12:35:15,295 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 20 [2018-01-24 12:35:15,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:35:15,295 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2018-01-24 12:35:15,296 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:35:15,296 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2018-01-24 12:35:15,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 12:35:15,296 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:35:15,297 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:35:15,297 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:35:15,297 INFO L82 PathProgramCache]: Analyzing trace with hash -2104820848, now seen corresponding path program 1 times [2018-01-24 12:35:15,297 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:35:15,297 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:35:15,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:15,298 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:15,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:15,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:35:15,384 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:35:15,384 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:35:15,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:35:15,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:35:15,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:35:15,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:35:15,385 INFO L87 Difference]: Start difference. First operand 126 states and 142 transitions. Second operand 7 states. [2018-01-24 12:35:15,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:35:15,564 INFO L93 Difference]: Finished difference Result 188 states and 206 transitions. [2018-01-24 12:35:15,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:35:15,564 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-01-24 12:35:15,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:35:15,565 INFO L225 Difference]: With dead ends: 188 [2018-01-24 12:35:15,565 INFO L226 Difference]: Without dead ends: 176 [2018-01-24 12:35:15,565 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:35:15,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-24 12:35:15,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 157. [2018-01-24 12:35:15,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-24 12:35:15,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2018-01-24 12:35:15,576 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 20 [2018-01-24 12:35:15,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:35:15,576 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2018-01-24 12:35:15,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:35:15,576 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2018-01-24 12:35:15,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:35:15,577 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:35:15,577 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:35:15,577 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:35:15,577 INFO L82 PathProgramCache]: Analyzing trace with hash 196761554, now seen corresponding path program 1 times [2018-01-24 12:35:15,578 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:35:15,578 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:35:15,578 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:15,579 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:15,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:15,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:35:15,628 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:35:15,628 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:35:15,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:35:15,629 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:35:15,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:35:15,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:35:15,630 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand 5 states. [2018-01-24 12:35:15,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:35:15,891 INFO L93 Difference]: Finished difference Result 222 states and 258 transitions. [2018-01-24 12:35:15,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:35:15,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-24 12:35:15,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:35:15,893 INFO L225 Difference]: With dead ends: 222 [2018-01-24 12:35:15,893 INFO L226 Difference]: Without dead ends: 221 [2018-01-24 12:35:15,894 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:35:15,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-01-24 12:35:15,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 156. [2018-01-24 12:35:15,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-24 12:35:15,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 180 transitions. [2018-01-24 12:35:15,906 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 180 transitions. Word has length 22 [2018-01-24 12:35:15,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:35:15,906 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 180 transitions. [2018-01-24 12:35:15,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:35:15,907 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 180 transitions. [2018-01-24 12:35:15,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:35:15,907 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:35:15,907 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:35:15,907 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:35:15,907 INFO L82 PathProgramCache]: Analyzing trace with hash 196761555, now seen corresponding path program 1 times [2018-01-24 12:35:15,908 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:35:15,908 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:35:15,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:15,908 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:15,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:15,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:35:16,070 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:35:16,070 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:35:16,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:35:16,071 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:35:16,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:35:16,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:35:16,071 INFO L87 Difference]: Start difference. First operand 156 states and 180 transitions. Second operand 5 states. [2018-01-24 12:35:16,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:35:16,375 INFO L93 Difference]: Finished difference Result 241 states and 282 transitions. [2018-01-24 12:35:16,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:35:16,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-24 12:35:16,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:35:16,376 INFO L225 Difference]: With dead ends: 241 [2018-01-24 12:35:16,376 INFO L226 Difference]: Without dead ends: 240 [2018-01-24 12:35:16,377 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:35:16,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-01-24 12:35:16,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 155. [2018-01-24 12:35:16,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-01-24 12:35:16,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 178 transitions. [2018-01-24 12:35:16,384 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 178 transitions. Word has length 22 [2018-01-24 12:35:16,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:35:16,385 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 178 transitions. [2018-01-24 12:35:16,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:35:16,385 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 178 transitions. [2018-01-24 12:35:16,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 12:35:16,386 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:35:16,386 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:35:16,386 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:35:16,386 INFO L82 PathProgramCache]: Analyzing trace with hash 2133980856, now seen corresponding path program 1 times [2018-01-24 12:35:16,386 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:35:16,387 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:35:16,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:16,387 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:16,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:16,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:16,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:35:16,434 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:35:16,434 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:35:16,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:35:16,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:35:16,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:35:16,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:35:16,435 INFO L87 Difference]: Start difference. First operand 155 states and 178 transitions. Second operand 5 states. [2018-01-24 12:35:16,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:35:16,581 INFO L93 Difference]: Finished difference Result 202 states and 228 transitions. [2018-01-24 12:35:16,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:35:16,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-24 12:35:16,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:35:16,582 INFO L225 Difference]: With dead ends: 202 [2018-01-24 12:35:16,582 INFO L226 Difference]: Without dead ends: 167 [2018-01-24 12:35:16,583 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:35:16,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-01-24 12:35:16,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 155. [2018-01-24 12:35:16,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-01-24 12:35:16,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 176 transitions. [2018-01-24 12:35:16,591 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 176 transitions. Word has length 26 [2018-01-24 12:35:16,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:35:16,592 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 176 transitions. [2018-01-24 12:35:16,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:35:16,592 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 176 transitions. [2018-01-24 12:35:16,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 12:35:16,593 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:35:16,593 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:35:16,593 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:35:16,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1951923348, now seen corresponding path program 1 times [2018-01-24 12:35:16,593 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:35:16,593 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:35:16,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:16,594 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:16,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:16,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:35:16,682 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:35:16,682 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:35:16,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:35:16,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:35:16,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:35:16,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:35:16,683 INFO L87 Difference]: Start difference. First operand 155 states and 176 transitions. Second operand 9 states. [2018-01-24 12:35:17,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:35:17,173 INFO L93 Difference]: Finished difference Result 156 states and 176 transitions. [2018-01-24 12:35:17,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:35:17,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-01-24 12:35:17,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:35:17,174 INFO L225 Difference]: With dead ends: 156 [2018-01-24 12:35:17,175 INFO L226 Difference]: Without dead ends: 155 [2018-01-24 12:35:17,175 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:35:17,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-24 12:35:17,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2018-01-24 12:35:17,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-24 12:35:17,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 175 transitions. [2018-01-24 12:35:17,186 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 175 transitions. Word has length 26 [2018-01-24 12:35:17,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:35:17,186 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 175 transitions. [2018-01-24 12:35:17,186 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:35:17,186 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 175 transitions. [2018-01-24 12:35:17,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 12:35:17,187 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:35:17,187 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:35:17,188 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:35:17,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1951923349, now seen corresponding path program 1 times [2018-01-24 12:35:17,188 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:35:17,188 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:35:17,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:17,189 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:17,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:17,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:35:17,362 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:35:17,363 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:35:17,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 12:35:17,363 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:35:17,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:35:17,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:35:17,364 INFO L87 Difference]: Start difference. First operand 154 states and 175 transitions. Second operand 10 states. [2018-01-24 12:35:18,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:35:18,084 INFO L93 Difference]: Finished difference Result 157 states and 177 transitions. [2018-01-24 12:35:18,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 12:35:18,085 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-01-24 12:35:18,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:35:18,085 INFO L225 Difference]: With dead ends: 157 [2018-01-24 12:35:18,085 INFO L226 Difference]: Without dead ends: 146 [2018-01-24 12:35:18,086 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:35:18,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-24 12:35:18,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 134. [2018-01-24 12:35:18,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-24 12:35:18,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 154 transitions. [2018-01-24 12:35:18,096 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 154 transitions. Word has length 26 [2018-01-24 12:35:18,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:35:18,096 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 154 transitions. [2018-01-24 12:35:18,096 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:35:18,096 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 154 transitions. [2018-01-24 12:35:18,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 12:35:18,097 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:35:18,097 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:35:18,097 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:35:18,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1846863039, now seen corresponding path program 1 times [2018-01-24 12:35:18,098 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:35:18,098 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:35:18,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:18,099 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:18,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:18,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:35:18,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:35:18,144 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:35:18,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:35:18,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:35:18,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:35:18,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:35:18,145 INFO L87 Difference]: Start difference. First operand 134 states and 154 transitions. Second operand 4 states. [2018-01-24 12:35:18,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:35:18,169 INFO L93 Difference]: Finished difference Result 234 states and 273 transitions. [2018-01-24 12:35:18,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:35:18,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-01-24 12:35:18,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:35:18,170 INFO L225 Difference]: With dead ends: 234 [2018-01-24 12:35:18,171 INFO L226 Difference]: Without dead ends: 160 [2018-01-24 12:35:18,171 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:35:18,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-24 12:35:18,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 138. [2018-01-24 12:35:18,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-24 12:35:18,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 158 transitions. [2018-01-24 12:35:18,181 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 158 transitions. Word has length 29 [2018-01-24 12:35:18,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:35:18,182 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 158 transitions. [2018-01-24 12:35:18,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:35:18,182 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 158 transitions. [2018-01-24 12:35:18,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 12:35:18,183 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:35:18,183 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:35:18,183 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:35:18,183 INFO L82 PathProgramCache]: Analyzing trace with hash 2044037406, now seen corresponding path program 1 times [2018-01-24 12:35:18,184 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:35:18,184 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:35:18,184 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:18,185 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:18,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:18,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:35:18,281 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:35:18,282 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:35:18,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:35:18,282 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:35:18,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:35:18,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:35:18,283 INFO L87 Difference]: Start difference. First operand 138 states and 158 transitions. Second operand 8 states. [2018-01-24 12:35:18,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:35:18,659 INFO L93 Difference]: Finished difference Result 252 states and 286 transitions. [2018-01-24 12:35:18,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:35:18,659 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-01-24 12:35:18,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:35:18,661 INFO L225 Difference]: With dead ends: 252 [2018-01-24 12:35:18,661 INFO L226 Difference]: Without dead ends: 251 [2018-01-24 12:35:18,661 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:35:18,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-01-24 12:35:18,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 155. [2018-01-24 12:35:18,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-01-24 12:35:18,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 179 transitions. [2018-01-24 12:35:18,674 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 179 transitions. Word has length 31 [2018-01-24 12:35:18,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:35:18,674 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 179 transitions. [2018-01-24 12:35:18,674 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:35:18,674 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 179 transitions. [2018-01-24 12:35:18,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 12:35:18,675 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:35:18,675 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:35:18,676 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:35:18,676 INFO L82 PathProgramCache]: Analyzing trace with hash 2044037407, now seen corresponding path program 1 times [2018-01-24 12:35:18,676 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:35:18,676 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:35:18,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:18,677 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:18,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:18,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:35:18,750 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:35:18,750 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:35:18,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:35:18,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:35:18,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:35:18,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:35:18,751 INFO L87 Difference]: Start difference. First operand 155 states and 179 transitions. Second operand 7 states. [2018-01-24 12:35:19,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:35:19,037 INFO L93 Difference]: Finished difference Result 342 states and 391 transitions. [2018-01-24 12:35:19,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 12:35:19,038 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-01-24 12:35:19,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:35:19,040 INFO L225 Difference]: With dead ends: 342 [2018-01-24 12:35:19,040 INFO L226 Difference]: Without dead ends: 266 [2018-01-24 12:35:19,041 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:35:19,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-01-24 12:35:19,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 151. [2018-01-24 12:35:19,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-24 12:35:19,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 173 transitions. [2018-01-24 12:35:19,054 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 173 transitions. Word has length 31 [2018-01-24 12:35:19,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:35:19,055 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 173 transitions. [2018-01-24 12:35:19,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:35:19,058 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 173 transitions. [2018-01-24 12:35:19,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 12:35:19,059 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:35:19,060 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:35:19,060 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:35:19,060 INFO L82 PathProgramCache]: Analyzing trace with hash -638053953, now seen corresponding path program 1 times [2018-01-24 12:35:19,060 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:35:19,060 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:35:19,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:19,061 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:19,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:19,074 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:35:19,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:35:19,112 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:35:19,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:35:19,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:35:19,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:35:19,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:35:19,113 INFO L87 Difference]: Start difference. First operand 151 states and 173 transitions. Second operand 5 states. [2018-01-24 12:35:19,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:35:19,457 INFO L93 Difference]: Finished difference Result 259 states and 296 transitions. [2018-01-24 12:35:19,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:35:19,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-24 12:35:19,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:35:19,458 INFO L225 Difference]: With dead ends: 259 [2018-01-24 12:35:19,459 INFO L226 Difference]: Without dead ends: 258 [2018-01-24 12:35:19,459 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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:35:19,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-01-24 12:35:19,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 150. [2018-01-24 12:35:19,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-24 12:35:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 172 transitions. [2018-01-24 12:35:19,468 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 172 transitions. Word has length 33 [2018-01-24 12:35:19,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:35:19,469 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 172 transitions. [2018-01-24 12:35:19,469 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:35:19,469 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 172 transitions. [2018-01-24 12:35:19,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 12:35:19,470 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:35:19,470 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:35:19,470 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:35:19,470 INFO L82 PathProgramCache]: Analyzing trace with hash -638053952, now seen corresponding path program 1 times [2018-01-24 12:35:19,470 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:35:19,470 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:35:19,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:19,471 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:19,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:19,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:35:19,560 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:35:19,560 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:35:19,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:35:19,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:35:19,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:35:19,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:35:19,561 INFO L87 Difference]: Start difference. First operand 150 states and 172 transitions. Second operand 5 states. [2018-01-24 12:35:19,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:35:19,939 INFO L93 Difference]: Finished difference Result 259 states and 299 transitions. [2018-01-24 12:35:19,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:35:19,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-24 12:35:19,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:35:19,941 INFO L225 Difference]: With dead ends: 259 [2018-01-24 12:35:19,941 INFO L226 Difference]: Without dead ends: 258 [2018-01-24 12:35:19,942 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:35:19,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-01-24 12:35:19,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 149. [2018-01-24 12:35:19,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-24 12:35:19,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 171 transitions. [2018-01-24 12:35:19,954 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 171 transitions. Word has length 33 [2018-01-24 12:35:19,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:35:19,954 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 171 transitions. [2018-01-24 12:35:19,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:35:19,955 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 171 transitions. [2018-01-24 12:35:19,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 12:35:19,955 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:35:19,956 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:35:19,956 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:35:19,956 INFO L82 PathProgramCache]: Analyzing trace with hash 851008324, now seen corresponding path program 1 times [2018-01-24 12:35:19,956 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:35:19,956 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:35:19,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:19,957 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:19,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:19,971 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:35:20,097 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:35:20,097 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:35:20,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:35:20,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:35:20,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:35:20,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:35:20,134 INFO L87 Difference]: Start difference. First operand 149 states and 171 transitions. Second operand 9 states. [2018-01-24 12:35:20,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:35:20,807 INFO L93 Difference]: Finished difference Result 412 states and 468 transitions. [2018-01-24 12:35:20,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 12:35:20,808 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-01-24 12:35:20,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:35:20,810 INFO L225 Difference]: With dead ends: 412 [2018-01-24 12:35:20,810 INFO L226 Difference]: Without dead ends: 411 [2018-01-24 12:35:20,810 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2018-01-24 12:35:20,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-01-24 12:35:20,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 165. [2018-01-24 12:35:20,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-01-24 12:35:20,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 191 transitions. [2018-01-24 12:35:20,825 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 191 transitions. Word has length 34 [2018-01-24 12:35:20,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:35:20,826 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 191 transitions. [2018-01-24 12:35:20,826 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:35:20,826 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 191 transitions. [2018-01-24 12:35:20,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 12:35:20,827 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:35:20,827 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:35:20,827 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:35:20,827 INFO L82 PathProgramCache]: Analyzing trace with hash 851008325, now seen corresponding path program 1 times [2018-01-24 12:35:20,827 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:35:20,827 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:35:20,828 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:20,828 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:20,828 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:20,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:35:20,962 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:35:20,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:35:20,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:35:20,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:35:20,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:35:20,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:35:20,963 INFO L87 Difference]: Start difference. First operand 165 states and 191 transitions. Second operand 9 states. [2018-01-24 12:35:21,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:35:21,521 INFO L93 Difference]: Finished difference Result 319 states and 362 transitions. [2018-01-24 12:35:21,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:35:21,522 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-01-24 12:35:21,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:35:21,523 INFO L225 Difference]: With dead ends: 319 [2018-01-24 12:35:21,524 INFO L226 Difference]: Without dead ends: 318 [2018-01-24 12:35:21,524 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:35:21,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-01-24 12:35:21,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 165. [2018-01-24 12:35:21,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-01-24 12:35:21,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 190 transitions. [2018-01-24 12:35:21,539 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 190 transitions. Word has length 34 [2018-01-24 12:35:21,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:35:21,539 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 190 transitions. [2018-01-24 12:35:21,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:35:21,539 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 190 transitions. [2018-01-24 12:35:21,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 12:35:21,540 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:35:21,540 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:35:21,540 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:35:21,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1753433128, now seen corresponding path program 1 times [2018-01-24 12:35:21,541 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:35:21,541 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:35:21,542 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:21,542 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:21,542 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:21,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:35:21,595 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:35:21,595 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:35:21,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:35:21,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:35:21,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:35:21,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:35:21,596 INFO L87 Difference]: Start difference. First operand 165 states and 190 transitions. Second operand 5 states. [2018-01-24 12:35:21,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:35:21,651 INFO L93 Difference]: Finished difference Result 258 states and 297 transitions. [2018-01-24 12:35:21,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:35:21,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-01-24 12:35:21,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:35:21,653 INFO L225 Difference]: With dead ends: 258 [2018-01-24 12:35:21,653 INFO L226 Difference]: Without dead ends: 189 [2018-01-24 12:35:21,654 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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:35:21,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-01-24 12:35:21,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 169. [2018-01-24 12:35:21,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-01-24 12:35:21,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 194 transitions. [2018-01-24 12:35:21,669 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 194 transitions. Word has length 37 [2018-01-24 12:35:21,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:35:21,669 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 194 transitions. [2018-01-24 12:35:21,670 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:35:21,670 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 194 transitions. [2018-01-24 12:35:21,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 12:35:21,670 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:35:21,671 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:35:21,671 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:35:21,671 INFO L82 PathProgramCache]: Analyzing trace with hash -110193443, now seen corresponding path program 1 times [2018-01-24 12:35:21,671 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:35:21,671 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:35:21,672 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:21,672 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:21,672 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:21,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:35:21,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:35:21,822 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:35:21,822 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:35:21,831 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:21,880 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:35:21,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 12:35:21,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:35:21,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:21,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:21,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 12:35:21,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:35:21,992 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:21,994 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:22,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:22,000 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-01-24 12:35:22,039 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:35:22,042 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:22,045 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:35:22,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:22,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:22,067 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:35:22,070 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:22,071 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:35:22,071 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:22,077 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:22,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:22,086 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:36 [2018-01-24 12:35:22,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-01-24 12:35:22,129 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:22,130 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:22,131 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:22,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-01-24 12:35:22,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:22,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:22,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-01-24 12:35:22,165 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:22,167 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:22,168 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:22,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-01-24 12:35:22,171 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:22,180 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:22,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:22,211 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:74, output treesize:36 [2018-01-24 12:35:22,220 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 30 treesize of output 23 [2018-01-24 12:35:22,224 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:22,226 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:22,227 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:22,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-24 12:35:22,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:22,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:22,262 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 30 treesize of output 23 [2018-01-24 12:35:22,265 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:22,266 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:22,267 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:22,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-24 12:35:22,269 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:22,277 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:22,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:22,298 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:67, output treesize:54 [2018-01-24 12:35:22,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-01-24 12:35:22,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2018-01-24 12:35:22,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:22,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:22,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-01-24 12:35:22,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2018-01-24 12:35:22,527 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:22,545 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:22,548 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:35:22,548 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2018-01-24 12:35:22,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:35:22,605 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:35:22,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 12 [2018-01-24 12:35:22,605 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 12:35:22,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 12:35:22,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:35:22,606 INFO L87 Difference]: Start difference. First operand 169 states and 194 transitions. Second operand 12 states. [2018-01-24 12:35:23,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:35:23,314 INFO L93 Difference]: Finished difference Result 308 states and 348 transitions. [2018-01-24 12:35:23,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 12:35:23,314 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-01-24 12:35:23,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:35:23,316 INFO L225 Difference]: With dead ends: 308 [2018-01-24 12:35:23,316 INFO L226 Difference]: Without dead ends: 240 [2018-01-24 12:35:23,317 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=198, Invalid=504, Unknown=0, NotChecked=0, Total=702 [2018-01-24 12:35:23,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-01-24 12:35:23,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 184. [2018-01-24 12:35:23,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-01-24 12:35:23,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 210 transitions. [2018-01-24 12:35:23,338 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 210 transitions. Word has length 39 [2018-01-24 12:35:23,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:35:23,338 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 210 transitions. [2018-01-24 12:35:23,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 12:35:23,338 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 210 transitions. [2018-01-24 12:35:23,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-24 12:35:23,339 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:35:23,339 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:35:23,339 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:35:23,339 INFO L82 PathProgramCache]: Analyzing trace with hash 706151641, now seen corresponding path program 1 times [2018-01-24 12:35:23,340 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:35:23,340 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:35:23,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:23,341 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:23,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:23,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:35:23,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:35:23,478 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:35:23,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:35:23,479 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:35:23,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:35:23,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:35:23,479 INFO L87 Difference]: Start difference. First operand 184 states and 210 transitions. Second operand 8 states. [2018-01-24 12:35:23,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:35:23,745 INFO L93 Difference]: Finished difference Result 230 states and 259 transitions. [2018-01-24 12:35:23,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:35:23,745 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-01-24 12:35:23,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:35:23,746 INFO L225 Difference]: With dead ends: 230 [2018-01-24 12:35:23,747 INFO L226 Difference]: Without dead ends: 229 [2018-01-24 12:35:23,747 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:35:23,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-01-24 12:35:23,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 205. [2018-01-24 12:35:23,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-01-24 12:35:23,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 233 transitions. [2018-01-24 12:35:23,766 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 233 transitions. Word has length 46 [2018-01-24 12:35:23,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:35:23,767 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 233 transitions. [2018-01-24 12:35:23,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:35:23,767 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 233 transitions. [2018-01-24 12:35:23,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-24 12:35:23,768 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:35:23,768 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:35:23,768 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:35:23,768 INFO L82 PathProgramCache]: Analyzing trace with hash 706151642, now seen corresponding path program 1 times [2018-01-24 12:35:23,768 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:35:23,768 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:35:23,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:23,769 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:23,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:23,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:35:24,088 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:35:24,089 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:35:24,089 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:35:24,096 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:24,123 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:35:24,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 12:35:24,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 12:35:24,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:24,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:24,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:24,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-01-24 12:35:24,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-24 12:35:24,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 12:35:24,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:24,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:24,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:24,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:5 [2018-01-24 12:35:24,329 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:35:24,349 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:35:24,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2018-01-24 12:35:24,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 12:35:24,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 12:35:24,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:35:24,350 INFO L87 Difference]: Start difference. First operand 205 states and 233 transitions. Second operand 19 states. [2018-01-24 12:35:25,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:35:25,092 INFO L93 Difference]: Finished difference Result 318 states and 351 transitions. [2018-01-24 12:35:25,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 12:35:25,093 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2018-01-24 12:35:25,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:35:25,094 INFO L225 Difference]: With dead ends: 318 [2018-01-24 12:35:25,094 INFO L226 Difference]: Without dead ends: 289 [2018-01-24 12:35:25,095 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=356, Invalid=1126, Unknown=0, NotChecked=0, Total=1482 [2018-01-24 12:35:25,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-01-24 12:35:25,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 233. [2018-01-24 12:35:25,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-01-24 12:35:25,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 271 transitions. [2018-01-24 12:35:25,156 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 271 transitions. Word has length 46 [2018-01-24 12:35:25,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:35:25,157 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 271 transitions. [2018-01-24 12:35:25,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 12:35:25,157 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 271 transitions. [2018-01-24 12:35:25,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 12:35:25,158 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:35:25,158 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:35:25,158 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:35:25,159 INFO L82 PathProgramCache]: Analyzing trace with hash -28017197, now seen corresponding path program 1 times [2018-01-24 12:35:25,159 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:35:25,159 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:35:25,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:25,160 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:25,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:25,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:35:25,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:35:25,668 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:35:25,669 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:35:25,675 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:25,711 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:35:25,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 12:35:25,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 12:35:25,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:25,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:25,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:25,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-01-24 12:35:25,768 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:25,769 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:25,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:35:25,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:25,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:25,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2018-01-24 12:35:25,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-01-24 12:35:25,806 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:25,806 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:35:25,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:25,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:25,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:25,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:32 [2018-01-24 12:35:25,864 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:25,867 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 39 treesize of output 43 [2018-01-24 12:35:25,869 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:35:25,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:25,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:25,880 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:35:25,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-01-24 12:35:26,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2018-01-24 12:35:26,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 12:35:26,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:35:26,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:35:26,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 12:35:26,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:90 [2018-01-24 12:35:26,110 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:26,114 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 51 treesize of output 50 [2018-01-24 12:35:26,117 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:26,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-24 12:35:26,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:26,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:26,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:26,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:36 [2018-01-24 12:35:26,192 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 54 treesize of output 44 [2018-01-24 12:35:26,204 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:26,206 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 24 treesize of output 35 [2018-01-24 12:35:26,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:26,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:26,221 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:35:26,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2018-01-24 12:35:26,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 36 [2018-01-24 12:35:26,319 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:26,320 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 15 treesize of output 6 [2018-01-24 12:35:26,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:26,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-01-24 12:35:26,326 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:26,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:26,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:26,329 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:56, output treesize:5 [2018-01-24 12:35:26,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:35:26,372 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:35:26,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 27 [2018-01-24 12:35:26,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-24 12:35:26,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-24 12:35:26,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2018-01-24 12:35:26,374 INFO L87 Difference]: Start difference. First operand 233 states and 271 transitions. Second operand 28 states. [2018-01-24 12:35:27,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:35:27,762 INFO L93 Difference]: Finished difference Result 443 states and 505 transitions. [2018-01-24 12:35:27,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-24 12:35:27,763 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 47 [2018-01-24 12:35:27,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:35:27,765 INFO L225 Difference]: With dead ends: 443 [2018-01-24 12:35:27,765 INFO L226 Difference]: Without dead ends: 442 [2018-01-24 12:35:27,766 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 33 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=578, Invalid=2178, Unknown=0, NotChecked=0, Total=2756 [2018-01-24 12:35:27,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-01-24 12:35:27,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 264. [2018-01-24 12:35:27,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-01-24 12:35:27,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 308 transitions. [2018-01-24 12:35:27,790 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 308 transitions. Word has length 47 [2018-01-24 12:35:27,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:35:27,790 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 308 transitions. [2018-01-24 12:35:27,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-24 12:35:27,790 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 308 transitions. [2018-01-24 12:35:27,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 12:35:27,791 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:35:27,791 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:35:27,791 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:35:27,791 INFO L82 PathProgramCache]: Analyzing trace with hash -28017196, now seen corresponding path program 1 times [2018-01-24 12:35:27,791 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:35:27,792 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:35:27,792 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:27,792 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:27,792 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:27,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:35:28,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:35:28,420 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:35:28,420 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:35:28,429 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:28,457 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:35:28,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 12:35:28,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 12:35:28,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:28,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:28,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 12:35:28,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 12:35:28,586 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:28,587 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:28,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:28,592 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-01-24 12:35:28,607 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:28,608 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:28,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:35:28,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:28,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:28,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:34 [2018-01-24 12:35:28,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-01-24 12:35:28,642 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-24 12:35:28,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:28,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-01-24 12:35:28,646 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:28,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:28,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-01-24 12:35:28,688 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-24 12:35:28,688 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:28,691 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:28,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2018-01-24 12:35:28,692 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:28,698 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:28,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:28,707 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:62, output treesize:38 [2018-01-24 12:35:28,742 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 31 treesize of output 32 [2018-01-24 12:35:28,744 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:35:28,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:28,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:28,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2018-01-24 12:35:28,777 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:35:28,777 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:28,782 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:28,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:35:28,791 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:80, output treesize:64 [2018-01-24 12:35:28,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 44 [2018-01-24 12:35:28,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-01-24 12:35:28,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:35:28,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:35:28,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 65 [2018-01-24 12:35:28,967 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 16 treesize of output 15 [2018-01-24 12:35:28,967 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:28,980 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:28,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 73 [2018-01-24 12:35:29,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 12:35:29,001 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-24 12:35:29,017 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:35:29,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-24 12:35:29,056 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:90, output treesize:143 [2018-01-24 12:35:29,114 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:29,119 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 62 treesize of output 61 [2018-01-24 12:35:29,121 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:29,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-24 12:35:29,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:29,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:29,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 50 [2018-01-24 12:35:29,151 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:29,152 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 26 treesize of output 37 [2018-01-24 12:35:29,152 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:29,157 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:29,166 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:35:29,166 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:98, output treesize:56 [2018-01-24 12:35:29,195 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 86 treesize of output 76 [2018-01-24 12:35:29,198 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:29,199 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 24 treesize of output 35 [2018-01-24 12:35:29,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:29,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:29,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-01-24 12:35:29,237 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:29,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-01-24 12:35:29,238 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:29,243 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:29,254 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:35:29,254 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:103, output treesize:87 [2018-01-24 12:35:29,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 60 [2018-01-24 12:35:29,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-01-24 12:35:29,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:29,340 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:29,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2018-01-24 12:35:29,342 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:35:29,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:35:29,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-01-24 12:35:29,358 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 15 treesize of output 3 [2018-01-24 12:35:29,359 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:29,364 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:35:29,365 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 13 treesize of output 6 [2018-01-24 12:35:29,365 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:29,367 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:29,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:29,372 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:105, output treesize:10 [2018-01-24 12:35:29,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:35:29,447 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:35:29,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 27 [2018-01-24 12:35:29,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-24 12:35:29,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-24 12:35:29,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2018-01-24 12:35:29,449 INFO L87 Difference]: Start difference. First operand 264 states and 308 transitions. Second operand 27 states. [2018-01-24 12:35:32,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:35:32,250 INFO L93 Difference]: Finished difference Result 532 states and 606 transitions. [2018-01-24 12:35:32,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-24 12:35:32,250 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 47 [2018-01-24 12:35:32,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:35:32,252 INFO L225 Difference]: With dead ends: 532 [2018-01-24 12:35:32,252 INFO L226 Difference]: Without dead ends: 454 [2018-01-24 12:35:32,253 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 31 SyntacticMatches, 13 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=826, Invalid=3461, Unknown=3, NotChecked=0, Total=4290 [2018-01-24 12:35:32,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-01-24 12:35:32,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 262. [2018-01-24 12:35:32,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-01-24 12:35:32,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 304 transitions. [2018-01-24 12:35:32,279 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 304 transitions. Word has length 47 [2018-01-24 12:35:32,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:35:32,279 INFO L432 AbstractCegarLoop]: Abstraction has 262 states and 304 transitions. [2018-01-24 12:35:32,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-24 12:35:32,280 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 304 transitions. [2018-01-24 12:35:32,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 12:35:32,281 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:35:32,281 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:35:32,281 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:35:32,281 INFO L82 PathProgramCache]: Analyzing trace with hash 15490117, now seen corresponding path program 1 times [2018-01-24 12:35:32,281 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:35:32,281 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:35:32,282 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:32,282 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:32,282 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:32,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:35:32,387 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:35:32,387 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:35:32,387 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:35:32,391 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:32,410 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:35:32,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 12:35:32,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 12:35:32,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:32,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:32,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 12:35:32,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 12:35:32,440 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:35:32,441 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:32,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:35:32,445 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-01-24 12:35:32,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-24 12:35:32,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 17 [2018-01-24 12:35:32,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-24 12:35:32,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 12:35:32,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-24 12:35:32,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 17 [2018-01-24 12:35:32,645 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-24 12:35:32,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:35:32,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 12:35:32,669 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:38 [2018-01-24 12:35:32,913 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:35:32,934 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:35:32,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 20 [2018-01-24 12:35:32,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 12:35:32,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 12:35:32,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2018-01-24 12:35:32,935 INFO L87 Difference]: Start difference. First operand 262 states and 304 transitions. Second operand 20 states. [2018-01-24 12:35:34,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:35:34,179 INFO L93 Difference]: Finished difference Result 409 states and 465 transitions. [2018-01-24 12:35:34,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-24 12:35:34,179 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2018-01-24 12:35:34,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:35:34,180 INFO L225 Difference]: With dead ends: 409 [2018-01-24 12:35:34,180 INFO L226 Difference]: Without dead ends: 386 [2018-01-24 12:35:34,181 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=259, Invalid=1223, Unknown=0, NotChecked=0, Total=1482 [2018-01-24 12:35:34,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-01-24 12:35:34,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 289. [2018-01-24 12:35:34,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-01-24 12:35:34,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 337 transitions. [2018-01-24 12:35:34,213 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 337 transitions. Word has length 48 [2018-01-24 12:35:34,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:35:34,214 INFO L432 AbstractCegarLoop]: Abstraction has 289 states and 337 transitions. [2018-01-24 12:35:34,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 12:35:34,214 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 337 transitions. [2018-01-24 12:35:34,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-24 12:35:34,215 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:35:34,215 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:35:34,215 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:35:34,215 INFO L82 PathProgramCache]: Analyzing trace with hash 480192711, now seen corresponding path program 1 times [2018-01-24 12:35:34,215 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:35:34,215 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:35:34,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:34,216 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:34,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:34,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:35:34,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:35:34,327 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:35:34,327 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:35:34,332 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:34,352 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:35:34,457 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~head~5.base Int)) (and (= (store |c_old(#valid)| main_~head~5.base 0) |c_#valid|) (not (= 0 main_~head~5.base)) (= 0 (select |c_old(#valid)| main_~head~5.base)))) is different from true [2018-01-24 12:35:34,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2018-01-24 12:35:34,484 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:35:34,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-01-24 12:35:34,485 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:35:34,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:35:34,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2018-01-24 12:35:34,485 INFO L87 Difference]: Start difference. First operand 289 states and 337 transitions. Second operand 10 states. [2018-01-24 12:35:34,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:35:34,739 INFO L93 Difference]: Finished difference Result 314 states and 361 transitions. [2018-01-24 12:35:34,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:35:34,739 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2018-01-24 12:35:34,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:35:34,740 INFO L225 Difference]: With dead ends: 314 [2018-01-24 12:35:34,740 INFO L226 Difference]: Without dead ends: 280 [2018-01-24 12:35:34,740 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=95, Unknown=1, NotChecked=20, Total=156 [2018-01-24 12:35:34,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-01-24 12:35:34,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2018-01-24 12:35:34,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-01-24 12:35:34,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 326 transitions. [2018-01-24 12:35:34,758 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 326 transitions. Word has length 49 [2018-01-24 12:35:34,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:35:34,759 INFO L432 AbstractCegarLoop]: Abstraction has 280 states and 326 transitions. [2018-01-24 12:35:34,759 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:35:34,759 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 326 transitions. [2018-01-24 12:35:34,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-24 12:35:34,760 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:35:34,760 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:35:34,760 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 12:35:34,760 INFO L82 PathProgramCache]: Analyzing trace with hash -494189575, now seen corresponding path program 1 times [2018-01-24 12:35:34,760 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:35:34,760 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:35:34,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:34,761 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:35:34,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:35:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:35:34,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:35:34,869 ERROR L119 erpolLogProxyWrapper]: Interpolant 22 not inductive: (Check returned sat) [2018-01-24 12:35:34,883 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:1003) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:279) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-24 12:35:34,886 INFO L168 Benchmark]: Toolchain (without parser) took 22627.67 ms. Allocated memory was 293.1 MB in the beginning and 665.3 MB in the end (delta: 372.2 MB). Free memory was 253.1 MB in the beginning and 530.2 MB in the end (delta: -277.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:35:34,888 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 293.1 MB. Free memory is still 259.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:35:34,888 INFO L168 Benchmark]: CACSL2BoogieTranslator took 202.61 ms. Allocated memory is still 293.1 MB. Free memory was 252.1 MB in the beginning and 240.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:35:34,888 INFO L168 Benchmark]: Boogie Preprocessor took 38.38 ms. Allocated memory is still 293.1 MB. Free memory was 240.0 MB in the beginning and 238.1 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:35:34,889 INFO L168 Benchmark]: RCFGBuilder took 571.18 ms. Allocated memory is still 293.1 MB. Free memory was 238.1 MB in the beginning and 199.3 MB in the end (delta: 38.8 MB). Peak memory consumption was 38.8 MB. Max. memory is 5.3 GB. [2018-01-24 12:35:34,889 INFO L168 Benchmark]: TraceAbstraction took 21808.14 ms. Allocated memory was 293.1 MB in the beginning and 665.3 MB in the end (delta: 372.2 MB). Free memory was 199.3 MB in the beginning and 530.2 MB in the end (delta: -331.0 MB). Peak memory consumption was 41.3 MB. Max. memory is 5.3 GB. [2018-01-24 12:35:34,891 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.17 ms. Allocated memory is still 293.1 MB. Free memory is still 259.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 202.61 ms. Allocated memory is still 293.1 MB. Free memory was 252.1 MB in the beginning and 240.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.38 ms. Allocated memory is still 293.1 MB. Free memory was 240.0 MB in the beginning and 238.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 571.18 ms. Allocated memory is still 293.1 MB. Free memory was 238.1 MB in the beginning and 199.3 MB in the end (delta: 38.8 MB). Peak memory consumption was 38.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 21808.14 ms. Allocated memory was 293.1 MB in the beginning and 665.3 MB in the end (delta: 372.2 MB). Free memory was 199.3 MB in the beginning and 530.2 MB in the end (delta: -331.0 MB). Peak memory consumption was 41.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:1003) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-optional_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-35-34-898.csv Received shutdown request...