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/list-ext-properties/test-0504_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:14:46,943 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:14:46,946 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:14:46,961 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:14:46,962 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:14:46,963 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:14:46,964 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:14:46,965 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:14:46,967 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:14:46,967 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:14:46,968 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:14:46,968 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:14:46,969 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:14:46,970 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:14:46,971 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:14:46,973 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:14:46,976 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:14:46,978 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:14:46,979 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:14:46,980 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:14:46,983 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:14:46,983 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:14:46,983 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:14:46,984 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:14:46,985 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:14:46,986 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:14:46,987 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:14:46,987 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:14:46,987 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:14:46,988 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:14:46,988 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:14:46,989 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:14:46,998 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:14:46,999 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:14:47,000 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:14:47,000 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:14:47,000 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:14:47,000 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:14:47,001 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:14:47,001 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:14:47,002 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:14:47,002 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:14:47,002 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:14:47,002 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:14:47,002 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:14:47,003 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:14:47,003 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:14:47,003 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:14:47,003 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:14:47,003 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:14:47,004 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:14:47,004 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:14:47,004 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:14:47,004 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:14:47,004 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:14:47,005 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:14:47,005 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:14:47,005 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:14:47,005 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:14:47,005 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:14:47,006 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:14:47,006 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:14:47,006 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:14:47,006 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:14:47,007 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:14:47,007 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:14:47,044 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:14:47,057 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:14:47,061 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:14:47,063 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:14:47,063 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:14:47,064 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0504_1_true-valid-memsafety.i [2018-01-24 12:14:47,265 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:14:47,272 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:14:47,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:14:47,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:14:47,280 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:14:47,281 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:14:47" (1/1) ... [2018-01-24 12:14:47,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e329131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:14:47, skipping insertion in model container [2018-01-24 12:14:47,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:14:47" (1/1) ... [2018-01-24 12:14:47,297 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:14:47,338 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:14:47,460 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:14:47,481 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:14:47,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:14:47 WrapperNode [2018-01-24 12:14:47,490 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:14:47,490 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:14:47,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:14:47,491 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:14:47,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:14:47" (1/1) ... [2018-01-24 12:14:47,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:14:47" (1/1) ... [2018-01-24 12:14:47,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:14:47" (1/1) ... [2018-01-24 12:14:47,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:14:47" (1/1) ... [2018-01-24 12:14:47,523 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:14:47" (1/1) ... [2018-01-24 12:14:47,527 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:14:47" (1/1) ... [2018-01-24 12:14:47,528 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:14:47" (1/1) ... [2018-01-24 12:14:47,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:14:47,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:14:47,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:14:47,531 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:14:47,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:14:47" (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:14:47,584 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:14:47,584 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:14:47,584 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:14:47,584 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:14:47,584 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:14:47,584 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 12:14:47,585 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 12:14:47,585 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:14:47,585 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:14:47,585 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:14:47,585 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 12:14:47,585 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 12:14:47,585 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-24 12:14:47,585 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:14:47,585 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:14:47,585 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:14:47,586 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:14:48,054 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:14:48,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:14:48 BoogieIcfgContainer [2018-01-24 12:14:48,055 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:14:48,055 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:14:48,056 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:14:48,058 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:14:48,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:14:47" (1/3) ... [2018-01-24 12:14:48,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52197acd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:14:48, skipping insertion in model container [2018-01-24 12:14:48,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:14:47" (2/3) ... [2018-01-24 12:14:48,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52197acd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:14:48, skipping insertion in model container [2018-01-24 12:14:48,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:14:48" (3/3) ... [2018-01-24 12:14:48,063 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0504_1_true-valid-memsafety.i [2018-01-24 12:14:48,072 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:14:48,079 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-01-24 12:14:48,128 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:14:48,129 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:14:48,129 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:14:48,129 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:14:48,129 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:14:48,129 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:14:48,129 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:14:48,130 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:14:48,130 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:14:48,151 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states. [2018-01-24 12:14:48,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 12:14:48,157 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:14:48,158 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:14:48,158 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:14:48,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1548810554, now seen corresponding path program 1 times [2018-01-24 12:14:48,163 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:14:48,164 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:14:48,205 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:48,205 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:48,205 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:48,248 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:14:48,275 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:14:48,277 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:14:48,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:14:48,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 12:14:48,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 12:14:48,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 12:14:48,291 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 2 states. [2018-01-24 12:14:48,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:14:48,410 INFO L93 Difference]: Finished difference Result 196 states and 222 transitions. [2018-01-24 12:14:48,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 12:14:48,411 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-01-24 12:14:48,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:14:48,420 INFO L225 Difference]: With dead ends: 196 [2018-01-24 12:14:48,420 INFO L226 Difference]: Without dead ends: 98 [2018-01-24 12:14:48,424 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 12:14:48,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-24 12:14:48,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-24 12:14:48,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-24 12:14:48,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-01-24 12:14:48,461 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 10 [2018-01-24 12:14:48,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:14:48,461 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-01-24 12:14:48,461 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 12:14:48,462 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-01-24 12:14:48,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 12:14:48,462 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:14:48,462 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:14:48,462 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:14:48,463 INFO L82 PathProgramCache]: Analyzing trace with hash -2085004617, now seen corresponding path program 1 times [2018-01-24 12:14:48,463 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:14:48,463 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:14:48,464 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:48,464 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:48,464 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:48,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:14:48,534 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:14:48,534 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:14:48,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:14:48,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:14:48,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:14:48,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:14:48,537 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 3 states. [2018-01-24 12:14:48,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:14:48,604 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2018-01-24 12:14:48,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:14:48,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-24 12:14:48,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:14:48,607 INFO L225 Difference]: With dead ends: 136 [2018-01-24 12:14:48,607 INFO L226 Difference]: Without dead ends: 107 [2018-01-24 12:14:48,608 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:14:48,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-24 12:14:48,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2018-01-24 12:14:48,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-24 12:14:48,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2018-01-24 12:14:48,622 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 13 [2018-01-24 12:14:48,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:14:48,622 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2018-01-24 12:14:48,623 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:14:48,623 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2018-01-24 12:14:48,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:14:48,623 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:14:48,624 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:14:48,624 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:14:48,624 INFO L82 PathProgramCache]: Analyzing trace with hash -211715870, now seen corresponding path program 1 times [2018-01-24 12:14:48,624 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:14:48,624 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:14:48,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:48,626 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:48,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:48,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:14:48,697 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:14:48,698 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:14:48,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:14:48,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:14:48,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:14:48,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:14:48,699 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand 4 states. [2018-01-24 12:14:48,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:14:48,860 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2018-01-24 12:14:48,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:14:48,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 12:14:48,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:14:48,864 INFO L225 Difference]: With dead ends: 135 [2018-01-24 12:14:48,865 INFO L226 Difference]: Without dead ends: 127 [2018-01-24 12:14:48,865 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:14:48,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-24 12:14:48,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 96. [2018-01-24 12:14:48,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-24 12:14:48,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2018-01-24 12:14:48,876 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 14 [2018-01-24 12:14:48,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:14:48,876 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2018-01-24 12:14:48,876 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:14:48,877 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2018-01-24 12:14:48,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:14:48,877 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:14:48,877 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:14:48,878 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:14:48,878 INFO L82 PathProgramCache]: Analyzing trace with hash -211715869, now seen corresponding path program 1 times [2018-01-24 12:14:48,878 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:14:48,878 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:14:48,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:48,879 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:48,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:48,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:14:48,977 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:14:48,978 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:14:48,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:14:48,978 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:14:48,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:14:48,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:14:48,978 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand 4 states. [2018-01-24 12:14:49,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:14:49,104 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2018-01-24 12:14:49,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:14:49,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 12:14:49,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:14:49,106 INFO L225 Difference]: With dead ends: 144 [2018-01-24 12:14:49,106 INFO L226 Difference]: Without dead ends: 138 [2018-01-24 12:14:49,106 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:14:49,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-24 12:14:49,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 99. [2018-01-24 12:14:49,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-24 12:14:49,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2018-01-24 12:14:49,114 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 14 [2018-01-24 12:14:49,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:14:49,115 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2018-01-24 12:14:49,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:14:49,115 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2018-01-24 12:14:49,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:14:49,116 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:14:49,116 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:14:49,116 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:14:49,116 INFO L82 PathProgramCache]: Analyzing trace with hash -210634142, now seen corresponding path program 1 times [2018-01-24 12:14:49,116 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:14:49,116 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:14:49,117 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:49,118 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:49,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:49,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:14:49,147 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:14:49,148 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:14:49,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:14:49,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:14:49,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:14:49,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:14:49,149 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand 3 states. [2018-01-24 12:14:49,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:14:49,204 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2018-01-24 12:14:49,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:14:49,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-01-24 12:14:49,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:14:49,205 INFO L225 Difference]: With dead ends: 103 [2018-01-24 12:14:49,205 INFO L226 Difference]: Without dead ends: 98 [2018-01-24 12:14:49,206 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:14:49,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-24 12:14:49,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-01-24 12:14:49,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-24 12:14:49,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2018-01-24 12:14:49,212 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 14 [2018-01-24 12:14:49,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:14:49,212 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2018-01-24 12:14:49,212 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:14:49,213 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2018-01-24 12:14:49,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 12:14:49,213 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:14:49,213 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:14:49,213 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:14:49,213 INFO L82 PathProgramCache]: Analyzing trace with hash 479661366, now seen corresponding path program 1 times [2018-01-24 12:14:49,214 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:14:49,214 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:14:49,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:49,214 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:49,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:49,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:14:49,305 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:14:49,305 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:14:49,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:14:49,306 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:14:49,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:14:49,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:14:49,307 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 3 states. [2018-01-24 12:14:49,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:14:49,330 INFO L93 Difference]: Finished difference Result 230 states and 261 transitions. [2018-01-24 12:14:49,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:14:49,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-01-24 12:14:49,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:14:49,332 INFO L225 Difference]: With dead ends: 230 [2018-01-24 12:14:49,332 INFO L226 Difference]: Without dead ends: 143 [2018-01-24 12:14:49,332 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:14:49,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-24 12:14:49,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 125. [2018-01-24 12:14:49,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-24 12:14:49,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2018-01-24 12:14:49,344 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 26 [2018-01-24 12:14:49,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:14:49,344 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2018-01-24 12:14:49,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:14:49,345 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2018-01-24 12:14:49,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 12:14:49,346 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:14:49,346 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] [2018-01-24 12:14:49,346 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:14:49,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1985366289, now seen corresponding path program 1 times [2018-01-24 12:14:49,346 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:14:49,346 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:14:49,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:49,348 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:49,348 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:49,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:14:49,548 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:14:49,571 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:14:49,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:14:49,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:14:49,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:14:49,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:14:49,572 INFO L87 Difference]: Start difference. First operand 125 states and 152 transitions. Second operand 5 states. [2018-01-24 12:14:49,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:14:49,762 INFO L93 Difference]: Finished difference Result 228 states and 263 transitions. [2018-01-24 12:14:49,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:14:49,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-24 12:14:49,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:14:49,764 INFO L225 Difference]: With dead ends: 228 [2018-01-24 12:14:49,764 INFO L226 Difference]: Without dead ends: 225 [2018-01-24 12:14:49,765 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:14:49,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-01-24 12:14:49,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 114. [2018-01-24 12:14:49,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 12:14:49,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2018-01-24 12:14:49,774 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 27 [2018-01-24 12:14:49,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:14:49,776 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2018-01-24 12:14:49,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:14:49,776 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2018-01-24 12:14:49,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:14:49,777 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:14:49,777 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:14:49,777 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:14:49,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1416812824, now seen corresponding path program 1 times [2018-01-24 12:14:49,778 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:14:49,778 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:14:49,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:49,779 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:49,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:49,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:14:49,842 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:14:49,842 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:14:49,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:14:49,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:14:49,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:14:49,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:14:49,843 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand 4 states. [2018-01-24 12:14:49,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:14:49,979 INFO L93 Difference]: Finished difference Result 175 states and 204 transitions. [2018-01-24 12:14:49,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:14:49,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-24 12:14:49,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:14:49,981 INFO L225 Difference]: With dead ends: 175 [2018-01-24 12:14:49,981 INFO L226 Difference]: Without dead ends: 171 [2018-01-24 12:14:49,982 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:14:49,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-01-24 12:14:49,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 110. [2018-01-24 12:14:49,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-24 12:14:49,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 126 transitions. [2018-01-24 12:14:49,991 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 126 transitions. Word has length 28 [2018-01-24 12:14:49,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:14:49,992 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 126 transitions. [2018-01-24 12:14:49,992 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:14:49,992 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 126 transitions. [2018-01-24 12:14:49,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:14:49,993 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:14:49,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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:14:49,993 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:14:49,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1416812825, now seen corresponding path program 1 times [2018-01-24 12:14:49,994 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:14:49,994 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:14:49,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:49,995 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:49,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:50,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:14:50,076 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:14:50,077 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:14:50,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:14:50,077 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:14:50,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:14:50,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:14:50,077 INFO L87 Difference]: Start difference. First operand 110 states and 126 transitions. Second operand 4 states. [2018-01-24 12:14:50,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:14:50,168 INFO L93 Difference]: Finished difference Result 163 states and 188 transitions. [2018-01-24 12:14:50,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:14:50,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-24 12:14:50,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:14:50,169 INFO L225 Difference]: With dead ends: 163 [2018-01-24 12:14:50,169 INFO L226 Difference]: Without dead ends: 159 [2018-01-24 12:14:50,170 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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:14:50,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-24 12:14:50,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 106. [2018-01-24 12:14:50,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-24 12:14:50,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2018-01-24 12:14:50,176 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 28 [2018-01-24 12:14:50,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:14:50,176 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2018-01-24 12:14:50,176 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:14:50,176 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2018-01-24 12:14:50,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 12:14:50,177 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:14:50,177 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:14:50,177 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:14:50,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1627264726, now seen corresponding path program 1 times [2018-01-24 12:14:50,177 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:14:50,177 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:14:50,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:50,178 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:50,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:50,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:14:50,284 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:14:50,284 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:14:50,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:14:50,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:14:50,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:14:50,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:14:50,285 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand 6 states. [2018-01-24 12:14:50,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:14:50,519 INFO L93 Difference]: Finished difference Result 186 states and 209 transitions. [2018-01-24 12:14:50,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:14:50,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-24 12:14:50,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:14:50,521 INFO L225 Difference]: With dead ends: 186 [2018-01-24 12:14:50,521 INFO L226 Difference]: Without dead ends: 185 [2018-01-24 12:14:50,521 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:14:50,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-01-24 12:14:50,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 130. [2018-01-24 12:14:50,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-24 12:14:50,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2018-01-24 12:14:50,531 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 31 [2018-01-24 12:14:50,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:14:50,531 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2018-01-24 12:14:50,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:14:50,532 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2018-01-24 12:14:50,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 12:14:50,533 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:14:50,533 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:14:50,533 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:14:50,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1627264727, now seen corresponding path program 1 times [2018-01-24 12:14:50,533 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:14:50,533 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:14:50,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:50,534 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:50,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:50,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:14:50,790 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:14:50,790 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:14:50,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 12:14:50,791 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:14:50,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:14:50,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:14:50,791 INFO L87 Difference]: Start difference. First operand 130 states and 148 transitions. Second operand 10 states. [2018-01-24 12:14:51,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:14:51,191 INFO L93 Difference]: Finished difference Result 235 states and 261 transitions. [2018-01-24 12:14:51,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 12:14:51,191 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-01-24 12:14:51,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:14:51,192 INFO L225 Difference]: With dead ends: 235 [2018-01-24 12:14:51,193 INFO L226 Difference]: Without dead ends: 234 [2018-01-24 12:14:51,193 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-01-24 12:14:51,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-01-24 12:14:51,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 130. [2018-01-24 12:14:51,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-24 12:14:51,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 146 transitions. [2018-01-24 12:14:51,201 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 146 transitions. Word has length 31 [2018-01-24 12:14:51,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:14:51,201 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 146 transitions. [2018-01-24 12:14:51,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:14:51,201 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 146 transitions. [2018-01-24 12:14:51,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 12:14:51,202 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:14:51,203 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] [2018-01-24 12:14:51,203 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:14:51,203 INFO L82 PathProgramCache]: Analyzing trace with hash 414150462, now seen corresponding path program 1 times [2018-01-24 12:14:51,203 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:14:51,203 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:14:51,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:51,204 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:51,205 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:51,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:14:51,257 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:14:51,257 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:14:51,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:14:51,258 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:14:51,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:14:51,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:14:51,258 INFO L87 Difference]: Start difference. First operand 130 states and 146 transitions. Second operand 4 states. [2018-01-24 12:14:51,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:14:51,431 INFO L93 Difference]: Finished difference Result 161 states and 177 transitions. [2018-01-24 12:14:51,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:14:51,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-01-24 12:14:51,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:14:51,433 INFO L225 Difference]: With dead ends: 161 [2018-01-24 12:14:51,433 INFO L226 Difference]: Without dead ends: 160 [2018-01-24 12:14:51,433 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:14:51,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-24 12:14:51,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 133. [2018-01-24 12:14:51,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-24 12:14:51,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 151 transitions. [2018-01-24 12:14:51,441 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 151 transitions. Word has length 32 [2018-01-24 12:14:51,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:14:51,441 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 151 transitions. [2018-01-24 12:14:51,441 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:14:51,441 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 151 transitions. [2018-01-24 12:14:51,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 12:14:51,442 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:14:51,442 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] [2018-01-24 12:14:51,442 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:14:51,443 INFO L82 PathProgramCache]: Analyzing trace with hash 414150463, now seen corresponding path program 1 times [2018-01-24 12:14:51,443 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:14:51,443 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:14:51,444 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:51,444 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:51,444 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:51,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:14:51,592 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:14:51,593 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:14:51,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:14:51,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:14:51,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:14:51,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:14:51,594 INFO L87 Difference]: Start difference. First operand 133 states and 151 transitions. Second operand 5 states. [2018-01-24 12:14:51,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:14:51,861 INFO L93 Difference]: Finished difference Result 213 states and 243 transitions. [2018-01-24 12:14:51,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:14:51,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-24 12:14:51,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:14:51,863 INFO L225 Difference]: With dead ends: 213 [2018-01-24 12:14:51,863 INFO L226 Difference]: Without dead ends: 212 [2018-01-24 12:14:51,863 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:14:51,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-01-24 12:14:51,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 162. [2018-01-24 12:14:51,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-24 12:14:51,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 189 transitions. [2018-01-24 12:14:51,876 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 189 transitions. Word has length 32 [2018-01-24 12:14:51,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:14:51,876 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 189 transitions. [2018-01-24 12:14:51,876 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:14:51,877 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 189 transitions. [2018-01-24 12:14:51,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 12:14:51,878 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:14:51,878 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] [2018-01-24 12:14:51,878 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:14:51,878 INFO L82 PathProgramCache]: Analyzing trace with hash -46238021, now seen corresponding path program 1 times [2018-01-24 12:14:51,878 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:14:51,879 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:14:51,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:51,880 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:51,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:51,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:14:51,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:14:51,937 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:14:51,937 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:14:51,950 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:52,011 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:14:52,057 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:14:52,080 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:14:52,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-01-24 12:14:52,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:14:52,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:14:52,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:14:52,081 INFO L87 Difference]: Start difference. First operand 162 states and 189 transitions. Second operand 5 states. [2018-01-24 12:14:52,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:14:52,129 INFO L93 Difference]: Finished difference Result 165 states and 191 transitions. [2018-01-24 12:14:52,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:14:52,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-24 12:14:52,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:14:52,131 INFO L225 Difference]: With dead ends: 165 [2018-01-24 12:14:52,131 INFO L226 Difference]: Without dead ends: 162 [2018-01-24 12:14:52,132 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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:14:52,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-01-24 12:14:52,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-01-24 12:14:52,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-24 12:14:52,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 187 transitions. [2018-01-24 12:14:52,144 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 187 transitions. Word has length 33 [2018-01-24 12:14:52,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:14:52,144 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 187 transitions. [2018-01-24 12:14:52,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:14:52,145 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 187 transitions. [2018-01-24 12:14:52,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 12:14:52,145 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:14:52,145 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] [2018-01-24 12:14:52,145 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:14:52,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1433361569, now seen corresponding path program 1 times [2018-01-24 12:14:52,146 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:14:52,146 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:14:52,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:52,147 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:52,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:52,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:14:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 12:14:52,191 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:14:52,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:14:52,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:14:52,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:14:52,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:14:52,192 INFO L87 Difference]: Start difference. First operand 162 states and 187 transitions. Second operand 4 states. [2018-01-24 12:14:52,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:14:52,292 INFO L93 Difference]: Finished difference Result 178 states and 205 transitions. [2018-01-24 12:14:52,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:14:52,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-24 12:14:52,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:14:52,294 INFO L225 Difference]: With dead ends: 178 [2018-01-24 12:14:52,294 INFO L226 Difference]: Without dead ends: 176 [2018-01-24 12:14:52,295 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:14:52,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-24 12:14:52,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 168. [2018-01-24 12:14:52,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-01-24 12:14:52,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 200 transitions. [2018-01-24 12:14:52,309 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 200 transitions. Word has length 34 [2018-01-24 12:14:52,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:14:52,309 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 200 transitions. [2018-01-24 12:14:52,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:14:52,310 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 200 transitions. [2018-01-24 12:14:52,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 12:14:52,310 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:14:52,310 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] [2018-01-24 12:14:52,311 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:14:52,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1433361568, now seen corresponding path program 1 times [2018-01-24 12:14:52,311 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:14:52,311 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:14:52,312 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:52,312 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:52,312 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:52,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:14:52,444 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:14:52,445 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:14:52,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:14:52,445 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:14:52,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:14:52,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:14:52,446 INFO L87 Difference]: Start difference. First operand 168 states and 200 transitions. Second operand 6 states. [2018-01-24 12:14:52,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:14:52,738 INFO L93 Difference]: Finished difference Result 252 states and 303 transitions. [2018-01-24 12:14:52,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:14:52,738 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-24 12:14:52,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:14:52,740 INFO L225 Difference]: With dead ends: 252 [2018-01-24 12:14:52,740 INFO L226 Difference]: Without dead ends: 250 [2018-01-24 12:14:52,741 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:14:52,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-01-24 12:14:52,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 186. [2018-01-24 12:14:52,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-01-24 12:14:52,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 233 transitions. [2018-01-24 12:14:52,756 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 233 transitions. Word has length 34 [2018-01-24 12:14:52,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:14:52,756 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 233 transitions. [2018-01-24 12:14:52,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:14:52,757 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 233 transitions. [2018-01-24 12:14:52,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 12:14:52,757 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:14:52,757 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] [2018-01-24 12:14:52,758 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:14:52,758 INFO L82 PathProgramCache]: Analyzing trace with hash -521175964, now seen corresponding path program 1 times [2018-01-24 12:14:52,758 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:14:52,758 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:14:52,759 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:52,759 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:52,759 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:52,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:14:52,931 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:14:52,931 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:14:52,931 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:14:52,931 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:14:52,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:14:52,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:14:52,932 INFO L87 Difference]: Start difference. First operand 186 states and 233 transitions. Second operand 7 states. [2018-01-24 12:14:53,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:14:53,244 INFO L93 Difference]: Finished difference Result 307 states and 393 transitions. [2018-01-24 12:14:53,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:14:53,245 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-01-24 12:14:53,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:14:53,247 INFO L225 Difference]: With dead ends: 307 [2018-01-24 12:14:53,247 INFO L226 Difference]: Without dead ends: 257 [2018-01-24 12:14:53,248 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:14:53,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-01-24 12:14:53,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 198. [2018-01-24 12:14:53,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-01-24 12:14:53,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 247 transitions. [2018-01-24 12:14:53,280 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 247 transitions. Word has length 38 [2018-01-24 12:14:53,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:14:53,281 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 247 transitions. [2018-01-24 12:14:53,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:14:53,281 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 247 transitions. [2018-01-24 12:14:53,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 12:14:53,282 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:14:53,282 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:14:53,282 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:14:53,283 INFO L82 PathProgramCache]: Analyzing trace with hash -47566885, now seen corresponding path program 1 times [2018-01-24 12:14:53,283 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:14:53,283 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:14:53,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:53,284 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:53,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:53,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:14:53,350 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:14:53,351 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:14:53,351 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:14:53,363 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:53,399 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:14:53,406 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:14:53,440 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:14:53,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-01-24 12:14:53,441 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:14:53,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:14:53,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:14:53,442 INFO L87 Difference]: Start difference. First operand 198 states and 247 transitions. Second operand 5 states. [2018-01-24 12:14:53,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:14:53,495 INFO L93 Difference]: Finished difference Result 288 states and 357 transitions. [2018-01-24 12:14:53,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:14:53,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-01-24 12:14:53,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:14:53,497 INFO L225 Difference]: With dead ends: 288 [2018-01-24 12:14:53,497 INFO L226 Difference]: Without dead ends: 253 [2018-01-24 12:14:53,498 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:14:53,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-01-24 12:14:53,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 238. [2018-01-24 12:14:53,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-01-24 12:14:53,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 310 transitions. [2018-01-24 12:14:53,519 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 310 transitions. Word has length 41 [2018-01-24 12:14:53,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:14:53,519 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 310 transitions. [2018-01-24 12:14:53,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:14:53,519 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 310 transitions. [2018-01-24 12:14:53,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 12:14:53,520 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:14:53,520 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:14:53,520 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:14:53,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1474573890, now seen corresponding path program 1 times [2018-01-24 12:14:53,520 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:14:53,520 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:14:53,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:53,521 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:53,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:53,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:14:53,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:14:53,750 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:14:53,750 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:14:53,761 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:53,790 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:14:54,164 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~x~10.base Int)) (and (= (select |c_old(#valid)| main_~x~10.base) 0) (= |c_#valid| (store |c_old(#valid)| main_~x~10.base 0)) (not (= main_~x~10.base 0)))) is different from true [2018-01-24 12:14:54,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-24 12:14:54,219 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:14:54,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2018-01-24 12:14:54,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 12:14:54,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 12:14:54,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=130, Unknown=1, NotChecked=22, Total=182 [2018-01-24 12:14:54,220 INFO L87 Difference]: Start difference. First operand 238 states and 310 transitions. Second operand 14 states. [2018-01-24 12:14:54,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:14:54,823 INFO L93 Difference]: Finished difference Result 244 states and 315 transitions. [2018-01-24 12:14:54,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:14:54,839 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-01-24 12:14:54,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:14:54,840 INFO L225 Difference]: With dead ends: 244 [2018-01-24 12:14:54,840 INFO L226 Difference]: Without dead ends: 230 [2018-01-24 12:14:54,841 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=88, Invalid=257, Unknown=1, NotChecked=34, Total=380 [2018-01-24 12:14:54,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-01-24 12:14:54,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-01-24 12:14:54,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-01-24 12:14:54,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 300 transitions. [2018-01-24 12:14:54,854 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 300 transitions. Word has length 42 [2018-01-24 12:14:54,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:14:54,854 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 300 transitions. [2018-01-24 12:14:54,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 12:14:54,854 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 300 transitions. [2018-01-24 12:14:54,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-24 12:14:54,855 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:14:54,855 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:14:54,855 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:14:54,855 INFO L82 PathProgramCache]: Analyzing trace with hash 924240911, now seen corresponding path program 1 times [2018-01-24 12:14:54,855 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:14:54,855 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:14:54,856 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:54,856 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:54,856 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:54,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:14:54,948 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:14:54,949 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:14:54,949 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:14:54,956 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:54,986 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:14:55,019 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 12 treesize of output 11 [2018-01-24 12:14:55,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:14:55,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:14:55,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 12:14:55,065 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:14:55,099 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:14:55,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2018-01-24 12:14:55,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:14:55,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:14:55,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:14:55,101 INFO L87 Difference]: Start difference. First operand 229 states and 300 transitions. Second operand 8 states. [2018-01-24 12:14:55,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:14:55,474 INFO L93 Difference]: Finished difference Result 264 states and 329 transitions. [2018-01-24 12:14:55,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:14:55,474 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-01-24 12:14:55,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:14:55,476 INFO L225 Difference]: With dead ends: 264 [2018-01-24 12:14:55,476 INFO L226 Difference]: Without dead ends: 263 [2018-01-24 12:14:55,477 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 7 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:14:55,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-01-24 12:14:55,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 228. [2018-01-24 12:14:55,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-01-24 12:14:55,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 298 transitions. [2018-01-24 12:14:55,499 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 298 transitions. Word has length 45 [2018-01-24 12:14:55,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:14:55,500 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 298 transitions. [2018-01-24 12:14:55,500 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:14:55,500 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 298 transitions. [2018-01-24 12:14:55,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-24 12:14:55,500 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:14:55,501 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:14:55,501 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:14:55,501 INFO L82 PathProgramCache]: Analyzing trace with hash 924240912, now seen corresponding path program 1 times [2018-01-24 12:14:55,501 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:14:55,501 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:14:55,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:55,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:55,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:55,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:14:55,673 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:14:55,673 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:14:55,674 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:14:55,682 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:55,708 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:14:55,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:14:55,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:14:55,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:14:55,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:14:55,820 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 19 treesize of output 14 [2018-01-24 12:14:55,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:14:55,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:14:55,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:19 [2018-01-24 12:14:55,886 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:14:55,907 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:14:55,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-01-24 12:14:55,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 12:14:55,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 12:14:55,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:14:55,908 INFO L87 Difference]: Start difference. First operand 228 states and 298 transitions. Second operand 12 states. [2018-01-24 12:14:56,165 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 29 DAG size of output 23 [2018-01-24 12:14:56,950 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 25 DAG size of output 19 [2018-01-24 12:14:57,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:14:57,082 INFO L93 Difference]: Finished difference Result 318 states and 405 transitions. [2018-01-24 12:14:57,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:14:57,082 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-01-24 12:14:57,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:14:57,084 INFO L225 Difference]: With dead ends: 318 [2018-01-24 12:14:57,084 INFO L226 Difference]: Without dead ends: 317 [2018-01-24 12:14:57,085 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:14:57,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-01-24 12:14:57,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 227. [2018-01-24 12:14:57,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-01-24 12:14:57,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 296 transitions. [2018-01-24 12:14:57,106 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 296 transitions. Word has length 45 [2018-01-24 12:14:57,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:14:57,106 INFO L432 AbstractCegarLoop]: Abstraction has 227 states and 296 transitions. [2018-01-24 12:14:57,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 12:14:57,106 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 296 transitions. [2018-01-24 12:14:57,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 12:14:57,107 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:14:57,107 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:14:57,107 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:14:57,107 INFO L82 PathProgramCache]: Analyzing trace with hash -2048623147, now seen corresponding path program 1 times [2018-01-24 12:14:57,108 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:14:57,108 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:14:57,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:57,109 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:57,109 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:57,120 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:14:57,121 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:14:57,121 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 12:14:57,130 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:57,163 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:14:57,184 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:14:57,185 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:14:57,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:14:57,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:14:57,212 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:14:57,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-01-24 12:14:57,219 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:14:57,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:14:57,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:14:57,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-01-24 12:14:57,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-01-24 12:14:57,326 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-01-24 12:14:57,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:14:57,352 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 22 treesize of output 21 [2018-01-24 12:14:57,352 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:14:57,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:14:57,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:14:57,365 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-01-24 12:14:57,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-01-24 12:14:57,397 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 24 treesize of output 17 [2018-01-24 12:14:57,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:14:57,408 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 17 treesize of output 10 [2018-01-24 12:14:57,408 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:14:57,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-01-24 12:14:57,418 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:14:57,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:14:57,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:14:57,435 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:33, output treesize:11 [2018-01-24 12:14:57,446 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:14:57,466 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:14:57,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-01-24 12:14:57,467 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:14:57,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:14:57,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:14:57,467 INFO L87 Difference]: Start difference. First operand 227 states and 296 transitions. Second operand 9 states. [2018-01-24 12:14:57,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:14:57,709 INFO L93 Difference]: Finished difference Result 249 states and 323 transitions. [2018-01-24 12:14:57,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:14:57,709 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2018-01-24 12:14:57,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:14:57,711 INFO L225 Difference]: With dead ends: 249 [2018-01-24 12:14:57,711 INFO L226 Difference]: Without dead ends: 248 [2018-01-24 12:14:57,712 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:14:57,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-01-24 12:14:57,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 226. [2018-01-24 12:14:57,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-01-24 12:14:57,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 294 transitions. [2018-01-24 12:14:57,732 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 294 transitions. Word has length 48 [2018-01-24 12:14:57,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:14:57,733 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 294 transitions. [2018-01-24 12:14:57,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:14:57,733 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 294 transitions. [2018-01-24 12:14:57,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 12:14:57,734 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:14:57,734 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:14:57,734 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:14:57,734 INFO L82 PathProgramCache]: Analyzing trace with hash -2048623146, now seen corresponding path program 1 times [2018-01-24 12:14:57,734 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:14:57,734 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:14:57,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:57,735 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:57,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:57,748 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:14:57,748 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:14:57,748 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 12:14:57,763 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:57,790 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:14:57,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:14:57,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:14:57,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:14:57,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:14:57,813 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:14:57,815 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:14:57,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:14:57,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:14:57,825 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:14:57,826 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:14:57,826 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:14:57,828 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:14:57,835 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:14:57,836 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:34 [2018-01-24 12:14:57,851 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 31 treesize of output 22 [2018-01-24 12:14:57,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:14:57,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:14:57,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:31 [2018-01-24 12:14:57,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-01-24 12:14:57,919 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-01-24 12:14:57,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:14:57,934 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 22 treesize of output 21 [2018-01-24 12:14:57,934 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:14:57,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:14:57,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-01-24 12:14:57,966 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 33 treesize of output 32 [2018-01-24 12:14:57,967 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:14:57,982 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:14:57,989 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:14:57,990 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:61, output treesize:53 [2018-01-24 12:14:58,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-01-24 12:14:58,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-01-24 12:14:58,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:14:58,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:14:58,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2018-01-24 12:14:58,044 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 29 treesize of output 22 [2018-01-24 12:14:58,044 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:14:58,057 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 22 treesize of output 13 [2018-01-24 12:14:58,058 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:14:58,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2018-01-24 12:14:58,068 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:14:58,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:14:58,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:14:58,077 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:67, output treesize:19 [2018-01-24 12:14:58,095 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:14:58,119 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:14:58,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-01-24 12:14:58,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:14:58,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:14:58,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:14:58,120 INFO L87 Difference]: Start difference. First operand 226 states and 294 transitions. Second operand 11 states. [2018-01-24 12:14:58,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:14:58,512 INFO L93 Difference]: Finished difference Result 317 states and 409 transitions. [2018-01-24 12:14:58,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 12:14:58,513 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-01-24 12:14:58,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:14:58,514 INFO L225 Difference]: With dead ends: 317 [2018-01-24 12:14:58,514 INFO L226 Difference]: Without dead ends: 316 [2018-01-24 12:14:58,515 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=269, Unknown=4, NotChecked=0, Total=380 [2018-01-24 12:14:58,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-01-24 12:14:58,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 209. [2018-01-24 12:14:58,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-01-24 12:14:58,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 276 transitions. [2018-01-24 12:14:58,529 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 276 transitions. Word has length 48 [2018-01-24 12:14:58,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:14:58,530 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 276 transitions. [2018-01-24 12:14:58,530 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:14:58,530 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 276 transitions. [2018-01-24 12:14:58,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-24 12:14:58,530 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:14:58,530 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:14:58,531 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:14:58,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1869223904, now seen corresponding path program 1 times [2018-01-24 12:14:58,531 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:14:58,531 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:14:58,531 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:58,532 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:58,532 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:58,541 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:14:58,541 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:14:58,541 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 12:14:58,555 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:58,594 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:14:58,618 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:14:58,619 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:14:58,622 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:14:58,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:14:58,634 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 14 treesize of output 17 [2018-01-24 12:14:58,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:14:58,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:14:58,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-01-24 12:14:58,744 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:14:58,776 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:14:58,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-01-24 12:14:58,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:14:58,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:14:58,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:14:58,777 INFO L87 Difference]: Start difference. First operand 209 states and 276 transitions. Second operand 6 states. [2018-01-24 12:14:59,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:14:59,066 INFO L93 Difference]: Finished difference Result 309 states and 396 transitions. [2018-01-24 12:14:59,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:14:59,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-01-24 12:14:59,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:14:59,068 INFO L225 Difference]: With dead ends: 309 [2018-01-24 12:14:59,068 INFO L226 Difference]: Without dead ends: 308 [2018-01-24 12:14:59,069 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:14:59,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-01-24 12:14:59,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 216. [2018-01-24 12:14:59,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-01-24 12:14:59,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 284 transitions. [2018-01-24 12:14:59,088 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 284 transitions. Word has length 49 [2018-01-24 12:14:59,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:14:59,089 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 284 transitions. [2018-01-24 12:14:59,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:14:59,089 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 284 transitions. [2018-01-24 12:14:59,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-24 12:14:59,090 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:14:59,090 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:14:59,090 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:14:59,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1027839999, now seen corresponding path program 1 times [2018-01-24 12:14:59,090 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:14:59,090 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:14:59,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:59,091 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:59,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:59,101 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:14:59,102 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:14:59,102 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 12:14:59,109 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:59,148 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:14:59,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 12:14:59,243 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:14:59,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:14:59,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:14:59,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:14:59,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:14:59,244 INFO L87 Difference]: Start difference. First operand 216 states and 284 transitions. Second operand 6 states. [2018-01-24 12:14:59,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:14:59,430 INFO L93 Difference]: Finished difference Result 249 states and 325 transitions. [2018-01-24 12:14:59,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:14:59,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-01-24 12:14:59,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:14:59,431 INFO L225 Difference]: With dead ends: 249 [2018-01-24 12:14:59,431 INFO L226 Difference]: Without dead ends: 248 [2018-01-24 12:14:59,431 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:14:59,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-01-24 12:14:59,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 218. [2018-01-24 12:14:59,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-01-24 12:14:59,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 285 transitions. [2018-01-24 12:14:59,452 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 285 transitions. Word has length 51 [2018-01-24 12:14:59,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:14:59,452 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 285 transitions. [2018-01-24 12:14:59,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:14:59,452 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 285 transitions. [2018-01-24 12:14:59,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-24 12:14:59,453 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:14:59,453 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:14:59,453 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:14:59,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1099560870, now seen corresponding path program 1 times [2018-01-24 12:14:59,454 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:14:59,454 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:14:59,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:59,455 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:59,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:59,465 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:14:59,465 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:14:59,465 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 12:14:59,473 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:59,514 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:14:59,554 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 12:14:59,589 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:14:59,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:14:59,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:14:59,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:14:59,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:14:59,590 INFO L87 Difference]: Start difference. First operand 218 states and 285 transitions. Second operand 7 states. [2018-01-24 12:14:59,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:14:59,711 INFO L93 Difference]: Finished difference Result 243 states and 318 transitions. [2018-01-24 12:14:59,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:14:59,711 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2018-01-24 12:14:59,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:14:59,713 INFO L225 Difference]: With dead ends: 243 [2018-01-24 12:14:59,713 INFO L226 Difference]: Without dead ends: 242 [2018-01-24 12:14:59,714 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:14:59,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-01-24 12:14:59,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 213. [2018-01-24 12:14:59,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-01-24 12:14:59,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 278 transitions. [2018-01-24 12:14:59,735 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 278 transitions. Word has length 55 [2018-01-24 12:14:59,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:14:59,735 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 278 transitions. [2018-01-24 12:14:59,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:14:59,735 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 278 transitions. [2018-01-24 12:14:59,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-24 12:14:59,736 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:14:59,736 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:14:59,736 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:14:59,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1099560827, now seen corresponding path program 1 times [2018-01-24 12:14:59,737 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:14:59,737 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:14:59,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:59,738 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:59,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:14:59,748 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:14:59,748 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:14:59,748 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 12:14:59,757 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:14:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:14:59,796 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:14:59,820 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:14:59,821 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:14:59,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:14:59,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:14:59,833 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:14:59,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-01-24 12:14:59,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-01-24 12:14:59,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-01-24 12:14:59,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:14:59,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:14:59,874 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:14:59,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-01-24 12:14:59,888 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:14:59,909 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:14:59,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:14:59,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:14:59,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:14:59,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:14:59,909 INFO L87 Difference]: Start difference. First operand 213 states and 278 transitions. Second operand 8 states. [2018-01-24 12:15:00,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:00,106 INFO L93 Difference]: Finished difference Result 260 states and 328 transitions. [2018-01-24 12:15:00,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 12:15:00,106 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-01-24 12:15:00,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:00,107 INFO L225 Difference]: With dead ends: 260 [2018-01-24 12:15:00,107 INFO L226 Difference]: Without dead ends: 259 [2018-01-24 12:15:00,108 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:15:00,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-01-24 12:15:00,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 225. [2018-01-24 12:15:00,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-01-24 12:15:00,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 294 transitions. [2018-01-24 12:15:00,136 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 294 transitions. Word has length 55 [2018-01-24 12:15:00,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:00,137 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 294 transitions. [2018-01-24 12:15:00,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:15:00,137 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 294 transitions. [2018-01-24 12:15:00,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-24 12:15:00,138 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:00,138 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:15:00,138 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:15:00,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1099560826, now seen corresponding path program 1 times [2018-01-24 12:15:00,138 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:00,139 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:00,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:00,139 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:00,140 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:00,151 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:15:00,151 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:15:00,151 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 12:15:00,164 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:00,208 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:15:00,260 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:15:00,262 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:15:00,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:00,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:00,274 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:15:00,276 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:15:00,277 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:00,278 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:00,286 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:15:00,287 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:36 [2018-01-24 12:15:00,329 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 23 treesize of output 19 [2018-01-24 12:15:00,331 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 19 treesize of output 11 [2018-01-24 12:15:00,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:00,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:00,341 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 33 treesize of output 25 [2018-01-24 12:15:00,344 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 25 treesize of output 14 [2018-01-24 12:15:00,344 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:00,353 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:00,365 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:15:00,366 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2018-01-24 12:15:00,393 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:00,414 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:15:00,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-24 12:15:00,414 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 12:15:00,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 12:15:00,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:15:00,415 INFO L87 Difference]: Start difference. First operand 225 states and 294 transitions. Second operand 14 states. [2018-01-24 12:15:00,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:00,988 INFO L93 Difference]: Finished difference Result 385 states and 497 transitions. [2018-01-24 12:15:00,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 12:15:00,989 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-01-24 12:15:00,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:00,990 INFO L225 Difference]: With dead ends: 385 [2018-01-24 12:15:00,990 INFO L226 Difference]: Without dead ends: 384 [2018-01-24 12:15:00,991 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=255, Invalid=615, Unknown=0, NotChecked=0, Total=870 [2018-01-24 12:15:00,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-01-24 12:15:01,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 225. [2018-01-24 12:15:01,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-01-24 12:15:01,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 292 transitions. [2018-01-24 12:15:01,014 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 292 transitions. Word has length 55 [2018-01-24 12:15:01,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:01,015 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 292 transitions. [2018-01-24 12:15:01,015 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 12:15:01,015 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 292 transitions. [2018-01-24 12:15:01,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-24 12:15:01,016 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:01,016 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:15:01,016 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:15:01,016 INFO L82 PathProgramCache]: Analyzing trace with hash -115996377, now seen corresponding path program 1 times [2018-01-24 12:15:01,016 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:01,016 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:01,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:01,017 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:01,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:01,028 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:15:01,028 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:15:01,028 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 12:15:01,036 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:01,078 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:15:01,086 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:15:01,087 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:15:01,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:01,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:01,095 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:15:01,097 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:15:01,097 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:01,098 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:01,102 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:15:01,102 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-01-24 12:15:01,116 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 23 treesize of output 19 [2018-01-24 12:15:01,118 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 19 treesize of output 11 [2018-01-24 12:15:01,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:01,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:01,123 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 19 treesize of output 15 [2018-01-24 12:15:01,124 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-24 12:15:01,125 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:01,126 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:01,126 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:15:01,127 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:7 [2018-01-24 12:15:01,156 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:01,180 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:15:01,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 12:15:01,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:15:01,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:15:01,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:15:01,180 INFO L87 Difference]: Start difference. First operand 225 states and 292 transitions. Second operand 10 states. [2018-01-24 12:15:01,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:01,592 INFO L93 Difference]: Finished difference Result 355 states and 451 transitions. [2018-01-24 12:15:01,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 12:15:01,592 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2018-01-24 12:15:01,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:01,593 INFO L225 Difference]: With dead ends: 355 [2018-01-24 12:15:01,593 INFO L226 Difference]: Without dead ends: 354 [2018-01-24 12:15:01,594 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:15:01,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-01-24 12:15:01,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 229. [2018-01-24 12:15:01,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-01-24 12:15:01,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 298 transitions. [2018-01-24 12:15:01,613 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 298 transitions. Word has length 57 [2018-01-24 12:15:01,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:01,613 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 298 transitions. [2018-01-24 12:15:01,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:15:01,613 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 298 transitions. [2018-01-24 12:15:01,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-24 12:15:01,614 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:01,614 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:15:01,614 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:15:01,614 INFO L82 PathProgramCache]: Analyzing trace with hash -115996378, now seen corresponding path program 1 times [2018-01-24 12:15:01,615 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:01,615 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:01,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:01,616 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:01,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:01,623 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:15:01,623 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:15:01,624 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 12:15:01,631 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:01,675 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:15:01,719 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-24 12:15:01,754 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:15:01,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:15:01,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:15:01,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:15:01,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:15:01,755 INFO L87 Difference]: Start difference. First operand 229 states and 298 transitions. Second operand 4 states. [2018-01-24 12:15:01,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:01,813 INFO L93 Difference]: Finished difference Result 247 states and 324 transitions. [2018-01-24 12:15:01,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:15:01,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-01-24 12:15:01,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:01,815 INFO L225 Difference]: With dead ends: 247 [2018-01-24 12:15:01,815 INFO L226 Difference]: Without dead ends: 245 [2018-01-24 12:15:01,815 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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:15:01,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-01-24 12:15:01,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 227. [2018-01-24 12:15:01,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-01-24 12:15:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 287 transitions. [2018-01-24 12:15:01,829 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 287 transitions. Word has length 57 [2018-01-24 12:15:01,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:01,830 INFO L432 AbstractCegarLoop]: Abstraction has 227 states and 287 transitions. [2018-01-24 12:15:01,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:15:01,830 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 287 transitions. [2018-01-24 12:15:01,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-24 12:15:01,830 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:01,830 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:15:01,830 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:15:01,831 INFO L82 PathProgramCache]: Analyzing trace with hash 156065119, now seen corresponding path program 1 times [2018-01-24 12:15:01,831 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:01,831 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:01,831 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:01,831 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:01,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:01,838 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:15:01,838 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:15:01,838 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 12:15:01,844 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:01,874 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:15:01,893 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:01,894 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:01,895 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:15:01,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:01,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:01,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-01-24 12:15:01,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 12:15:01,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:15:01,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:01,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:01,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:15:01,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:15 [2018-01-24 12:15:01,969 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 16 treesize of output 12 [2018-01-24 12:15:01,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 13 [2018-01-24 12:15:01,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:15:01,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:15:01,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:15:01,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:22 [2018-01-24 12:15:02,025 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:02,046 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:15:02,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-01-24 12:15:02,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 12:15:02,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 12:15:02,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:15:02,047 INFO L87 Difference]: Start difference. First operand 227 states and 287 transitions. Second operand 14 states. [2018-01-24 12:15:02,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:02,758 INFO L93 Difference]: Finished difference Result 431 states and 527 transitions. [2018-01-24 12:15:02,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 12:15:02,758 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2018-01-24 12:15:02,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:02,759 INFO L225 Difference]: With dead ends: 431 [2018-01-24 12:15:02,759 INFO L226 Difference]: Without dead ends: 394 [2018-01-24 12:15:02,760 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=251, Invalid=679, Unknown=0, NotChecked=0, Total=930 [2018-01-24 12:15:02,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-01-24 12:15:02,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 227. [2018-01-24 12:15:02,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-01-24 12:15:02,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 285 transitions. [2018-01-24 12:15:02,786 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 285 transitions. Word has length 59 [2018-01-24 12:15:02,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:02,786 INFO L432 AbstractCegarLoop]: Abstraction has 227 states and 285 transitions. [2018-01-24 12:15:02,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 12:15:02,787 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 285 transitions. [2018-01-24 12:15:02,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-24 12:15:02,787 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:02,788 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:15:02,788 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:15:02,788 INFO L82 PathProgramCache]: Analyzing trace with hash 196634183, now seen corresponding path program 1 times [2018-01-24 12:15:02,788 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:02,788 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:02,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:02,789 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:02,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:02,799 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:15:02,799 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:15:02,799 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 12:15:02,806 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:02,847 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:15:02,891 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:15:02,892 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:15:02,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:02,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:02,899 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:15:02,899 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-01-24 12:15:02,934 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:15:02,935 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 16 treesize of output 7 [2018-01-24 12:15:02,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:02,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:02,942 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:15:02,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:7 [2018-01-24 12:15:02,973 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:03,000 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:15:03,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-24 12:15:03,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 12:15:03,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 12:15:03,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:15:03,001 INFO L87 Difference]: Start difference. First operand 227 states and 285 transitions. Second operand 14 states. [2018-01-24 12:15:03,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:03,818 INFO L93 Difference]: Finished difference Result 499 states and 622 transitions. [2018-01-24 12:15:03,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-24 12:15:03,818 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2018-01-24 12:15:03,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:03,820 INFO L225 Difference]: With dead ends: 499 [2018-01-24 12:15:03,820 INFO L226 Difference]: Without dead ends: 498 [2018-01-24 12:15:03,821 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=478, Invalid=1328, Unknown=0, NotChecked=0, Total=1806 [2018-01-24 12:15:03,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-01-24 12:15:03,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 264. [2018-01-24 12:15:03,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-01-24 12:15:03,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 334 transitions. [2018-01-24 12:15:03,854 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 334 transitions. Word has length 59 [2018-01-24 12:15:03,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:03,854 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 334 transitions. [2018-01-24 12:15:03,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 12:15:03,854 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 334 transitions. [2018-01-24 12:15:03,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-24 12:15:03,855 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:03,855 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:15:03,855 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:15:03,855 INFO L82 PathProgramCache]: Analyzing trace with hash 740017122, now seen corresponding path program 2 times [2018-01-24 12:15:03,855 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:03,855 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:03,856 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:03,856 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:03,856 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:03,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:15:03,947 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 12:15:03,947 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:15:03,947 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:15:03,957 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:15:03,969 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:15:03,989 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:15:04,002 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:15:04,004 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:15:04,070 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 12:15:04,105 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:15:04,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 8 [2018-01-24 12:15:04,105 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:15:04,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:15:04,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:15:04,106 INFO L87 Difference]: Start difference. First operand 264 states and 334 transitions. Second operand 8 states. [2018-01-24 12:15:04,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:04,299 INFO L93 Difference]: Finished difference Result 420 states and 534 transitions. [2018-01-24 12:15:04,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:15:04,299 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-01-24 12:15:04,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:04,300 INFO L225 Difference]: With dead ends: 420 [2018-01-24 12:15:04,301 INFO L226 Difference]: Without dead ends: 238 [2018-01-24 12:15:04,302 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:15:04,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-01-24 12:15:04,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 231. [2018-01-24 12:15:04,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-01-24 12:15:04,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 291 transitions. [2018-01-24 12:15:04,324 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 291 transitions. Word has length 60 [2018-01-24 12:15:04,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:04,324 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 291 transitions. [2018-01-24 12:15:04,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:15:04,324 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 291 transitions. [2018-01-24 12:15:04,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-24 12:15:04,325 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:04,325 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:15:04,325 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:15:04,326 INFO L82 PathProgramCache]: Analyzing trace with hash 257738368, now seen corresponding path program 1 times [2018-01-24 12:15:04,326 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:04,326 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:04,327 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:04,327 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:15:04,327 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:04,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:15:05,065 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:05,065 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:15:05,084 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:15:05,090 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:05,138 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:15:05,194 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:15:05,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:15:05,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:05,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:05,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:05,202 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-24 12:15:05,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-01-24 12:15:05,237 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:05,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 16 treesize of output 23 [2018-01-24 12:15:05,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:05,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:05,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:05,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:25 [2018-01-24 12:15:05,267 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:15:05,271 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:05,271 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:05,272 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:05,275 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:15:05,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:05,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:05,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:05,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2018-01-24 12:15:05,311 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:05,311 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:05,312 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:15:05,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:05,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:05,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2018-01-24 12:15:05,390 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 30 treesize of output 31 [2018-01-24 12:15:05,402 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:15:05,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:05,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:05,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:05,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-01-24 12:15:05,469 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 39 treesize of output 38 [2018-01-24 12:15:05,472 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:05,473 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 18 treesize of output 27 [2018-01-24 12:15:05,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:05,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:05,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:05,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2018-01-24 12:15:05,545 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 46 treesize of output 43 [2018-01-24 12:15:05,548 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:05,549 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:05,550 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:05,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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:15:05,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:05,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:05,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:05,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:57 [2018-01-24 12:15:05,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2018-01-24 12:15:05,613 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:05,613 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:05,614 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:05,614 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:05,615 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:05,616 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:05,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-01-24 12:15:05,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:05,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:05,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:05,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:70, output treesize:66 [2018-01-24 12:15:05,712 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 70 treesize of output 63 [2018-01-24 12:15:05,715 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:05,715 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:05,716 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:05,717 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:05,717 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:05,718 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:05,718 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:05,719 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:05,719 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:05,720 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:05,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 107 [2018-01-24 12:15:05,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:05,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:05,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:05,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:66 [2018-01-24 12:15:05,793 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 64 treesize of output 61 [2018-01-24 12:15:05,798 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:05,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 23 treesize of output 46 [2018-01-24 12:15:05,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-24 12:15:05,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 12:15:05,955 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 3 xjuncts. [2018-01-24 12:15:05,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:208 [2018-01-24 12:15:06,082 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 136 treesize of output 98 [2018-01-24 12:15:06,088 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:06,089 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:06,090 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:06,091 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:06,092 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:06,104 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:06,117 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:06,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 129 [2018-01-24 12:15:06,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:06,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:06,331 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 127 treesize of output 89 [2018-01-24 12:15:06,334 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:06,335 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:06,336 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:06,336 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:06,337 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:06,338 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:06,341 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:06,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 127 [2018-01-24 12:15:06,346 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:06,366 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:06,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 81 [2018-01-24 12:15:06,445 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:06,446 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:06,447 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:06,448 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:06,449 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:06,449 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:06,454 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:06,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 115 [2018-01-24 12:15:06,457 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:06,477 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:06,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-24 12:15:06,520 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:373, output treesize:318 [2018-01-24 12:15:07,000 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:07,008 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 101 treesize of output 67 [2018-01-24 12:15:07,011 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 40 treesize of output 34 [2018-01-24 12:15:07,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:07,023 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:07,024 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:07,024 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:07,025 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:07,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 52 [2018-01-24 12:15:07,029 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:07,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:07,157 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:07,158 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 124 treesize of output 87 [2018-01-24 12:15:07,161 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:07,161 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:07,162 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:07,162 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:07,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2018-01-24 12:15:07,165 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:07,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-01-24 12:15:07,178 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:15:07,184 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:15:07,207 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:07,209 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 99 treesize of output 70 [2018-01-24 12:15:07,211 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:07,212 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:07,213 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:07,213 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:07,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 49 [2018-01-24 12:15:07,217 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:07,227 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 24 treesize of output 13 [2018-01-24 12:15:07,228 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:15:07,232 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:15:07,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-01-24 12:15:07,247 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 10 variables, input treesize:325, output treesize:46 [2018-01-24 12:15:07,354 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:07,374 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:15:07,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 31 [2018-01-24 12:15:07,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-24 12:15:07,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-24 12:15:07,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=884, Unknown=2, NotChecked=0, Total=992 [2018-01-24 12:15:07,375 INFO L87 Difference]: Start difference. First operand 231 states and 291 transitions. Second operand 32 states. [2018-01-24 12:15:08,979 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 193 DAG size of output 78 [2018-01-24 12:15:09,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:09,941 INFO L93 Difference]: Finished difference Result 343 states and 415 transitions. [2018-01-24 12:15:09,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-24 12:15:09,942 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2018-01-24 12:15:09,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:09,943 INFO L225 Difference]: With dead ends: 343 [2018-01-24 12:15:09,943 INFO L226 Difference]: Without dead ends: 342 [2018-01-24 12:15:09,944 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 46 SyntacticMatches, 9 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=525, Invalid=2553, Unknown=2, NotChecked=0, Total=3080 [2018-01-24 12:15:09,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-01-24 12:15:09,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 262. [2018-01-24 12:15:09,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-01-24 12:15:09,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 328 transitions. [2018-01-24 12:15:09,962 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 328 transitions. Word has length 60 [2018-01-24 12:15:09,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:09,962 INFO L432 AbstractCegarLoop]: Abstraction has 262 states and 328 transitions. [2018-01-24 12:15:09,962 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-24 12:15:09,962 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 328 transitions. [2018-01-24 12:15:09,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-24 12:15:09,963 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:09,963 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:15:09,963 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:15:09,964 INFO L82 PathProgramCache]: Analyzing trace with hash 257738369, now seen corresponding path program 1 times [2018-01-24 12:15:09,964 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:09,964 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:09,965 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:09,965 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:09,965 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:09,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:15:10,401 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:10,401 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:15:10,417 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:15:10,422 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:10,453 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:15:10,498 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:15:10,500 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:15:10,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,510 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:15:10,511 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:15:10,511 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,512 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,517 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-01-24 12:15:10,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-01-24 12:15:10,530 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:10,531 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:15:10,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-01-24 12:15:10,548 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:10,548 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:15:10,549 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,552 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,558 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:59, output treesize:41 [2018-01-24 12:15:10,580 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:15:10,582 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:10,583 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:10,584 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:10,585 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:15:10,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,602 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:15:10,604 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:10,604 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:10,605 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:10,607 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:15:10,607 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,611 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,618 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:84, output treesize:41 [2018-01-24 12:15:10,645 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:10,646 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:10,646 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:15:10,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:49 [2018-01-24 12:15:10,712 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 30 treesize of output 31 [2018-01-24 12:15:10,715 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:15:10,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,739 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 30 treesize of output 31 [2018-01-24 12:15:10,741 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:15:10,741 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,746 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,759 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:67 [2018-01-24 12:15:10,809 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 39 treesize of output 38 [2018-01-24 12:15:10,811 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:10,812 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 18 treesize of output 27 [2018-01-24 12:15:10,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,842 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 39 treesize of output 38 [2018-01-24 12:15:10,844 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:10,845 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 18 treesize of output 27 [2018-01-24 12:15:10,845 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,852 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,868 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:85 [2018-01-24 12:15:10,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-01-24 12:15:10,914 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:10,915 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:10,915 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:10,916 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:10,916 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 55 [2018-01-24 12:15:10,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,958 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:10,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 46 treesize of output 52 [2018-01-24 12:15:10,961 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:10,962 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:10,963 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:10,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 54 [2018-01-24 12:15:10,965 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,974 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:10,995 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:102 [2018-01-24 12:15:11,042 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,043 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 67 [2018-01-24 12:15:11,050 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,051 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,054 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,055 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,057 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,060 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,082 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 106 [2018-01-24 12:15:11,083 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 12:15:11,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:11,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2018-01-24 12:15:11,165 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,166 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,167 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,168 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,169 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,169 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,170 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:11,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 90 [2018-01-24 12:15:11,171 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:11,186 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:11,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:11,210 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:120 [2018-01-24 12:15:11,266 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,267 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 86 [2018-01-24 12:15:11,272 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,274 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,276 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,277 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,278 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,280 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,280 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,282 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,284 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,308 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 136 [2018-01-24 12:15:11,309 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 12:15:11,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:11,392 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 70 treesize of output 63 [2018-01-24 12:15:11,397 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,398 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,399 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,399 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,400 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,401 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,401 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,402 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,403 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,403 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,404 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:11,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 120 [2018-01-24 12:15:11,409 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:11,428 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:11,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:11,452 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:158, output treesize:120 [2018-01-24 12:15:11,459 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,461 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2018-01-24 12:15:11,492 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,493 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,494 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,505 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 75 [2018-01-24 12:15:11,506 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 12:15:11,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:11,570 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 64 treesize of output 85 [2018-01-24 12:15:11,573 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,574 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,575 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,575 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:11,575 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 53 [2018-01-24 12:15:11,576 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:11,590 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:11,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:11,618 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:146, output treesize:162 [2018-01-24 12:15:11,684 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,686 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 277 treesize of output 262 [2018-01-24 12:15:11,697 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,698 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,699 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,699 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,700 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,701 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,711 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,726 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 108 treesize of output 294 [2018-01-24 12:15:11,727 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-24 12:15:11,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-24 12:15:11,936 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,940 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 314 treesize of output 283 [2018-01-24 12:15:11,943 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,944 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,944 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,945 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,946 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,946 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,947 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:11,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 218 [2018-01-24 12:15:11,951 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:11,987 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:11,989 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,994 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 306 treesize of output 275 [2018-01-24 12:15:11,997 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,997 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,998 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,999 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:11,999 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:12,000 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:12,001 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:12,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 218 [2018-01-24 12:15:12,005 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:12,042 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:12,045 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:12,050 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 307 treesize of output 276 [2018-01-24 12:15:12,054 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:12,055 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:12,056 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:12,057 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:12,058 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:12,059 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:12,059 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:12,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 218 [2018-01-24 12:15:12,065 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:12,111 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:12,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-01-24 12:15:12,236 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:323, output treesize:826 [2018-01-24 12:15:12,474 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:12,475 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:12,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 187 [2018-01-24 12:15:12,490 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:12,491 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:12,492 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:12,493 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:12,494 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:12,495 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:12,512 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:12,556 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 71 treesize of output 300 [2018-01-24 12:15:12,556 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-01-24 12:15:12,608 INFO L267 ElimStorePlain]: Start of recursive call 3: 50 dim-0 vars, End of recursive call: 50 dim-0 vars, and 54 xjuncts. [2018-01-24 12:15:12,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 109 [2018-01-24 12:15:12,913 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:15:12,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 122 treesize of output 133 [2018-01-24 12:15:12,942 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-01-24 12:15:13,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-01-24 12:15:13,101 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 140 treesize of output 108 [2018-01-24 12:15:13,104 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,105 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,106 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,106 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,107 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,108 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 98 [2018-01-24 12:15:13,111 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:13,137 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,138 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-01-24 12:15:13,139 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:13,157 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:13,161 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 142 treesize of output 108 [2018-01-24 12:15:13,165 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,166 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 59 [2018-01-24 12:15:13,168 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:13,190 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,191 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,192 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,200 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,201 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,202 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2018-01-24 12:15:13,205 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:13,218 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:13,221 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 138 treesize of output 104 [2018-01-24 12:15:13,226 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,227 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,228 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,229 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,229 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,230 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 98 [2018-01-24 12:15:13,235 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:13,257 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,257 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2018-01-24 12:15:13,259 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:13,274 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:13,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 110 [2018-01-24 12:15:13,283 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,284 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,285 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,286 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,287 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,288 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 98 [2018-01-24 12:15:13,293 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:13,326 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,327 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:13,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2018-01-24 12:15:13,328 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:13,389 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:13,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:15:13,669 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 4 variables, input treesize:282, output treesize:25 [2018-01-24 12:15:14,016 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:14,037 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:15:14,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 30 [2018-01-24 12:15:14,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-24 12:15:14,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-24 12:15:14,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2018-01-24 12:15:14,038 INFO L87 Difference]: Start difference. First operand 262 states and 328 transitions. Second operand 30 states. [2018-01-24 12:15:17,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:17,809 INFO L93 Difference]: Finished difference Result 383 states and 474 transitions. [2018-01-24 12:15:17,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-24 12:15:17,809 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 60 [2018-01-24 12:15:17,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:17,810 INFO L225 Difference]: With dead ends: 383 [2018-01-24 12:15:17,810 INFO L226 Difference]: Without dead ends: 330 [2018-01-24 12:15:17,811 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 48 SyntacticMatches, 10 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=570, Invalid=2400, Unknown=0, NotChecked=0, Total=2970 [2018-01-24 12:15:17,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-01-24 12:15:17,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 261. [2018-01-24 12:15:17,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-01-24 12:15:17,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 325 transitions. [2018-01-24 12:15:17,840 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 325 transitions. Word has length 60 [2018-01-24 12:15:17,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:17,840 INFO L432 AbstractCegarLoop]: Abstraction has 261 states and 325 transitions. [2018-01-24 12:15:17,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-24 12:15:17,840 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 325 transitions. [2018-01-24 12:15:17,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-24 12:15:17,841 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:17,841 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:15:17,841 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:15:17,841 INFO L82 PathProgramCache]: Analyzing trace with hash -12975118, now seen corresponding path program 1 times [2018-01-24 12:15:17,841 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:17,842 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:17,842 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:17,842 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:17,842 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:17,851 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:15:17,851 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:15:17,851 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 12:15:17,862 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:17,908 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:15:17,923 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:15:17,924 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:15:17,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:17,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:17,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:17,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-01-24 12:15:17,944 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:15:17,946 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:17,947 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:15:17,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:17,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:17,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:17,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-01-24 12:15:17,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 36 treesize of output 29 [2018-01-24 12:15:17,978 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:17,979 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:17,980 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:17,988 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:15:17,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:18,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:18,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:18,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2018-01-24 12:15:18,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-01-24 12:15:18,069 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 33 treesize of output 32 [2018-01-24 12:15:18,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:18,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:18,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:18,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-01-24 12:15:18,147 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:18,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 52 [2018-01-24 12:15:18,177 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:18,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 65 [2018-01-24 12:15:18,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-24 12:15:18,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 12:15:18,270 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 3 xjuncts. [2018-01-24 12:15:18,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:149 [2018-01-24 12:15:18,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 60 [2018-01-24 12:15:18,335 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:18,335 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 55 treesize of output 64 [2018-01-24 12:15:18,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:18,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:15:18,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 60 [2018-01-24 12:15:18,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:18,442 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 55 treesize of output 64 [2018-01-24 12:15:18,443 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:18,471 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:15:18,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 69 [2018-01-24 12:15:18,535 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:18,536 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 66 treesize of output 77 [2018-01-24 12:15:18,536 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:18,569 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:15:18,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-24 12:15:18,613 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:188, output treesize:176 [2018-01-24 12:15:18,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 77 [2018-01-24 12:15:18,686 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:18,687 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:18,688 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:18,689 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 68 treesize of output 78 [2018-01-24 12:15:18,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:18,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:18,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 77 [2018-01-24 12:15:18,812 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:18,813 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:18,813 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:18,814 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:18,815 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:18,815 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:18,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 82 [2018-01-24 12:15:18,819 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:18,853 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:18,853 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:18,854 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:18,856 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 64 treesize of output 74 [2018-01-24 12:15:18,856 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:18,875 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:18,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 86 [2018-01-24 12:15:18,947 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:18,947 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:18,948 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:18,948 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:18,949 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:18,949 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:18,950 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:18,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 103 [2018-01-24 12:15:18,959 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-01-24 12:15:19,028 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:19,029 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:19,029 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:19,031 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 75 treesize of output 87 [2018-01-24 12:15:19,032 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:19,066 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:15:19,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-24 12:15:19,108 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:233, output treesize:176 [2018-01-24 12:15:19,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 81 [2018-01-24 12:15:19,129 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:19,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 69 [2018-01-24 12:15:19,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:15:19,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:15:19,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 72 [2018-01-24 12:15:19,261 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:19,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 61 [2018-01-24 12:15:19,263 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:19,276 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:19,332 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 70 treesize of output 67 [2018-01-24 12:15:19,335 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:15:19,335 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:19,347 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:19,349 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 89 treesize of output 86 [2018-01-24 12:15:19,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:15:19,351 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:19,365 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:19,368 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 85 treesize of output 82 [2018-01-24 12:15:19,370 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:15:19,370 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:19,382 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:19,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 66 [2018-01-24 12:15:19,438 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:19,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-01-24 12:15:19,440 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:19,452 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:19,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:15:19,484 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:287, output treesize:155 [2018-01-24 12:15:19,599 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 89 treesize of output 79 [2018-01-24 12:15:19,601 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 48 treesize of output 35 [2018-01-24 12:15:19,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:19,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:19,642 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 93 treesize of output 81 [2018-01-24 12:15:19,643 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 63 treesize of output 48 [2018-01-24 12:15:19,644 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:19,654 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:19,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:15:19,681 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:183, output treesize:133 [2018-01-24 12:15:19,849 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:19,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 61 [2018-01-24 12:15:19,852 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:19,859 INFO L477 Elim1Store]: Elim1 applied some 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 38 [2018-01-24 12:15:19,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:19,874 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:19,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-01-24 12:15:19,875 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:19,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:19,902 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:19,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 59 [2018-01-24 12:15:19,905 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:19,906 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:19,910 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 45 [2018-01-24 12:15:19,911 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 12:15:19,926 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 21 treesize of output 14 [2018-01-24 12:15:19,926 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:19,933 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:19,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:19,947 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:157, output treesize:5 [2018-01-24 12:15:20,007 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:20,027 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:15:20,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-01-24 12:15:20,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 12:15:20,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 12:15:20,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:15:20,028 INFO L87 Difference]: Start difference. First operand 261 states and 325 transitions. Second operand 21 states. [2018-01-24 12:15:21,166 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 87 DAG size of output 75 [2018-01-24 12:15:21,330 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 87 DAG size of output 75 [2018-01-24 12:15:21,605 WARN L146 SmtUtils]: Spent 235ms on a formula simplification. DAG size of input: 132 DAG size of output 105 [2018-01-24 12:15:21,893 WARN L146 SmtUtils]: Spent 259ms on a formula simplification. DAG size of input: 137 DAG size of output 110 [2018-01-24 12:15:22,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:15:22,253 INFO L93 Difference]: Finished difference Result 419 states and 518 transitions. [2018-01-24 12:15:22,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-24 12:15:22,254 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 61 [2018-01-24 12:15:22,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:15:22,255 INFO L225 Difference]: With dead ends: 419 [2018-01-24 12:15:22,255 INFO L226 Difference]: Without dead ends: 418 [2018-01-24 12:15:22,256 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=300, Invalid=1592, Unknown=0, NotChecked=0, Total=1892 [2018-01-24 12:15:22,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-01-24 12:15:22,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 299. [2018-01-24 12:15:22,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-01-24 12:15:22,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 370 transitions. [2018-01-24 12:15:22,280 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 370 transitions. Word has length 61 [2018-01-24 12:15:22,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:15:22,280 INFO L432 AbstractCegarLoop]: Abstraction has 299 states and 370 transitions. [2018-01-24 12:15:22,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 12:15:22,280 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 370 transitions. [2018-01-24 12:15:22,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-24 12:15:22,281 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:15:22,281 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:15:22,281 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 12:15:22,281 INFO L82 PathProgramCache]: Analyzing trace with hash -12975117, now seen corresponding path program 1 times [2018-01-24 12:15:22,281 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:15:22,282 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:15:22,282 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:22,282 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:22,282 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:15:22,289 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:15:22,289 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:15:22,289 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 12:15:22,299 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:15:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:15:22,334 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:15:22,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 12:15:22,364 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:15:22,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:22,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:22,375 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:15:22,377 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:15:22,377 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:22,378 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:22,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:22,383 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-01-24 12:15:22,393 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:15:22,395 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:22,395 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:15:22,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:22,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:22,409 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:15:22,410 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:22,411 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:15:22,411 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:22,414 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:22,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:22,421 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-01-24 12:15:22,434 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:15:22,436 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:22,437 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:22,437 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:22,440 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:15:22,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:22,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:22,458 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:15:22,460 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:22,461 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:22,461 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:22,464 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:15:22,464 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:22,471 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:22,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:22,478 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:39 [2018-01-24 12:15:22,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-01-24 12:15:22,555 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:22,556 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:22,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-01-24 12:15:22,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:22,573 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 29 treesize of output 28 [2018-01-24 12:15:22,573 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:22,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:22,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-01-24 12:15:22,609 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 33 treesize of output 32 [2018-01-24 12:15:22,609 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:22,631 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:22,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:22,643 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:75, output treesize:67 [2018-01-24 12:15:22,691 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:22,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 69 [2018-01-24 12:15:22,712 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:22,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 86 [2018-01-24 12:15:22,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-24 12:15:22,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 12:15:22,852 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:22,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 104 [2018-01-24 12:15:22,866 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:22,867 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:22,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 146 [2018-01-24 12:15:22,868 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:22,888 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:22,893 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:22,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 88 [2018-01-24 12:15:22,905 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:22,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 78 [2018-01-24 12:15:22,906 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:22,918 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:22,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 89 treesize of output 117 [2018-01-24 12:15:22,940 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:22,941 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:22,942 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:22,942 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:22,943 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 96 treesize of output 174 [2018-01-24 12:15:22,943 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:22,979 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:23,021 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 3 xjuncts. [2018-01-24 12:15:23,021 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:109, output treesize:306 [2018-01-24 12:15:23,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 113 treesize of output 124 [2018-01-24 12:15:23,112 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:23,112 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 123 treesize of output 164 [2018-01-24 12:15:23,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:23,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:15:23,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 123 [2018-01-24 12:15:23,329 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:23,329 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 132 treesize of output 161 [2018-01-24 12:15:23,330 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:23,362 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:23,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 141 [2018-01-24 12:15:23,486 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:23,486 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 152 treesize of output 193 [2018-01-24 12:15:23,487 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:23,529 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:23,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 107 [2018-01-24 12:15:23,640 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:23,640 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 110 treesize of output 119 [2018-01-24 12:15:23,640 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:23,687 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:15:23,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 183 treesize of output 147 [2018-01-24 12:15:23,792 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:23,792 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:23,793 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 176 treesize of output 258 [2018-01-24 12:15:23,793 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:23,855 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:15:23,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 109 treesize of output 111 [2018-01-24 12:15:23,974 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:23,974 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 112 treesize of output 129 [2018-01-24 12:15:23,975 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:24,005 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:24,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-24 12:15:24,065 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:384, output treesize:493 [2018-01-24 12:15:24,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 141 [2018-01-24 12:15:24,168 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:24,169 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:24,169 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:24,172 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 142 treesize of output 152 [2018-01-24 12:15:24,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:24,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:24,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 128 treesize of output 138 [2018-01-24 12:15:24,444 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:24,445 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:24,446 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:24,448 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 125 treesize of output 162 [2018-01-24 12:15:24,448 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:24,502 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:24,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 270 treesize of output 238 [2018-01-24 12:15:24,661 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:24,667 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:24,675 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:24,679 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 263 treesize of output 295 [2018-01-24 12:15:24,679 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:24,822 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:24,823 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:24,824 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:24,829 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:24,830 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:24,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 179 treesize of output 222 [2018-01-24 12:15:24,843 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-01-24 12:15:24,949 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:15:25,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 251 treesize of output 189 [2018-01-24 12:15:25,094 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:25,095 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:25,095 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:25,096 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:25,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 161 treesize of output 184 [2018-01-24 12:15:25,109 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-01-24 12:15:25,224 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:25,225 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:25,226 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:25,229 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 214 treesize of output 293 [2018-01-24 12:15:25,230 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:25,285 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:15:25,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 189 treesize of output 173 [2018-01-24 12:15:25,409 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:25,410 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:25,411 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:25,413 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 182 treesize of output 245 [2018-01-24 12:15:25,414 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:25,494 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:25,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 156 [2018-01-24 12:15:25,589 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:25,590 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:25,591 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:25,592 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:25,592 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:25,593 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:25,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 199 [2018-01-24 12:15:25,597 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:25,659 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:25,660 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:25,661 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:25,663 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 161 treesize of output 191 [2018-01-24 12:15:25,663 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:25,688 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:25,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-24 12:15:25,750 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:607, output treesize:493 [2018-01-24 12:15:25,757 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:25,760 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:25,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 140 treesize of output 154 [2018-01-24 12:15:25,774 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:25,775 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:25,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 208 [2018-01-24 12:15:25,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:25,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:15:25,990 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:26,003 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:26,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 225 treesize of output 169 [2018-01-24 12:15:26,014 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:26,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 190 [2018-01-24 12:15:26,015 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:26,035 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:26,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 191 treesize of output 158 [2018-01-24 12:15:26,153 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:26,154 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:26,154 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 173 [2018-01-24 12:15:26,155 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:15:26,196 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 12:15:26,326 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:26,332 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:26,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 384 treesize of output 230 [2018-01-24 12:15:26,346 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:26,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 272 treesize of output 149 [2018-01-24 12:15:26,350 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:26,372 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:26,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 116 [2018-01-24 12:15:26,478 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:26,478 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:26,479 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 123 [2018-01-24 12:15:26,479 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:26,521 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:26,521 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:26,522 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:26,522 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:26,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 73 [2018-01-24 12:15:26,523 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:26,555 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:15:26,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 120 [2018-01-24 12:15:26,666 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:26,667 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:26,667 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:26,668 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:26,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 175 [2018-01-24 12:15:26,669 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:26,713 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 12:15:26,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2018-01-24 12:15:26,812 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 8 variables, input treesize:750, output treesize:632 [2018-01-24 12:15:27,211 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 125 [2018-01-24 12:15:27,214 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,216 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,218 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,221 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 85 [2018-01-24 12:15:27,222 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-24 12:15:27,258 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,259 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:27,259 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 106 [2018-01-24 12:15:27,266 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 12:15:27,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,268 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:27,269 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 0 case distinctions, treesize of input 85 treesize of output 78 [2018-01-24 12:15:27,269 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:27,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 12:15:27,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 59 [2018-01-24 12:15:27,380 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,380 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:27,381 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 29 treesize of output 24 [2018-01-24 12:15:27,381 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:27,394 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,394 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 0 case distinctions, treesize of input 25 treesize of output 13 [2018-01-24 12:15:27,395 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:27,401 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:27,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 55 [2018-01-24 12:15:27,407 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,407 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:27,407 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 0 case distinctions, treesize of input 24 treesize of output 28 [2018-01-24 12:15:27,408 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:27,422 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,422 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:27,423 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 20 treesize of output 13 [2018-01-24 12:15:27,423 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:27,432 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:27,474 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,475 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 162 [2018-01-24 12:15:27,479 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,489 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 81 [2018-01-24 12:15:27,491 INFO L267 ElimStorePlain]: Start of recursive call 13: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-01-24 12:15:27,543 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,544 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,545 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:27,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 129 [2018-01-24 12:15:27,558 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-01-24 12:15:27,560 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,561 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,562 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,562 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:27,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 131 [2018-01-24 12:15:27,571 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-01-24 12:15:27,573 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,573 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,575 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:27,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 129 [2018-01-24 12:15:27,582 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-01-24 12:15:27,584 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,584 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,585 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:15:27,585 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 0 case distinctions, treesize of input 88 treesize of output 97 [2018-01-24 12:15:27,585 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:27,684 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-01-24 12:15:27,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 71 [2018-01-24 12:15:27,766 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,766 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 51 treesize of output 27 [2018-01-24 12:15:27,766 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:27,778 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-01-24 12:15:27,778 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:27,785 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:27,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 71 [2018-01-24 12:15:27,789 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,790 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 51 treesize of output 27 [2018-01-24 12:15:27,790 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:27,801 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-01-24 12:15:27,802 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:27,808 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:27,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 71 [2018-01-24 12:15:27,813 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,813 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 51 treesize of output 27 [2018-01-24 12:15:27,813 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:27,825 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-01-24 12:15:27,825 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:27,831 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:27,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 71 [2018-01-24 12:15:27,842 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,842 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 51 treesize of output 27 [2018-01-24 12:15:27,842 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:27,856 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:15:27,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-01-24 12:15:27,857 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-01-24 12:15:27,864 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:15:27,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:15:27,927 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 6 variables, input treesize:358, output treesize:27 [2018-01-24 12:15:28,024 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:15:28,044 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:15:28,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-01-24 12:15:28,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 12:15:28,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 12:15:28,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:15:28,044 INFO L87 Difference]: Start difference. First operand 299 states and 370 transitions. Second operand 21 states. [2018-01-24 12:15:35,632 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 127 DAG size of output 127 [2018-01-24 12:15:35,789 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 119 DAG size of output 119 Received shutdown request... [2018-01-24 12:15:37,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 12:15:37,855 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 12:15:37,861 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 12:15:37,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:15:37 BoogieIcfgContainer [2018-01-24 12:15:37,861 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:15:37,862 INFO L168 Benchmark]: Toolchain (without parser) took 50596.59 ms. Allocated memory was 302.5 MB in the beginning and 775.9 MB in the end (delta: 473.4 MB). Free memory was 262.4 MB in the beginning and 347.1 MB in the end (delta: -84.7 MB). Peak memory consumption was 388.8 MB. Max. memory is 5.3 GB. [2018-01-24 12:15:37,863 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 302.5 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:15:37,863 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.30 ms. Allocated memory is still 302.5 MB. Free memory was 261.4 MB in the beginning and 250.3 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:15:37,863 INFO L168 Benchmark]: Boogie Preprocessor took 40.15 ms. Allocated memory is still 302.5 MB. Free memory was 250.3 MB in the beginning and 248.3 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:15:37,864 INFO L168 Benchmark]: RCFGBuilder took 523.99 ms. Allocated memory is still 302.5 MB. Free memory was 248.3 MB in the beginning and 218.3 MB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:15:37,864 INFO L168 Benchmark]: TraceAbstraction took 49805.85 ms. Allocated memory was 302.5 MB in the beginning and 775.9 MB in the end (delta: 473.4 MB). Free memory was 218.3 MB in the beginning and 347.1 MB in the end (delta: -128.8 MB). Peak memory consumption was 344.7 MB. Max. memory is 5.3 GB. [2018-01-24 12:15:37,865 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.19 ms. Allocated memory is still 302.5 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 217.30 ms. Allocated memory is still 302.5 MB. Free memory was 261.4 MB in the beginning and 250.3 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.15 ms. Allocated memory is still 302.5 MB. Free memory was 250.3 MB in the beginning and 248.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 523.99 ms. Allocated memory is still 302.5 MB. Free memory was 248.3 MB in the beginning and 218.3 MB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 49805.85 ms. Allocated memory was 302.5 MB in the beginning and 775.9 MB in the end (delta: 473.4 MB). Free memory was 218.3 MB in the beginning and 347.1 MB in the end (delta: -128.8 MB). Peak memory consumption was 344.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (299states) and interpolant automaton (currently 25 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (189 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 101 locations, 41 error locations. TIMEOUT Result, 49.7s OverallTime, 37 OverallIterations, 3 TraceHistogramMax, 27.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2818 SDtfs, 8171 SDslu, 10324 SDs, 0 SdLazy, 8617 SolverSat, 737 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 17.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1531 GetRequests, 982 SyntacticMatches, 38 SemanticMatches, 511 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3041 ImplicationChecksByTransitivity, 14.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=299occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 36 MinimizatonAttempts, 2117 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 19.0s InterpolantComputationTime, 1893 NumberOfCodeBlocks, 1893 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1848 ConstructedInterpolants, 104 QuantifiedInterpolants, 1901197 SizeOfPredicates, 170 NumberOfNonLiveVariables, 4899 ConjunctsInSsa, 423 ConjunctsInUnsatCore, 45 InterpolantComputations, 24 PerfectInterpolantSequences, 226/418 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-15-37-875.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-15-37-875.csv Completed graceful shutdown