java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/memsafety/20020406-1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:48:54,953 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:48:54,955 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:48:54,967 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:48:54,968 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:48:54,968 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:48:54,969 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:48:54,971 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:48:54,972 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:48:54,973 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:48:54,974 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:48:54,974 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:48:54,974 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:48:54,975 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:48:54,976 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:48:54,978 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:48:54,979 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:48:54,981 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:48:54,981 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:48:54,982 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:48:54,984 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:48:54,984 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:48:54,984 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:48:54,985 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:48:54,987 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:48:54,988 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:48:54,988 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:48:54,989 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:48:54,989 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:48:54,989 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:48:54,990 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:48:54,990 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 17:48:54,999 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:48:54,999 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:48:55,000 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:48:55,000 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:48:55,000 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:48:55,000 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:48:55,000 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:48:55,001 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:48:55,001 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:48:55,001 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:48:55,001 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:48:55,001 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:48:55,001 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:48:55,001 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:48:55,002 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:48:55,002 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:48:55,002 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:48:55,002 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:48:55,002 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:48:55,002 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:48:55,003 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:48:55,003 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:48:55,003 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:48:55,003 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:48:55,029 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:48:55,038 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:48:55,043 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:48:55,044 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:48:55,044 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:48:55,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/20020406-1_false-valid-memtrack.i [2018-02-04 17:48:55,209 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:48:55,210 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:48:55,211 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:48:55,211 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:48:55,216 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:48:55,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:48:55" (1/1) ... [2018-02-04 17:48:55,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b7dd1ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:48:55, skipping insertion in model container [2018-02-04 17:48:55,218 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:48:55" (1/1) ... [2018-02-04 17:48:55,229 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:48:55,266 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:48:55,364 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:48:55,384 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:48:55,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:48:55 WrapperNode [2018-02-04 17:48:55,390 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:48:55,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:48:55,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:48:55,391 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:48:55,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:48:55" (1/1) ... [2018-02-04 17:48:55,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:48:55" (1/1) ... [2018-02-04 17:48:55,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:48:55" (1/1) ... [2018-02-04 17:48:55,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:48:55" (1/1) ... [2018-02-04 17:48:55,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:48:55" (1/1) ... [2018-02-04 17:48:55,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:48:55" (1/1) ... [2018-02-04 17:48:55,422 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:48:55" (1/1) ... [2018-02-04 17:48:55,424 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:48:55,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:48:55,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:48:55,425 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:48:55,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:48:55" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:48:55,459 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:48:55,459 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:48:55,459 INFO L136 BoogieDeclarations]: Found implementation of procedure FFmul [2018-02-04 17:48:55,459 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFdeg [2018-02-04 17:48:55,459 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFnew [2018-02-04 17:48:55,459 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFfree [2018-02-04 17:48:55,459 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFswap [2018-02-04 17:48:55,459 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFcopy [2018-02-04 17:48:55,460 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFshift_add [2018-02-04 17:48:55,460 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFexgcd [2018-02-04 17:48:55,460 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:48:55,460 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:48:55,460 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:48:55,460 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 17:48:55,460 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 17:48:55,460 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:48:55,460 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:48:55,460 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:48:55,460 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-04 17:48:55,460 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-04 17:48:55,460 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 17:48:55,460 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-04 17:48:55,461 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-04 17:48:55,461 INFO L128 BoogieDeclarations]: Found specification of procedure FFmul [2018-02-04 17:48:55,461 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFdeg [2018-02-04 17:48:55,461 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFnew [2018-02-04 17:48:55,461 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFfree [2018-02-04 17:48:55,461 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFswap [2018-02-04 17:48:55,461 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFcopy [2018-02-04 17:48:55,461 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFshift_add [2018-02-04 17:48:55,461 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFexgcd [2018-02-04 17:48:55,461 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:48:55,461 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:48:55,461 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:48:55,639 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-04 17:48:55,899 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:48:55,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:48:55 BoogieIcfgContainer [2018-02-04 17:48:55,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:48:55,901 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:48:55,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:48:55,904 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:48:55,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:48:55" (1/3) ... [2018-02-04 17:48:55,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b644061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:48:55, skipping insertion in model container [2018-02-04 17:48:55,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:48:55" (2/3) ... [2018-02-04 17:48:55,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b644061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:48:55, skipping insertion in model container [2018-02-04 17:48:55,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:48:55" (3/3) ... [2018-02-04 17:48:55,907 INFO L107 eAbstractionObserver]: Analyzing ICFG 20020406-1_false-valid-memtrack.i [2018-02-04 17:48:55,913 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:48:55,918 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-02-04 17:48:55,951 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:48:55,951 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:48:55,951 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:48:55,951 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:48:55,952 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:48:55,952 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:48:55,952 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:48:55,952 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:48:55,952 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:48:55,965 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states. [2018-02-04 17:48:55,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:48:55,971 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:48:55,972 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:48:55,972 INFO L371 AbstractCegarLoop]: === Iteration 1 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:48:55,975 INFO L82 PathProgramCache]: Analyzing trace with hash 167141018, now seen corresponding path program 1 times [2018-02-04 17:48:55,977 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:48:55,977 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:48:56,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:56,010 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:48:56,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:48:56,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:48:56,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:48:56,115 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:48:56,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:48:56,116 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:48:56,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:48:56,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:48:56,189 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 4 states. [2018-02-04 17:48:56,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:48:56,392 INFO L93 Difference]: Finished difference Result 205 states and 241 transitions. [2018-02-04 17:48:56,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:48:56,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 17:48:56,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:48:56,405 INFO L225 Difference]: With dead ends: 205 [2018-02-04 17:48:56,405 INFO L226 Difference]: Without dead ends: 202 [2018-02-04 17:48:56,406 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:48:56,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-04 17:48:56,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-02-04 17:48:56,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-02-04 17:48:56,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 238 transitions. [2018-02-04 17:48:56,450 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 238 transitions. Word has length 14 [2018-02-04 17:48:56,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:48:56,451 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 238 transitions. [2018-02-04 17:48:56,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:48:56,451 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 238 transitions. [2018-02-04 17:48:56,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:48:56,451 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:48:56,452 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:48:56,452 INFO L371 AbstractCegarLoop]: === Iteration 2 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:48:56,452 INFO L82 PathProgramCache]: Analyzing trace with hash 167141019, now seen corresponding path program 1 times [2018-02-04 17:48:56,452 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:48:56,452 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:48:56,453 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:56,453 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:48:56,453 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:48:56,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:48:56,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:48:56,532 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:48:56,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:48:56,533 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:48:56,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:48:56,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:48:56,533 INFO L87 Difference]: Start difference. First operand 202 states and 238 transitions. Second operand 4 states. [2018-02-04 17:48:56,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:48:56,668 INFO L93 Difference]: Finished difference Result 206 states and 247 transitions. [2018-02-04 17:48:56,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:48:56,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 17:48:56,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:48:56,671 INFO L225 Difference]: With dead ends: 206 [2018-02-04 17:48:56,671 INFO L226 Difference]: Without dead ends: 206 [2018-02-04 17:48:56,672 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:48:56,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-04 17:48:56,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2018-02-04 17:48:56,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-02-04 17:48:56,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 239 transitions. [2018-02-04 17:48:56,683 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 239 transitions. Word has length 14 [2018-02-04 17:48:56,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:48:56,683 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 239 transitions. [2018-02-04 17:48:56,683 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:48:56,683 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 239 transitions. [2018-02-04 17:48:56,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 17:48:56,683 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:48:56,684 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:48:56,684 INFO L371 AbstractCegarLoop]: === Iteration 3 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:48:56,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1430949362, now seen corresponding path program 1 times [2018-02-04 17:48:56,684 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:48:56,684 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:48:56,685 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:56,685 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:48:56,685 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:48:56,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:48:56,711 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:48:56,711 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:48:56,712 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:48:56,712 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:48:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:48:56,744 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:48:56,776 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:48:56,777 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:48:56,781 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-02-04 17:48:56,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:48:56,790 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 21 [2018-02-04 17:48:56,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:48:56,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:48:56,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:26 [2018-02-04 17:48:56,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:48:56,805 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:48:56,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:48:56,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:48:56,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:48:56,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:48:56,806 INFO L87 Difference]: Start difference. First operand 203 states and 239 transitions. Second operand 4 states. [2018-02-04 17:48:56,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:48:56,999 INFO L93 Difference]: Finished difference Result 204 states and 245 transitions. [2018-02-04 17:48:57,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:48:57,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-04 17:48:57,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:48:57,002 INFO L225 Difference]: With dead ends: 204 [2018-02-04 17:48:57,002 INFO L226 Difference]: Without dead ends: 204 [2018-02-04 17:48:57,002 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:48:57,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-02-04 17:48:57,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2018-02-04 17:48:57,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-02-04 17:48:57,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 237 transitions. [2018-02-04 17:48:57,012 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 237 transitions. Word has length 17 [2018-02-04 17:48:57,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:48:57,012 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 237 transitions. [2018-02-04 17:48:57,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:48:57,012 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 237 transitions. [2018-02-04 17:48:57,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 17:48:57,013 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:48:57,013 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:48:57,013 INFO L371 AbstractCegarLoop]: === Iteration 4 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:48:57,013 INFO L82 PathProgramCache]: Analyzing trace with hash 752800660, now seen corresponding path program 1 times [2018-02-04 17:48:57,013 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:48:57,013 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:48:57,014 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:57,014 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:48:57,014 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:48:57,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:48:57,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:48:57,073 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:48:57,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:48:57,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:48:57,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:48:57,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:48:57,074 INFO L87 Difference]: Start difference. First operand 201 states and 237 transitions. Second operand 5 states. [2018-02-04 17:48:57,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:48:57,253 INFO L93 Difference]: Finished difference Result 203 states and 244 transitions. [2018-02-04 17:48:57,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:48:57,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-04 17:48:57,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:48:57,255 INFO L225 Difference]: With dead ends: 203 [2018-02-04 17:48:57,255 INFO L226 Difference]: Without dead ends: 203 [2018-02-04 17:48:57,255 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:48:57,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-04 17:48:57,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 200. [2018-02-04 17:48:57,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-02-04 17:48:57,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 236 transitions. [2018-02-04 17:48:57,264 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 236 transitions. Word has length 19 [2018-02-04 17:48:57,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:48:57,265 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 236 transitions. [2018-02-04 17:48:57,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:48:57,265 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 236 transitions. [2018-02-04 17:48:57,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 17:48:57,265 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:48:57,265 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:48:57,266 INFO L371 AbstractCegarLoop]: === Iteration 5 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:48:57,266 INFO L82 PathProgramCache]: Analyzing trace with hash 752800661, now seen corresponding path program 1 times [2018-02-04 17:48:57,266 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:48:57,266 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:48:57,267 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:57,267 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:48:57,267 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:48:57,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:48:57,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:48:57,327 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:48:57,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:48:57,327 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:48:57,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:48:57,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:48:57,328 INFO L87 Difference]: Start difference. First operand 200 states and 236 transitions. Second operand 5 states. [2018-02-04 17:48:57,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:48:57,511 INFO L93 Difference]: Finished difference Result 202 states and 243 transitions. [2018-02-04 17:48:57,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:48:57,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-04 17:48:57,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:48:57,513 INFO L225 Difference]: With dead ends: 202 [2018-02-04 17:48:57,513 INFO L226 Difference]: Without dead ends: 202 [2018-02-04 17:48:57,513 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:48:57,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-04 17:48:57,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2018-02-04 17:48:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-04 17:48:57,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 235 transitions. [2018-02-04 17:48:57,521 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 235 transitions. Word has length 19 [2018-02-04 17:48:57,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:48:57,521 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 235 transitions. [2018-02-04 17:48:57,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:48:57,522 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 235 transitions. [2018-02-04 17:48:57,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 17:48:57,522 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:48:57,522 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:48:57,523 INFO L371 AbstractCegarLoop]: === Iteration 6 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:48:57,523 INFO L82 PathProgramCache]: Analyzing trace with hash -439424694, now seen corresponding path program 1 times [2018-02-04 17:48:57,523 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:48:57,523 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:48:57,524 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:57,524 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:48:57,524 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:48:57,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:48:57,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:48:57,582 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:48:57,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:48:57,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:48:57,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:48:57,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:48:57,583 INFO L87 Difference]: Start difference. First operand 199 states and 235 transitions. Second operand 5 states. [2018-02-04 17:48:57,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:48:57,627 INFO L93 Difference]: Finished difference Result 216 states and 257 transitions. [2018-02-04 17:48:57,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:48:57,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-02-04 17:48:57,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:48:57,629 INFO L225 Difference]: With dead ends: 216 [2018-02-04 17:48:57,629 INFO L226 Difference]: Without dead ends: 216 [2018-02-04 17:48:57,630 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:48:57,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-04 17:48:57,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2018-02-04 17:48:57,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-04 17:48:57,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 257 transitions. [2018-02-04 17:48:57,638 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 257 transitions. Word has length 22 [2018-02-04 17:48:57,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:48:57,638 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 257 transitions. [2018-02-04 17:48:57,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:48:57,638 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 257 transitions. [2018-02-04 17:48:57,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 17:48:57,639 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:48:57,639 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:48:57,639 INFO L371 AbstractCegarLoop]: === Iteration 7 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:48:57,639 INFO L82 PathProgramCache]: Analyzing trace with hash -2032937790, now seen corresponding path program 1 times [2018-02-04 17:48:57,639 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:48:57,640 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:48:57,640 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:57,640 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:48:57,640 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:48:57,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:48:57,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:48:57,686 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:48:57,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:48:57,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:48:57,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:48:57,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:48:57,687 INFO L87 Difference]: Start difference. First operand 214 states and 257 transitions. Second operand 5 states. [2018-02-04 17:48:57,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:48:57,726 INFO L93 Difference]: Finished difference Result 212 states and 253 transitions. [2018-02-04 17:48:57,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:48:57,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-04 17:48:57,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:48:57,727 INFO L225 Difference]: With dead ends: 212 [2018-02-04 17:48:57,727 INFO L226 Difference]: Without dead ends: 212 [2018-02-04 17:48:57,727 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:48:57,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-04 17:48:57,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2018-02-04 17:48:57,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-04 17:48:57,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 251 transitions. [2018-02-04 17:48:57,731 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 251 transitions. Word has length 26 [2018-02-04 17:48:57,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:48:57,732 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 251 transitions. [2018-02-04 17:48:57,732 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:48:57,732 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 251 transitions. [2018-02-04 17:48:57,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 17:48:57,732 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:48:57,732 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:48:57,732 INFO L371 AbstractCegarLoop]: === Iteration 8 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:48:57,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1616475983, now seen corresponding path program 1 times [2018-02-04 17:48:57,732 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:48:57,732 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:48:57,733 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:57,733 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:48:57,733 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:48:57,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:48:57,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:48:57,776 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:48:57,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:48:57,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:48:57,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:48:57,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:48:57,777 INFO L87 Difference]: Start difference. First operand 210 states and 251 transitions. Second operand 6 states. [2018-02-04 17:48:57,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:48:57,945 INFO L93 Difference]: Finished difference Result 208 states and 249 transitions. [2018-02-04 17:48:57,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:48:57,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-02-04 17:48:57,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:48:57,947 INFO L225 Difference]: With dead ends: 208 [2018-02-04 17:48:57,947 INFO L226 Difference]: Without dead ends: 208 [2018-02-04 17:48:57,948 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:48:57,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-04 17:48:57,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-02-04 17:48:57,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-04 17:48:57,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 249 transitions. [2018-02-04 17:48:57,954 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 249 transitions. Word has length 32 [2018-02-04 17:48:57,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:48:57,955 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 249 transitions. [2018-02-04 17:48:57,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:48:57,955 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 249 transitions. [2018-02-04 17:48:57,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 17:48:57,956 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:48:57,956 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:48:57,956 INFO L371 AbstractCegarLoop]: === Iteration 9 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:48:57,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1616475984, now seen corresponding path program 1 times [2018-02-04 17:48:57,957 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:48:57,957 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:48:57,957 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:57,958 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:48:57,958 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:48:57,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:48:58,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:48:58,047 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:48:58,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:48:58,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:48:58,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:48:58,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:48:58,048 INFO L87 Difference]: Start difference. First operand 208 states and 249 transitions. Second operand 8 states. [2018-02-04 17:48:58,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:48:58,246 INFO L93 Difference]: Finished difference Result 206 states and 247 transitions. [2018-02-04 17:48:58,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:48:58,247 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-02-04 17:48:58,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:48:58,248 INFO L225 Difference]: With dead ends: 206 [2018-02-04 17:48:58,248 INFO L226 Difference]: Without dead ends: 206 [2018-02-04 17:48:58,249 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:48:58,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-04 17:48:58,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-02-04 17:48:58,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-04 17:48:58,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 247 transitions. [2018-02-04 17:48:58,255 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 247 transitions. Word has length 32 [2018-02-04 17:48:58,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:48:58,255 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 247 transitions. [2018-02-04 17:48:58,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:48:58,255 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 247 transitions. [2018-02-04 17:48:58,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 17:48:58,256 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:48:58,256 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:48:58,256 INFO L371 AbstractCegarLoop]: === Iteration 10 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:48:58,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1428852052, now seen corresponding path program 1 times [2018-02-04 17:48:58,256 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:48:58,257 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:48:58,257 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:58,257 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:48:58,257 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:48:58,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:48:58,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:48:58,337 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:48:58,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:48:58,338 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:48:58,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:48:58,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:48:58,338 INFO L87 Difference]: Start difference. First operand 206 states and 247 transitions. Second operand 7 states. [2018-02-04 17:48:58,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:48:58,423 INFO L93 Difference]: Finished difference Result 215 states and 261 transitions. [2018-02-04 17:48:58,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 17:48:58,424 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-02-04 17:48:58,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:48:58,425 INFO L225 Difference]: With dead ends: 215 [2018-02-04 17:48:58,426 INFO L226 Difference]: Without dead ends: 215 [2018-02-04 17:48:58,426 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:48:58,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-04 17:48:58,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-02-04 17:48:58,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-04 17:48:58,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 261 transitions. [2018-02-04 17:48:58,433 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 261 transitions. Word has length 33 [2018-02-04 17:48:58,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:48:58,433 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 261 transitions. [2018-02-04 17:48:58,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:48:58,433 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 261 transitions. [2018-02-04 17:48:58,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 17:48:58,434 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:48:58,434 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:48:58,434 INFO L371 AbstractCegarLoop]: === Iteration 11 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:48:58,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1006536674, now seen corresponding path program 1 times [2018-02-04 17:48:58,434 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:48:58,434 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:48:58,435 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:58,435 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:48:58,435 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:48:58,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:48:58,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:48:58,508 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:48:58,508 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:48:58,508 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:48:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:48:58,524 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:48:58,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:48:58,551 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:48:58,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-02-04 17:48:58,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:48:58,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:48:58,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:48:58,552 INFO L87 Difference]: Start difference. First operand 215 states and 261 transitions. Second operand 11 states. [2018-02-04 17:48:58,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:48:58,692 INFO L93 Difference]: Finished difference Result 230 states and 280 transitions. [2018-02-04 17:48:58,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:48:58,695 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-02-04 17:48:58,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:48:58,696 INFO L225 Difference]: With dead ends: 230 [2018-02-04 17:48:58,696 INFO L226 Difference]: Without dead ends: 229 [2018-02-04 17:48:58,697 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:48:58,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-04 17:48:58,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 216. [2018-02-04 17:48:58,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-04 17:48:58,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 258 transitions. [2018-02-04 17:48:58,703 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 258 transitions. Word has length 34 [2018-02-04 17:48:58,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:48:58,704 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 258 transitions. [2018-02-04 17:48:58,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:48:58,704 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 258 transitions. [2018-02-04 17:48:58,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 17:48:58,705 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:48:58,705 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:48:58,705 INFO L371 AbstractCegarLoop]: === Iteration 12 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:48:58,705 INFO L82 PathProgramCache]: Analyzing trace with hash -799661844, now seen corresponding path program 2 times [2018-02-04 17:48:58,705 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:48:58,705 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:48:58,706 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:58,706 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:48:58,706 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:48:58,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:48:58,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:48:58,792 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:48:58,792 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:48:58,793 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:48:58,814 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:48:58,814 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:48:58,817 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:48:58,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:48:58,846 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:48:58,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2018-02-04 17:48:58,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 17:48:58,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 17:48:58,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:48:58,847 INFO L87 Difference]: Start difference. First operand 216 states and 258 transitions. Second operand 12 states. [2018-02-04 17:48:59,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:48:59,007 INFO L93 Difference]: Finished difference Result 233 states and 279 transitions. [2018-02-04 17:48:59,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 17:48:59,008 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-02-04 17:48:59,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:48:59,008 INFO L225 Difference]: With dead ends: 233 [2018-02-04 17:48:59,009 INFO L226 Difference]: Without dead ends: 227 [2018-02-04 17:48:59,009 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:48:59,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-02-04 17:48:59,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 217. [2018-02-04 17:48:59,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-04 17:48:59,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 260 transitions. [2018-02-04 17:48:59,015 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 260 transitions. Word has length 35 [2018-02-04 17:48:59,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:48:59,016 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 260 transitions. [2018-02-04 17:48:59,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 17:48:59,016 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 260 transitions. [2018-02-04 17:48:59,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 17:48:59,016 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:48:59,017 INFO L351 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:48:59,017 INFO L371 AbstractCegarLoop]: === Iteration 13 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:48:59,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1318490590, now seen corresponding path program 3 times [2018-02-04 17:48:59,017 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:48:59,017 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:48:59,018 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:59,018 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:48:59,018 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:48:59,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:48:59,086 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:48:59,086 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:48:59,086 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:48:59,087 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:48:59,111 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-04 17:48:59,112 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:48:59,115 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:48:59,148 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:48:59,148 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:48:59,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2018-02-04 17:48:59,149 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:48:59,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:48:59,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:48:59,149 INFO L87 Difference]: Start difference. First operand 217 states and 260 transitions. Second operand 13 states. [2018-02-04 17:48:59,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:48:59,294 INFO L93 Difference]: Finished difference Result 236 states and 283 transitions. [2018-02-04 17:48:59,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 17:48:59,295 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-02-04 17:48:59,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:48:59,296 INFO L225 Difference]: With dead ends: 236 [2018-02-04 17:48:59,296 INFO L226 Difference]: Without dead ends: 230 [2018-02-04 17:48:59,296 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-02-04 17:48:59,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-02-04 17:48:59,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 218. [2018-02-04 17:48:59,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-04 17:48:59,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 262 transitions. [2018-02-04 17:48:59,300 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 262 transitions. Word has length 36 [2018-02-04 17:48:59,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:48:59,300 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 262 transitions. [2018-02-04 17:48:59,300 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:48:59,300 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 262 transitions. [2018-02-04 17:48:59,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 17:48:59,301 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:48:59,301 INFO L351 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:48:59,301 INFO L371 AbstractCegarLoop]: === Iteration 14 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:48:59,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1738260692, now seen corresponding path program 4 times [2018-02-04 17:48:59,301 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:48:59,301 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:48:59,302 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:59,302 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:48:59,302 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:48:59,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:48:59,375 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:48:59,375 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:48:59,375 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:48:59,376 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:48:59,385 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:48:59,385 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:48:59,387 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:48:59,497 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:48:59,497 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:48:59,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 14 [2018-02-04 17:48:59,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 17:48:59,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 17:48:59,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:48:59,498 INFO L87 Difference]: Start difference. First operand 218 states and 262 transitions. Second operand 14 states. [2018-02-04 17:48:59,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:48:59,652 INFO L93 Difference]: Finished difference Result 239 states and 287 transitions. [2018-02-04 17:48:59,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 17:48:59,652 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-02-04 17:48:59,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:48:59,654 INFO L225 Difference]: With dead ends: 239 [2018-02-04 17:48:59,654 INFO L226 Difference]: Without dead ends: 233 [2018-02-04 17:48:59,654 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2018-02-04 17:48:59,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-04 17:48:59,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 219. [2018-02-04 17:48:59,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-04 17:48:59,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 264 transitions. [2018-02-04 17:48:59,660 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 264 transitions. Word has length 37 [2018-02-04 17:48:59,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:48:59,660 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 264 transitions. [2018-02-04 17:48:59,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 17:48:59,660 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 264 transitions. [2018-02-04 17:48:59,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 17:48:59,661 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:48:59,661 INFO L351 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:48:59,661 INFO L371 AbstractCegarLoop]: === Iteration 15 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:48:59,661 INFO L82 PathProgramCache]: Analyzing trace with hash -2008269922, now seen corresponding path program 5 times [2018-02-04 17:48:59,661 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:48:59,661 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:48:59,662 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:59,662 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:48:59,662 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:48:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:48:59,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:48:59,759 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:48:59,759 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:48:59,760 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:48:59,760 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:48:59,777 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-02-04 17:48:59,778 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:48:59,780 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:48:59,818 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:48:59,818 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:48:59,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 15 [2018-02-04 17:48:59,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 17:48:59,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 17:48:59,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:48:59,819 INFO L87 Difference]: Start difference. First operand 219 states and 264 transitions. Second operand 15 states. [2018-02-04 17:49:00,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:49:00,036 INFO L93 Difference]: Finished difference Result 242 states and 291 transitions. [2018-02-04 17:49:00,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 17:49:00,037 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2018-02-04 17:49:00,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:49:00,038 INFO L225 Difference]: With dead ends: 242 [2018-02-04 17:49:00,038 INFO L226 Difference]: Without dead ends: 236 [2018-02-04 17:49:00,038 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2018-02-04 17:49:00,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-02-04 17:49:00,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 220. [2018-02-04 17:49:00,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-04 17:49:00,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 266 transitions. [2018-02-04 17:49:00,047 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 266 transitions. Word has length 38 [2018-02-04 17:49:00,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:49:00,047 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 266 transitions. [2018-02-04 17:49:00,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 17:49:00,047 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 266 transitions. [2018-02-04 17:49:00,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 17:49:00,048 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:49:00,048 INFO L351 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:49:00,048 INFO L371 AbstractCegarLoop]: === Iteration 16 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:49:00,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1788621460, now seen corresponding path program 6 times [2018-02-04 17:49:00,048 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:49:00,048 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:49:00,049 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:49:00,049 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:49:00,049 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:49:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:49:00,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:49:00,157 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:49:00,157 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:49:00,157 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:49:00,158 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:49:00,182 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-02-04 17:49:00,182 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:49:00,185 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:49:00,230 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:49:00,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:49:00,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 16 [2018-02-04 17:49:00,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 17:49:00,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 17:49:00,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:49:00,232 INFO L87 Difference]: Start difference. First operand 220 states and 266 transitions. Second operand 16 states. [2018-02-04 17:49:00,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:49:00,483 INFO L93 Difference]: Finished difference Result 245 states and 295 transitions. [2018-02-04 17:49:00,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 17:49:00,483 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-02-04 17:49:00,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:49:00,485 INFO L225 Difference]: With dead ends: 245 [2018-02-04 17:49:00,485 INFO L226 Difference]: Without dead ends: 239 [2018-02-04 17:49:00,485 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2018-02-04 17:49:00,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-04 17:49:00,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 221. [2018-02-04 17:49:00,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-04 17:49:00,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 268 transitions. [2018-02-04 17:49:00,491 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 268 transitions. Word has length 39 [2018-02-04 17:49:00,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:49:00,491 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 268 transitions. [2018-02-04 17:49:00,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 17:49:00,491 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 268 transitions. [2018-02-04 17:49:00,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 17:49:00,492 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:49:00,492 INFO L351 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:49:00,492 INFO L371 AbstractCegarLoop]: === Iteration 17 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:49:00,492 INFO L82 PathProgramCache]: Analyzing trace with hash 725513566, now seen corresponding path program 7 times [2018-02-04 17:49:00,492 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:49:00,492 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:49:00,493 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:49:00,493 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:49:00,493 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:49:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:49:00,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:49:00,595 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:49:00,596 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:49:00,596 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:49:00,597 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:49:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:49:00,613 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:49:00,658 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:49:00,659 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:49:00,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 17 [2018-02-04 17:49:00,659 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:49:00,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:49:00,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:49:00,660 INFO L87 Difference]: Start difference. First operand 221 states and 268 transitions. Second operand 17 states. [2018-02-04 17:49:00,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:49:00,895 INFO L93 Difference]: Finished difference Result 248 states and 299 transitions. [2018-02-04 17:49:00,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 17:49:00,895 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-02-04 17:49:00,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:49:00,896 INFO L225 Difference]: With dead ends: 248 [2018-02-04 17:49:00,897 INFO L226 Difference]: Without dead ends: 242 [2018-02-04 17:49:00,897 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=173, Invalid=529, Unknown=0, NotChecked=0, Total=702 [2018-02-04 17:49:00,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-04 17:49:00,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 222. [2018-02-04 17:49:00,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-04 17:49:00,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 270 transitions. [2018-02-04 17:49:00,903 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 270 transitions. Word has length 40 [2018-02-04 17:49:00,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:49:00,903 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 270 transitions. [2018-02-04 17:49:00,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:49:00,903 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 270 transitions. [2018-02-04 17:49:00,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 17:49:00,904 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:49:00,904 INFO L351 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:49:00,904 INFO L371 AbstractCegarLoop]: === Iteration 18 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:49:00,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1354288044, now seen corresponding path program 8 times [2018-02-04 17:49:00,904 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:49:00,904 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:49:00,905 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:49:00,905 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:49:00,905 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:49:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:49:00,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:49:00,927 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:49:00,927 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:49:00,927 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:49:00,928 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:49:00,970 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:49:00,971 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:49:00,975 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:49:00,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:49:00,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:49:01,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 17:49:01,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:49:01,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:49:01,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:18 [2018-02-04 17:49:01,021 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2018-02-04 17:49:01,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:49:01,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 17:49:01,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 17:49:01,037 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:49:01,039 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:01,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 17:49:01,047 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:45 [2018-02-04 17:49:01,087 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 20 [2018-02-04 17:49:01,088 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 9 treesize of output 5 [2018-02-04 17:49:01,088 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:49:01,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:49:01,109 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 25 treesize of output 21 [2018-02-04 17:49:01,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-02-04 17:49:01,112 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:49:01,118 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:49:01,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 17:49:01,133 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:48, output treesize:19 [2018-02-04 17:49:01,147 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_8 Int)) (= 1 (select |c_#valid| v_arrayElimCell_8))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_33| Int)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_33|) 0))))) is different from true [2018-02-04 17:49:01,159 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_8 Int)) (= 1 (select |c_#valid| v_arrayElimCell_8))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_33| Int) (|v_#Ultimate.C_memset_#t~loopctr54_34| Int)) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_33|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_34|) 0)) |c_#memory_$Pointer$.base|))) is different from true [2018-02-04 17:49:01,164 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_8 Int)) (= 1 (select |c_#valid| v_arrayElimCell_8))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_33| Int) (|v_#Ultimate.C_memset_#t~loopctr54_35| Int) (|v_#Ultimate.C_memset_#t~loopctr54_34| Int)) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_33|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_34|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_35|) 0)) |c_#memory_$Pointer$.base|))) is different from true [2018-02-04 17:49:01,169 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_8 Int)) (= 1 (select |c_#valid| v_arrayElimCell_8))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_36| Int) (|v_#Ultimate.C_memset_#t~loopctr54_33| Int) (|v_#Ultimate.C_memset_#t~loopctr54_35| Int) (|v_#Ultimate.C_memset_#t~loopctr54_34| Int)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_33|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_34|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_35|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_36| |c_#Ultimate.C_memset_#ptr.offset|) 0))))) is different from true [2018-02-04 17:49:01,174 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_8 Int)) (= 1 (select |c_#valid| v_arrayElimCell_8))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_37| Int) (|v_#Ultimate.C_memset_#t~loopctr54_36| Int) (|v_#Ultimate.C_memset_#t~loopctr54_33| Int) (|v_#Ultimate.C_memset_#t~loopctr54_35| Int) (|v_#Ultimate.C_memset_#t~loopctr54_34| Int)) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_33|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_34|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_35|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_36| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_37| |c_#Ultimate.C_memset_#ptr.offset|) 0)) |c_#memory_$Pointer$.base|))) is different from true [2018-02-04 17:49:01,184 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_8 Int)) (= 1 (select |c_#valid| v_arrayElimCell_8))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_37| Int) (|v_#Ultimate.C_memset_#t~loopctr54_36| Int) (|v_#Ultimate.C_memset_#t~loopctr54_38| Int) (|v_#Ultimate.C_memset_#t~loopctr54_33| Int) (|v_#Ultimate.C_memset_#t~loopctr54_35| Int) (|v_#Ultimate.C_memset_#t~loopctr54_34| Int)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_33|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_34|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_35|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_36| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_37| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_38|) 0))))) is different from true [2018-02-04 17:49:01,192 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_8 Int)) (= 1 (select |c_#valid| v_arrayElimCell_8))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_37| Int) (|v_#Ultimate.C_memset_#t~loopctr54_36| Int) (|v_#Ultimate.C_memset_#t~loopctr54_39| Int) (|v_#Ultimate.C_memset_#t~loopctr54_38| Int) (|v_#Ultimate.C_memset_#t~loopctr54_33| Int) (|v_#Ultimate.C_memset_#t~loopctr54_35| Int) (|v_#Ultimate.C_memset_#t~loopctr54_34| Int)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_33|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_34|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_35|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_36| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_37| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_38|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_39| |c_#Ultimate.C_memset_#ptr.offset|) 0))))) is different from true [2018-02-04 17:49:01,202 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_8 Int)) (= 1 (select |c_#valid| v_arrayElimCell_8))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_37| Int) (|v_#Ultimate.C_memset_#t~loopctr54_36| Int) (|v_#Ultimate.C_memset_#t~loopctr54_39| Int) (|#Ultimate.C_memset_#ptr.offset| Int) (|v_#Ultimate.C_memset_#t~loopctr54_38| Int) (|v_#Ultimate.C_memset_#t~loopctr54_33| Int) (|v_#Ultimate.C_memset_#t~loopctr54_35| Int) (|v_#Ultimate.C_memset_#t~loopctr54_34| Int) (|v_#Ultimate.C_memset_#t~loopctr54_40| Int)) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_33|) 0) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_34|) 0) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_35|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_36| |#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_37| |#Ultimate.C_memset_#ptr.offset|) 0) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_38|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_39| |#Ultimate.C_memset_#ptr.offset|) 0) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_40|) 0)) |c_#memory_$Pointer$.base|))) is different from true [2018-02-04 17:49:01,286 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 87 treesize of output 94 [2018-02-04 17:49:01,320 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 2 case distinctions, treesize of input 81 treesize of output 83 [2018-02-04 17:49:01,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 75 treesize of output 77 [2018-02-04 17:49:01,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-02-04 17:49:01,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2018-02-04 17:49:01,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-02-04 17:49:01,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 58 [2018-02-04 17:49:01,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 60 [2018-02-04 17:49:01,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 73 [2018-02-04 17:49:01,656 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 17:49:01,670 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:01,680 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:01,697 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:01,707 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:01,719 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:01,738 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:01,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 97 [2018-02-04 17:49:01,828 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:49:01,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 82 [2018-02-04 17:49:01,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, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 61 [2018-02-04 17:49:01,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 63 [2018-02-04 17:49:01,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 65 [2018-02-04 17:49:01,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 67 [2018-02-04 17:49:01,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 82 [2018-02-04 17:49:01,941 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-04 17:49:01,954 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:01,994 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:02,024 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:02,037 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:02,058 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:02,233 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:02,236 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 85 treesize of output 95 [2018-02-04 17:49:02,248 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:02,272 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 62 [2018-02-04 17:49:02,279 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:02,288 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 64 [2018-02-04 17:49:02,298 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:02,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 66 [2018-02-04 17:49:02,378 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:02,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 68 [2018-02-04 17:49:02,425 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:02,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 81 [2018-02-04 17:49:02,447 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-02-04 17:49:02,459 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:02,471 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:02,484 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:02,496 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:02,518 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:02,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 111 [2018-02-04 17:49:02,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 84 [2018-02-04 17:49:02,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-02-04 17:49:02,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 58 [2018-02-04 17:49:02,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 60 [2018-02-04 17:49:02,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 73 [2018-02-04 17:49:02,772 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-02-04 17:49:02,784 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:02,794 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:02,805 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:02,823 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:02,950 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:49:02,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, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 84 [2018-02-04 17:49:02,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 63 [2018-02-04 17:49:03,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 65 [2018-02-04 17:49:03,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 67 [2018-02-04 17:49:03,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 82 [2018-02-04 17:49:03,073 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-02-04 17:49:03,086 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:03,100 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:03,113 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:03,138 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:03,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 79 treesize of output 125 [2018-02-04 17:49:03,328 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:49:03,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 86 [2018-02-04 17:49:03,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 65 [2018-02-04 17:49:03,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 67 [2018-02-04 17:49:03,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 82 [2018-02-04 17:49:03,421 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-02-04 17:49:03,434 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:03,448 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:03,471 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:03,683 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:03,686 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:03,687 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:03,691 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 131 [2018-02-04 17:49:03,696 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:03,700 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:03,702 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:03,709 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 82 [2018-02-04 17:49:03,723 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:03,729 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:03,730 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:03,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 84 [2018-02-04 17:49:03,754 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:03,759 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:03,761 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:03,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 97 [2018-02-04 17:49:03,775 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-02-04 17:49:03,788 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:03,801 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:03,826 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:03,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 139 [2018-02-04 17:49:03,940 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:03,941 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:03,942 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:03,942 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:03,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 137 [2018-02-04 17:49:03,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:03,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:03,973 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:03,974 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:03,975 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:04,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 147 [2018-02-04 17:49:04,009 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:04,010 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:04,011 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:04,012 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:04,012 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:04,013 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:04,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 170 [2018-02-04 17:49:04,050 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 4 xjuncts. [2018-02-04 17:49:04,247 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:04,252 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:04,256 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:04,257 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:04,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:04,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:04,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 196 [2018-02-04 17:49:04,268 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-02-04 17:49:04,458 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:04,463 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:04,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:04,469 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:04,470 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:04,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 183 [2018-02-04 17:49:04,481 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-02-04 17:49:04,671 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:04,672 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:04,674 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:04,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:04,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:04,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 5 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 127 treesize of output 174 [2018-02-04 17:49:04,720 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 4 xjuncts. [2018-02-04 17:49:04,841 INFO L267 ElimStorePlain]: Start of recursive call 46: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 17:49:05,082 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:05,085 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:05,088 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:05,091 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:05,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 154 [2018-02-04 17:49:05,100 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:05,109 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:05,112 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:05,116 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:05,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 105 [2018-02-04 17:49:05,121 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-02-04 17:49:05,149 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:05,379 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:05,380 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:05,380 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:05,383 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:05,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 117 treesize of output 151 [2018-02-04 17:49:05,421 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:05,421 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:05,423 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:05,425 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:05,455 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:49:05,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 4 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 137 [2018-02-04 17:49:05,456 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-02-04 17:49:05,588 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:05,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:05,594 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:05,595 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:05,595 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:05,596 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:05,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 196 [2018-02-04 17:49:05,609 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-02-04 17:49:05,717 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:05,717 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:05,719 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:05,721 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:05,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 4 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 119 treesize of output 178 [2018-02-04 17:49:05,778 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 4 xjuncts. [2018-02-04 17:49:06,008 INFO L267 ElimStorePlain]: Start of recursive call 53: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 17:49:06,157 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:06,161 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:06,164 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:06,167 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:06,168 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:06,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 167 [2018-02-04 17:49:06,180 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:06,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:06,199 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:06,204 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:06,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:06,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 113 [2018-02-04 17:49:06,212 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-02-04 17:49:06,246 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:06,422 INFO L267 ElimStorePlain]: Start of recursive call 45: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-04 17:49:06,703 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:06,706 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:06,708 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:06,710 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:06,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 149 [2018-02-04 17:49:06,724 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:06,732 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:06,738 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:06,748 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:06,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 92 [2018-02-04 17:49:06,761 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:06,769 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:06,780 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:06,787 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:06,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 105 [2018-02-04 17:49:06,791 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-02-04 17:49:06,804 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:06,832 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:07,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 88 [2018-02-04 17:49:07,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 60 [2018-02-04 17:49:07,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 73 [2018-02-04 17:49:07,109 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-02-04 17:49:07,117 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:07,136 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:07,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 83 treesize of output 153 [2018-02-04 17:49:07,375 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-02-04 17:49:07,378 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:07,379 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:07,380 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:07,381 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:07,382 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:07,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 147 [2018-02-04 17:49:07,420 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:07,421 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:07,422 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:07,423 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:07,423 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:07,424 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:07,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 170 [2018-02-04 17:49:07,460 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 4 xjuncts. [2018-02-04 17:49:07,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:07,665 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:07,670 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:07,671 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:07,672 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:07,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 183 [2018-02-04 17:49:07,681 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-02-04 17:49:07,867 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:07,867 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:07,868 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:07,870 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:07,870 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:07,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 5 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 127 treesize of output 174 [2018-02-04 17:49:07,908 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 4 xjuncts. [2018-02-04 17:49:08,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:08,035 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:08,035 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:08,036 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:08,036 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:08,037 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:08,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 196 [2018-02-04 17:49:08,050 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-02-04 17:49:08,162 INFO L267 ElimStorePlain]: Start of recursive call 66: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 17:49:08,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 90 [2018-02-04 17:49:08,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 73 [2018-02-04 17:49:08,403 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-02-04 17:49:08,420 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:08,615 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:08,619 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:08,622 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:08,625 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:08,625 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:08,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 167 [2018-02-04 17:49:08,635 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:08,642 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:08,645 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:08,649 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:08,649 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:08,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 113 [2018-02-04 17:49:08,654 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-02-04 17:49:08,685 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:08,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 85 treesize of output 167 [2018-02-04 17:49:08,910 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-02-04 17:49:08,914 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:08,915 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:08,916 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:08,916 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:08,917 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:08,918 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:08,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 170 [2018-02-04 17:49:08,954 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 4 xjuncts. [2018-02-04 17:49:09,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 87 treesize of output 194 [2018-02-04 17:49:09,215 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-02-04 17:49:09,215 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 4 xjuncts. [2018-02-04 17:49:09,351 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:09,356 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:09,361 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:09,361 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:09,362 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:09,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:09,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 196 [2018-02-04 17:49:09,372 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-02-04 17:49:09,566 INFO L267 ElimStorePlain]: Start of recursive call 75: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 17:49:09,697 INFO L267 ElimStorePlain]: Start of recursive call 65: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-04 17:49:09,853 INFO L267 ElimStorePlain]: Start of recursive call 44: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-02-04 17:49:10,003 INFO L267 ElimStorePlain]: Start of recursive call 35: 4 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-02-04 17:49:10,184 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:10,186 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:10,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 113 [2018-02-04 17:49:10,192 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:10,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:10,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 72 [2018-02-04 17:49:10,202 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:10,207 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:10,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 74 [2018-02-04 17:49:10,219 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:10,227 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:10,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 76 [2018-02-04 17:49:10,240 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:10,250 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:10,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 89 [2018-02-04 17:49:10,256 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-02-04 17:49:10,268 INFO L267 ElimStorePlain]: Start of recursive call 82: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:10,278 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:10,302 INFO L267 ElimStorePlain]: Start of recursive call 80: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:10,322 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:10,472 INFO L267 ElimStorePlain]: Start of recursive call 24: 4 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-02-04 17:49:10,636 INFO L267 ElimStorePlain]: Start of recursive call 11: 4 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-02-04 17:49:10,804 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-02-04 17:49:11,121 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 80 [2018-02-04 17:49:11,123 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 54 treesize of output 56 [2018-02-04 17:49:11,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 58 [2018-02-04 17:49:11,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 60 [2018-02-04 17:49:11,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 62 [2018-02-04 17:49:11,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 64 [2018-02-04 17:49:11,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 66 [2018-02-04 17:49:11,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 121 [2018-02-04 17:49:11,259 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-02-04 17:49:11,269 INFO L267 ElimStorePlain]: Start of recursive call 90: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:11,279 INFO L267 ElimStorePlain]: Start of recursive call 89: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:11,290 INFO L267 ElimStorePlain]: Start of recursive call 88: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:11,300 INFO L267 ElimStorePlain]: Start of recursive call 87: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:11,311 INFO L267 ElimStorePlain]: Start of recursive call 86: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:11,322 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:11,338 INFO L267 ElimStorePlain]: Start of recursive call 84: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:11,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-02-04 17:49:12,268 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 87 treesize of output 81 [2018-02-04 17:49:12,271 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-02-04 17:49:12,273 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 54 treesize of output 56 [2018-02-04 17:49:12,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 58 [2018-02-04 17:49:12,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 60 [2018-02-04 17:49:12,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 62 [2018-02-04 17:49:12,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 64 [2018-02-04 17:49:12,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 66 [2018-02-04 17:49:12,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 121 [2018-02-04 17:49:12,358 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2018-02-04 17:49:12,367 INFO L267 ElimStorePlain]: Start of recursive call 99: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:12,375 INFO L267 ElimStorePlain]: Start of recursive call 98: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:12,384 INFO L267 ElimStorePlain]: Start of recursive call 97: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:12,392 INFO L267 ElimStorePlain]: Start of recursive call 96: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:12,401 INFO L267 ElimStorePlain]: Start of recursive call 95: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:12,415 INFO L267 ElimStorePlain]: Start of recursive call 94: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:12,426 INFO L267 ElimStorePlain]: Start of recursive call 93: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:12,441 INFO L267 ElimStorePlain]: Start of recursive call 92: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:49:12,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 2 dim-2 vars, End of recursive call: 101 dim-0 vars, and 10 xjuncts. [2018-02-04 17:49:12,642 INFO L202 ElimStorePlain]: Needed 100 recursive calls to eliminate 22 variables, input treesize:175, output treesize:1179 [2018-02-04 17:49:21,478 WARN L146 SmtUtils]: Spent 8767ms on a formula simplification. DAG size of input: 449 DAG size of output 106 [2018-02-04 17:49:21,508 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 160 treesize of output 115 [2018-02-04 17:49:21,513 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:21,514 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 147 treesize of output 161 [2018-02-04 17:49:21,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:49:21,608 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:21,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 24 case distinctions, treesize of input 98 treesize of output 160 [2018-02-04 17:49:21,702 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-02-04 17:49:21,753 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 256 xjuncts. [2018-02-04 17:49:40,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 256 xjuncts. [2018-02-04 17:49:52,126 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 43 treesize of output 38 [2018-02-04 17:49:52,128 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:49:52,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-04 17:49:52,129 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 17:49:52,135 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:02,575 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 160 treesize of output 112 [2018-02-04 17:50:02,578 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:50:02,579 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 134 treesize of output 148 [2018-02-04 17:50:02,579 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 17:50:02,592 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:12,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 3 dim-2 vars, End of recursive call: 1545 dim-0 vars, and 258 xjuncts. [2018-02-04 17:50:12,066 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 23 variables, input treesize:364, output treesize:21049 [2018-02-04 17:50:32,356 WARN L146 SmtUtils]: Spent 17306ms on a formula simplification. DAG size of input: 6958 DAG size of output 72 [2018-02-04 17:50:32,362 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 53 treesize of output 46 [2018-02-04 17:50:32,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:50:32,365 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 33 treesize of output 29 [2018-02-04 17:50:32,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:50:32,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:32,405 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 47 treesize of output 42 [2018-02-04 17:50:32,407 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:50:32,408 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 24 treesize of output 18 [2018-02-04 17:50:32,409 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:50:32,413 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:32,447 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 164 treesize of output 116 [2018-02-04 17:50:32,450 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:50:32,451 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 138 treesize of output 150 [2018-02-04 17:50:32,452 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 17:50:32,467 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:32,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-2 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2018-02-04 17:50:32,490 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 14 variables, input treesize:265, output treesize:208 [2018-02-04 17:50:32,617 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 151 treesize of output 81 [2018-02-04 17:50:32,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 1 [2018-02-04 17:50:32,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:50:32,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-02-04 17:50:32,640 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:50:32,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:32,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:32,644 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:154, output treesize:5 [2018-02-04 17:50:32,666 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 36 not checked. [2018-02-04 17:50:32,667 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:50:32,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 17:50:32,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 17:50:32,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 17:50:32,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=139, Unknown=9, NotChecked=232, Total=420 [2018-02-04 17:50:32,667 INFO L87 Difference]: Start difference. First operand 222 states and 270 transitions. Second operand 21 states. [2018-02-04 17:50:33,085 WARN L143 SmtUtils]: Spent 130ms on a formula simplification that was a NOOP. DAG size: 119 [2018-02-04 17:50:38,525 WARN L143 SmtUtils]: Spent 169ms on a formula simplification that was a NOOP. DAG size: 127 [2018-02-04 17:50:39,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:50:39,244 INFO L93 Difference]: Finished difference Result 254 states and 314 transitions. [2018-02-04 17:50:39,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 17:50:39,244 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2018-02-04 17:50:39,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:50:39,246 INFO L225 Difference]: With dead ends: 254 [2018-02-04 17:50:39,246 INFO L226 Difference]: Without dead ends: 254 [2018-02-04 17:50:39,246 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 30.8s TimeCoverageRelationStatistics Valid=82, Invalid=321, Unknown=9, NotChecked=344, Total=756 [2018-02-04 17:50:39,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-02-04 17:50:39,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 234. [2018-02-04 17:50:39,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-02-04 17:50:39,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 289 transitions. [2018-02-04 17:50:39,253 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 289 transitions. Word has length 41 [2018-02-04 17:50:39,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:50:39,253 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 289 transitions. [2018-02-04 17:50:39,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 17:50:39,253 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 289 transitions. [2018-02-04 17:50:39,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 17:50:39,254 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:50:39,254 INFO L351 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:50:39,254 INFO L371 AbstractCegarLoop]: === Iteration 19 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:50:39,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1354288045, now seen corresponding path program 1 times [2018-02-04 17:50:39,254 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:50:39,254 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:50:39,255 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:50:39,255 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:50:39,255 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:50:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:50:39,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:50:39,279 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:50:39,279 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:50:39,279 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:50:39,280 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:50:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:50:39,311 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:50:39,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 17:50:39,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 17:50:39,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:50:39,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:39,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:39,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-02-04 17:50:39,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 10 treesize of output 9 [2018-02-04 17:50:39,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:50:39,346 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:50:39,347 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:50:39,348 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-02-04 17:50:39,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:50:39,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:39,356 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:36 [2018-02-04 17:50:39,371 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 11 treesize of output 4 [2018-02-04 17:50:39,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:50:39,384 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 23 treesize of output 18 [2018-02-04 17:50:39,387 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 18 treesize of output 9 [2018-02-04 17:50:39,388 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:50:39,389 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:39,399 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 13 treesize of output 10 [2018-02-04 17:50:39,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 17:50:39,401 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 17:50:39,403 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:39,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:39,410 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:62, output treesize:29 [2018-02-04 17:50:39,436 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 26 treesize of output 22 [2018-02-04 17:50:39,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-02-04 17:50:39,438 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:50:39,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:50:39,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:50:39,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:16 [2018-02-04 17:50:47,310 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 276 treesize of output 270 [2018-02-04 17:50:47,318 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 100 [2018-02-04 17:50:47,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 102 [2018-02-04 17:50:47,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 104 [2018-02-04 17:50:47,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 106 [2018-02-04 17:50:47,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 108 [2018-02-04 17:50:47,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 110 [2018-02-04 17:50:47,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 112 [2018-02-04 17:50:47,733 INFO L303 Elim1Store]: Index analysis took 139 ms [2018-02-04 17:50:47,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 167 [2018-02-04 17:50:47,734 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 17:50:47,784 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:47,826 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:47,874 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:47,917 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:47,957 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:48,001 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:48,049 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:48,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:48,209 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 320 treesize of output 321 [2018-02-04 17:50:48,212 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 116 [2018-02-04 17:50:48,215 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 116 treesize of output 118 [2018-02-04 17:50:48,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 120 [2018-02-04 17:50:48,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 122 [2018-02-04 17:50:48,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 124 [2018-02-04 17:50:48,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 126 [2018-02-04 17:50:48,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 128 [2018-02-04 17:50:48,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 183 [2018-02-04 17:50:48,316 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-04 17:50:48,331 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:48,345 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:48,360 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:48,375 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:48,390 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:48,405 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:48,420 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:48,456 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:48,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2018-02-04 17:50:48,502 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 13 variables, input treesize:297, output treesize:417 [2018-02-04 17:50:48,661 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 411 treesize of output 345 [2018-02-04 17:50:48,665 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:50:48,666 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 370 treesize of output 402 [2018-02-04 17:50:48,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:50:48,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:48,766 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 395 treesize of output 366 [2018-02-04 17:50:48,769 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:50:48,771 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 356 treesize of output 386 [2018-02-04 17:50:48,771 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:50:48,811 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:48,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2018-02-04 17:50:48,854 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:438, output treesize:408 [2018-02-04 17:50:48,864 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 399 treesize of output 370 [2018-02-04 17:50:48,867 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:50:48,869 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 360 treesize of output 388 [2018-02-04 17:50:48,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:50:48,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:48,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 415 treesize of output 349 [2018-02-04 17:50:48,966 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:50:48,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 374 treesize of output 404 [2018-02-04 17:50:48,968 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:50:49,006 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:49,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2018-02-04 17:50:49,048 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:446, output treesize:408 [2018-02-04 17:50:49,368 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 405 treesize of output 317 [2018-02-04 17:50:49,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 1 [2018-02-04 17:50:49,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:50:49,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 164 [2018-02-04 17:50:49,417 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:50:49,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:49,461 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 169 treesize of output 135 [2018-02-04 17:50:49,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 1 [2018-02-04 17:50:49,491 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 17:50:49,496 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 14 [2018-02-04 17:50:49,496 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 17:50:49,498 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:50:49,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:50:49,503 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 13 variables, input treesize:426, output treesize:26 [2018-02-04 17:50:49,563 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 21 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:50:49,564 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:50:49,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 17:50:49,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 17:50:49,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 17:50:49,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=391, Unknown=63, NotChecked=0, Total=506 [2018-02-04 17:50:49,564 INFO L87 Difference]: Start difference. First operand 234 states and 289 transitions. Second operand 23 states. [2018-02-04 17:51:06,228 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 145 DAG size of output 140 [2018-02-04 17:51:14,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:51:14,851 INFO L93 Difference]: Finished difference Result 266 states and 326 transitions. [2018-02-04 17:51:14,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 17:51:14,851 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 41 [2018-02-04 17:51:14,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:51:14,853 INFO L225 Difference]: With dead ends: 266 [2018-02-04 17:51:14,853 INFO L226 Difference]: Without dead ends: 266 [2018-02-04 17:51:14,853 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=82, Invalid=609, Unknown=65, NotChecked=0, Total=756 [2018-02-04 17:51:14,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-02-04 17:51:14,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 234. [2018-02-04 17:51:14,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-02-04 17:51:14,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 288 transitions. [2018-02-04 17:51:14,861 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 288 transitions. Word has length 41 [2018-02-04 17:51:14,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:51:14,862 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 288 transitions. [2018-02-04 17:51:14,862 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 17:51:14,862 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 288 transitions. [2018-02-04 17:51:14,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 17:51:14,862 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:51:14,862 INFO L351 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:51:14,862 INFO L371 AbstractCegarLoop]: === Iteration 20 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:51:14,862 INFO L82 PathProgramCache]: Analyzing trace with hash -628539618, now seen corresponding path program 9 times [2018-02-04 17:51:14,862 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:51:14,862 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:51:14,863 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:51:14,863 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:51:14,863 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:51:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:51:14,870 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:51:14,951 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:51:14,951 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:51:14,951 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:51:14,951 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:51:14,967 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-02-04 17:51:14,967 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:51:14,968 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:51:15,133 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:51:15,133 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:51:15,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 18 [2018-02-04 17:51:15,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:51:15,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:51:15,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:51:15,134 INFO L87 Difference]: Start difference. First operand 234 states and 288 transitions. Second operand 18 states. [2018-02-04 17:51:15,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:51:15,627 INFO L93 Difference]: Finished difference Result 263 states and 324 transitions. [2018-02-04 17:51:15,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 17:51:15,627 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 42 [2018-02-04 17:51:15,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:51:15,628 INFO L225 Difference]: With dead ends: 263 [2018-02-04 17:51:15,629 INFO L226 Difference]: Without dead ends: 261 [2018-02-04 17:51:15,629 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:51:15,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-02-04 17:51:15,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 236. [2018-02-04 17:51:15,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-02-04 17:51:15,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 285 transitions. [2018-02-04 17:51:15,635 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 285 transitions. Word has length 42 [2018-02-04 17:51:15,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:51:15,635 INFO L432 AbstractCegarLoop]: Abstraction has 236 states and 285 transitions. [2018-02-04 17:51:15,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:51:15,635 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 285 transitions. [2018-02-04 17:51:15,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-04 17:51:15,636 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:51:15,636 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 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, 1, 1, 1, 1, 1] [2018-02-04 17:51:15,636 INFO L371 AbstractCegarLoop]: === Iteration 21 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:51:15,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1158116567, now seen corresponding path program 1 times [2018-02-04 17:51:15,636 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:51:15,636 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:51:15,637 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:51:15,637 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:51:15,637 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:51:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:51:15,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:51:15,699 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-02-04 17:51:15,699 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:51:15,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:51:15,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:51:15,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:51:15,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:51:15,700 INFO L87 Difference]: Start difference. First operand 236 states and 285 transitions. Second operand 6 states. [2018-02-04 17:51:15,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:51:15,883 INFO L93 Difference]: Finished difference Result 234 states and 283 transitions. [2018-02-04 17:51:15,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:51:15,883 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-02-04 17:51:15,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:51:15,885 INFO L225 Difference]: With dead ends: 234 [2018-02-04 17:51:15,885 INFO L226 Difference]: Without dead ends: 234 [2018-02-04 17:51:15,885 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:51:15,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-02-04 17:51:15,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-02-04 17:51:15,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-02-04 17:51:15,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 283 transitions. [2018-02-04 17:51:15,890 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 283 transitions. Word has length 74 [2018-02-04 17:51:15,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:51:15,890 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 283 transitions. [2018-02-04 17:51:15,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:51:15,890 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 283 transitions. [2018-02-04 17:51:15,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-04 17:51:15,891 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:51:15,891 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 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, 1, 1, 1, 1, 1] [2018-02-04 17:51:15,891 INFO L371 AbstractCegarLoop]: === Iteration 22 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:51:15,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1158116568, now seen corresponding path program 1 times [2018-02-04 17:51:15,891 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:51:15,891 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:51:15,892 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:51:15,892 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:51:15,892 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:51:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:51:15,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:51:16,003 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-02-04 17:51:16,003 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:51:16,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:51:16,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:51:16,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:51:16,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:51:16,004 INFO L87 Difference]: Start difference. First operand 234 states and 283 transitions. Second operand 8 states. [2018-02-04 17:51:16,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:51:16,157 INFO L93 Difference]: Finished difference Result 232 states and 281 transitions. [2018-02-04 17:51:16,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:51:16,157 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 74 [2018-02-04 17:51:16,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:51:16,158 INFO L225 Difference]: With dead ends: 232 [2018-02-04 17:51:16,158 INFO L226 Difference]: Without dead ends: 232 [2018-02-04 17:51:16,158 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:51:16,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-04 17:51:16,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2018-02-04 17:51:16,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-02-04 17:51:16,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 281 transitions. [2018-02-04 17:51:16,162 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 281 transitions. Word has length 74 [2018-02-04 17:51:16,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:51:16,163 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 281 transitions. [2018-02-04 17:51:16,163 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:51:16,163 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 281 transitions. [2018-02-04 17:51:16,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-04 17:51:16,163 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:51:16,164 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 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, 1, 1, 1, 1, 1, 1] [2018-02-04 17:51:16,164 INFO L371 AbstractCegarLoop]: === Iteration 23 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:51:16,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1541875248, now seen corresponding path program 1 times [2018-02-04 17:51:16,164 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:51:16,164 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:51:16,165 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:51:16,165 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:51:16,165 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:51:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:51:16,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:51:16,290 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 36 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-04 17:51:16,290 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:51:16,290 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:51:16,290 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:51:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:51:16,307 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:51:16,319 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 36 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-04 17:51:16,319 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:51:16,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-02-04 17:51:16,320 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 17:51:16,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 17:51:16,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:51:16,320 INFO L87 Difference]: Start difference. First operand 232 states and 281 transitions. Second operand 15 states. [2018-02-04 17:51:16,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:51:16,509 INFO L93 Difference]: Finished difference Result 267 states and 329 transitions. [2018-02-04 17:51:16,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 17:51:16,509 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 75 [2018-02-04 17:51:16,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:51:16,510 INFO L225 Difference]: With dead ends: 267 [2018-02-04 17:51:16,510 INFO L226 Difference]: Without dead ends: 259 [2018-02-04 17:51:16,510 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2018-02-04 17:51:16,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-02-04 17:51:16,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 230. [2018-02-04 17:51:16,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-04 17:51:16,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 278 transitions. [2018-02-04 17:51:16,516 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 278 transitions. Word has length 75 [2018-02-04 17:51:16,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:51:16,516 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 278 transitions. [2018-02-04 17:51:16,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 17:51:16,516 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 278 transitions. [2018-02-04 17:51:16,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-04 17:51:16,516 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:51:16,516 INFO L351 BasicCegarLoop]: trace histogram [17, 2, 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, 1, 1, 1, 1, 1, 1] [2018-02-04 17:51:16,516 INFO L371 AbstractCegarLoop]: === Iteration 24 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:51:16,516 INFO L82 PathProgramCache]: Analyzing trace with hash 889551470, now seen corresponding path program 2 times [2018-02-04 17:51:16,517 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:51:16,517 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:51:16,517 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:51:16,517 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:51:16,517 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:51:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:51:16,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:51:16,611 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 106 proven. 45 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-04 17:51:16,611 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:51:16,611 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:51:16,612 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:51:16,635 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:51:16,635 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:51:16,639 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:51:16,694 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 106 proven. 45 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-04 17:51:16,694 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:51:16,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-02-04 17:51:16,695 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 17:51:16,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 17:51:16,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:51:16,695 INFO L87 Difference]: Start difference. First operand 230 states and 278 transitions. Second operand 16 states. [2018-02-04 17:51:16,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:51:16,916 INFO L93 Difference]: Finished difference Result 268 states and 332 transitions. [2018-02-04 17:51:16,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 17:51:16,917 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 76 [2018-02-04 17:51:16,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:51:16,918 INFO L225 Difference]: With dead ends: 268 [2018-02-04 17:51:16,918 INFO L226 Difference]: Without dead ends: 262 [2018-02-04 17:51:16,918 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2018-02-04 17:51:16,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-02-04 17:51:16,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 231. [2018-02-04 17:51:16,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-04 17:51:16,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 280 transitions. [2018-02-04 17:51:16,924 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 280 transitions. Word has length 76 [2018-02-04 17:51:16,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:51:16,924 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 280 transitions. [2018-02-04 17:51:16,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 17:51:16,924 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 280 transitions. [2018-02-04 17:51:16,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 17:51:16,925 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:51:16,925 INFO L351 BasicCegarLoop]: trace histogram [18, 2, 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, 1, 1, 1, 1, 1, 1] [2018-02-04 17:51:16,925 INFO L371 AbstractCegarLoop]: === Iteration 25 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:51:16,926 INFO L82 PathProgramCache]: Analyzing trace with hash 2142350832, now seen corresponding path program 3 times [2018-02-04 17:51:16,926 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:51:16,926 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:51:16,926 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:51:16,927 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:51:16,927 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:51:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:51:16,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:51:17,073 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 115 proven. 55 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-04 17:51:17,074 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:51:17,074 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:51:17,074 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:51:17,135 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-02-04 17:51:17,135 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:51:17,142 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:51:17,219 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 115 proven. 55 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-04 17:51:17,219 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:51:17,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-02-04 17:51:17,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:51:17,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:51:17,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:51:17,220 INFO L87 Difference]: Start difference. First operand 231 states and 280 transitions. Second operand 17 states. [2018-02-04 17:51:17,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:51:17,471 INFO L93 Difference]: Finished difference Result 271 states and 337 transitions. [2018-02-04 17:51:17,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 17:51:17,472 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 77 [2018-02-04 17:51:17,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:51:17,472 INFO L225 Difference]: With dead ends: 271 [2018-02-04 17:51:17,472 INFO L226 Difference]: Without dead ends: 265 [2018-02-04 17:51:17,473 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=256, Invalid=556, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:51:17,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-02-04 17:51:17,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 232. [2018-02-04 17:51:17,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-02-04 17:51:17,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 282 transitions. [2018-02-04 17:51:17,476 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 282 transitions. Word has length 77 [2018-02-04 17:51:17,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:51:17,476 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 282 transitions. [2018-02-04 17:51:17,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:51:17,476 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 282 transitions. [2018-02-04 17:51:17,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-04 17:51:17,477 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:51:17,477 INFO L351 BasicCegarLoop]: trace histogram [19, 2, 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, 1, 1, 1, 1, 1, 1] [2018-02-04 17:51:17,477 INFO L371 AbstractCegarLoop]: === Iteration 26 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:51:17,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1970541906, now seen corresponding path program 4 times [2018-02-04 17:51:17,477 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:51:17,477 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:51:17,478 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:51:17,478 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:51:17,478 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:51:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:51:17,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:51:17,590 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 124 proven. 66 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-04 17:51:17,591 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:51:17,591 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:51:17,591 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:51:17,608 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:51:17,608 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:51:17,611 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:51:17,662 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 124 proven. 66 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-04 17:51:17,662 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:51:17,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-02-04 17:51:17,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:51:17,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:51:17,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:51:17,663 INFO L87 Difference]: Start difference. First operand 232 states and 282 transitions. Second operand 18 states. [2018-02-04 17:51:17,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:51:17,881 INFO L93 Difference]: Finished difference Result 274 states and 342 transitions. [2018-02-04 17:51:17,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 17:51:17,881 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2018-02-04 17:51:17,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:51:17,882 INFO L225 Difference]: With dead ends: 274 [2018-02-04 17:51:17,882 INFO L226 Difference]: Without dead ends: 268 [2018-02-04 17:51:17,883 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=296, Invalid=634, Unknown=0, NotChecked=0, Total=930 [2018-02-04 17:51:17,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-02-04 17:51:17,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 233. [2018-02-04 17:51:17,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-02-04 17:51:17,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 284 transitions. [2018-02-04 17:51:17,886 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 284 transitions. Word has length 78 [2018-02-04 17:51:17,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:51:17,886 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 284 transitions. [2018-02-04 17:51:17,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:51:17,887 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 284 transitions. [2018-02-04 17:51:17,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-04 17:51:17,887 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:51:17,887 INFO L351 BasicCegarLoop]: trace histogram [20, 2, 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, 1, 1, 1, 1, 1, 1] [2018-02-04 17:51:17,887 INFO L371 AbstractCegarLoop]: === Iteration 27 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:51:17,887 INFO L82 PathProgramCache]: Analyzing trace with hash -621197904, now seen corresponding path program 5 times [2018-02-04 17:51:17,887 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:51:17,887 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:51:17,888 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:51:17,888 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:51:17,888 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:51:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:51:17,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:51:17,930 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:51:17,930 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:51:17,930 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:51:17,931 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:51:18,096 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-02-04 17:51:18,097 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:51:18,104 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:51:18,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:51:18,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:18,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:18,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:51:18,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 17:51:18,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 17:51:18,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:18,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:18,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:18,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-02-04 17:51:18,162 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:51:18,164 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 19 [2018-02-04 17:51:18,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:18,177 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:51:18,178 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:51:18,178 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-02-04 17:51:18,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:18,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:51:18,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-02-04 17:51:18,212 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 13 treesize of output 10 [2018-02-04 17:51:18,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 17:51:18,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:18,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:18,223 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:51:18,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-02-04 17:51:18,226 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 18 treesize of output 9 [2018-02-04 17:51:18,226 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:18,227 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:18,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:51:18,233 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2018-02-04 17:51:18,259 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-02-04 17:51:18,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 17:51:18,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:18,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:18,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:51:18,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:43 [2018-02-04 17:51:18,301 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 26 treesize of output 22 [2018-02-04 17:51:18,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-02-04 17:51:18,303 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:51:18,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:51:18,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 17:51:18,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:22 [2018-02-04 17:51:19,702 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 93 treesize of output 87 [2018-02-04 17:51:19,704 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2018-02-04 17:51:19,723 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-02-04 17:51:19,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2018-02-04 17:51:19,727 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-02-04 17:51:19,730 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 58 [2018-02-04 17:51:19,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 60 [2018-02-04 17:51:19,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 62 [2018-02-04 17:51:19,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 64 [2018-02-04 17:51:19,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 66 [2018-02-04 17:51:19,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 68 [2018-02-04 17:51:19,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 70 [2018-02-04 17:51:19,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 36 disjoint index pairs (out of 55 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 157 [2018-02-04 17:51:19,794 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:19,821 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:19,839 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:19,856 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:19,873 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:19,890 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:19,907 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:19,924 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:19,941 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:19,959 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:19,977 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:19,995 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:20,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:20,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-02-04 17:51:20,054 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 8 variables, input treesize:116, output treesize:216 [2018-02-04 17:51:20,205 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 169 treesize of output 113 [2018-02-04 17:51:20,207 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:51:20,208 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 142 treesize of output 160 [2018-02-04 17:51:20,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:20,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:20,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:51:20,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:177, output treesize:162 [2018-02-04 17:51:20,329 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 173 treesize of output 117 [2018-02-04 17:51:20,331 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:51:20,333 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 146 treesize of output 162 [2018-02-04 17:51:20,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:20,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:20,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:51:20,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:181, output treesize:162 [2018-02-04 17:51:20,637 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 28 treesize of output 14 [2018-02-04 17:51:20,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:20,659 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 148 treesize of output 77 [2018-02-04 17:51:20,661 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:51:20,662 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 25 treesize of output 17 [2018-02-04 17:51:20,662 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:20,672 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:20,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:20,676 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:181, output treesize:5 [2018-02-04 17:51:20,744 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 121 proven. 88 refuted. 3 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-04 17:51:20,745 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:51:20,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 17:51:20,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 17:51:20,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 17:51:20,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=944, Unknown=38, NotChecked=0, Total=1056 [2018-02-04 17:51:20,745 INFO L87 Difference]: Start difference. First operand 233 states and 284 transitions. Second operand 33 states. [2018-02-04 17:51:29,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:51:29,304 INFO L93 Difference]: Finished difference Result 278 states and 337 transitions. [2018-02-04 17:51:29,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 17:51:29,304 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 79 [2018-02-04 17:51:29,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:51:29,305 INFO L225 Difference]: With dead ends: 278 [2018-02-04 17:51:29,305 INFO L226 Difference]: Without dead ends: 278 [2018-02-04 17:51:29,306 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=194, Invalid=1930, Unknown=38, NotChecked=0, Total=2162 [2018-02-04 17:51:29,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-02-04 17:51:29,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 245. [2018-02-04 17:51:29,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-02-04 17:51:29,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 299 transitions. [2018-02-04 17:51:29,309 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 299 transitions. Word has length 79 [2018-02-04 17:51:29,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:51:29,309 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 299 transitions. [2018-02-04 17:51:29,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 17:51:29,309 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 299 transitions. [2018-02-04 17:51:29,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-04 17:51:29,309 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:51:29,309 INFO L351 BasicCegarLoop]: trace histogram [20, 2, 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, 1, 1, 1, 1, 1, 1] [2018-02-04 17:51:29,309 INFO L371 AbstractCegarLoop]: === Iteration 28 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:51:29,309 INFO L82 PathProgramCache]: Analyzing trace with hash -621197903, now seen corresponding path program 1 times [2018-02-04 17:51:29,310 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:51:29,310 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:51:29,310 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:51:29,310 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:51:29,310 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:51:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:51:29,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:51:29,352 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:51:29,352 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:51:29,352 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:51:29,353 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:51:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:51:29,470 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:51:29,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 10 treesize of output 9 [2018-02-04 17:51:29,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:29,522 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:51:29,523 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:51:29,523 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-02-04 17:51:29,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:29,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:29,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:30 [2018-02-04 17:51:29,549 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 11 treesize of output 4 [2018-02-04 17:51:29,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:29,561 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 13 treesize of output 10 [2018-02-04 17:51:29,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 17:51:29,563 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:29,565 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:29,577 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 13 treesize of output 10 [2018-02-04 17:51:29,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 17:51:29,579 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:29,581 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:29,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:29,589 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:53, output treesize:38 [2018-02-04 17:51:29,626 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 18 [2018-02-04 17:51:29,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-02-04 17:51:29,628 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:51:29,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:51:29,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-02-04 17:51:29,643 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:29,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:51:29,649 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:16 [2018-02-04 17:51:29,690 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_108| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_108|))) (and (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 (mod |c_#Ultimate.C_memset_#value| 256))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0)))))) (exists ((|v_DUPFFnew_#in~maxdeg_BEFORE_CALL_15| Int) (v_arrayElimCell_54 Int)) (= (select |c_#length| v_arrayElimCell_54) (+ (* 4 |v_DUPFFnew_#in~maxdeg_BEFORE_CALL_15|) 4)))) is different from true [2018-02-04 17:51:29,707 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_DUPFFnew_#in~maxdeg_BEFORE_CALL_15| Int) (v_arrayElimCell_54 Int)) (= (select |c_#length| v_arrayElimCell_54) (+ (* 4 |v_DUPFFnew_#in~maxdeg_BEFORE_CALL_15|) 4))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_108| Int) (|v_#Ultimate.C_memset_#t~loopctr54_109| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_108|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_109|))) (and (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse1 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse1) .cse2 .cse1))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse2 0))))))) is different from true [2018-02-04 17:51:29,736 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_110| Int) (|v_#Ultimate.C_memset_#t~loopctr54_108| Int) (|v_#Ultimate.C_memset_#t~loopctr54_109| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_108|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_109|)) (.cse3 (+ |v_#Ultimate.C_memset_#t~loopctr54_110| |c_#Ultimate.C_memset_#ptr.offset|))) (and (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse1 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse1) .cse2 .cse1) .cse3 .cse1))) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse2 0) .cse3 0)) |c_#memory_$Pointer$.base|)))) (exists ((|v_DUPFFnew_#in~maxdeg_BEFORE_CALL_15| Int) (v_arrayElimCell_54 Int)) (= (select |c_#length| v_arrayElimCell_54) (+ (* 4 |v_DUPFFnew_#in~maxdeg_BEFORE_CALL_15|) 4)))) is different from true [2018-02-04 17:51:29,771 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_DUPFFnew_#in~maxdeg_BEFORE_CALL_15| Int) (v_arrayElimCell_54 Int)) (= (select |c_#length| v_arrayElimCell_54) (+ (* 4 |v_DUPFFnew_#in~maxdeg_BEFORE_CALL_15|) 4))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_110| Int) (|v_#Ultimate.C_memset_#t~loopctr54_111| Int) (|v_#Ultimate.C_memset_#t~loopctr54_108| Int) (|v_#Ultimate.C_memset_#t~loopctr54_109| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_108|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_109|)) (.cse3 (+ |v_#Ultimate.C_memset_#t~loopctr54_110| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse4 (+ |v_#Ultimate.C_memset_#t~loopctr54_111| |c_#Ultimate.C_memset_#ptr.offset|))) (and (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse1 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse1) .cse2 .cse1) .cse3 .cse1) .cse4 .cse1))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse2 0) .cse3 0) .cse4 0))))))) is different from true [2018-02-04 17:51:29,814 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_110| Int) (|v_#Ultimate.C_memset_#t~loopctr54_111| Int) (|v_#Ultimate.C_memset_#t~loopctr54_112| Int) (|v_#Ultimate.C_memset_#t~loopctr54_108| Int) (|v_#Ultimate.C_memset_#t~loopctr54_109| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_108|)) (.cse1 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_109|)) (.cse2 (+ |v_#Ultimate.C_memset_#t~loopctr54_110| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse3 (+ |v_#Ultimate.C_memset_#t~loopctr54_111| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse4 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_112|))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse1 0) .cse2 0) .cse3 0) .cse4 0))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse5 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse5) .cse1 .cse5) .cse2 .cse5) .cse3 .cse5) .cse4 .cse5))))))) (exists ((|v_DUPFFnew_#in~maxdeg_BEFORE_CALL_15| Int) (v_arrayElimCell_54 Int)) (= (select |c_#length| v_arrayElimCell_54) (+ (* 4 |v_DUPFFnew_#in~maxdeg_BEFORE_CALL_15|) 4)))) is different from true [2018-02-04 17:51:29,848 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_110| Int) (|v_#Ultimate.C_memset_#t~loopctr54_113| Int) (|v_#Ultimate.C_memset_#t~loopctr54_111| Int) (|v_#Ultimate.C_memset_#t~loopctr54_112| Int) (|v_#Ultimate.C_memset_#t~loopctr54_108| Int) (|v_#Ultimate.C_memset_#t~loopctr54_109| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_108|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_109|)) (.cse3 (+ |v_#Ultimate.C_memset_#t~loopctr54_110| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse4 (+ |v_#Ultimate.C_memset_#t~loopctr54_111| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse5 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_112|)) (.cse6 (+ |v_#Ultimate.C_memset_#t~loopctr54_113| |c_#Ultimate.C_memset_#ptr.offset|))) (and (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse1 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse1) .cse2 .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1) .cse6 .cse1))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0) .cse6 0)))))) (exists ((|v_DUPFFnew_#in~maxdeg_BEFORE_CALL_15| Int) (v_arrayElimCell_54 Int)) (= (select |c_#length| v_arrayElimCell_54) (+ (* 4 |v_DUPFFnew_#in~maxdeg_BEFORE_CALL_15|) 4)))) is different from true [2018-02-04 17:51:29,888 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_110| Int) (|v_#Ultimate.C_memset_#t~loopctr54_113| Int) (|v_#Ultimate.C_memset_#t~loopctr54_114| Int) (|v_#Ultimate.C_memset_#t~loopctr54_111| Int) (|v_#Ultimate.C_memset_#t~loopctr54_112| Int) (|v_#Ultimate.C_memset_#t~loopctr54_108| Int) (|v_#Ultimate.C_memset_#t~loopctr54_109| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_108|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_109|)) (.cse3 (+ |v_#Ultimate.C_memset_#t~loopctr54_110| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse4 (+ |v_#Ultimate.C_memset_#t~loopctr54_111| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse5 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_112|)) (.cse6 (+ |v_#Ultimate.C_memset_#t~loopctr54_113| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse7 (+ |v_#Ultimate.C_memset_#t~loopctr54_114| |c_#Ultimate.C_memset_#ptr.offset|))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse1 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse1) .cse2 .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1) .cse6 .cse1) .cse7 .cse1)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0) .cse6 0) .cse7 0)))))) (exists ((|v_DUPFFnew_#in~maxdeg_BEFORE_CALL_15| Int) (v_arrayElimCell_54 Int)) (= (select |c_#length| v_arrayElimCell_54) (+ (* 4 |v_DUPFFnew_#in~maxdeg_BEFORE_CALL_15|) 4)))) is different from true [2018-02-04 17:51:29,919 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_110| Int) (|v_#Ultimate.C_memset_#t~loopctr54_113| Int) (|v_#Ultimate.C_memset_#t~loopctr54_114| Int) (|v_#Ultimate.C_memset_#t~loopctr54_111| Int) (|v_#Ultimate.C_memset_#t~loopctr54_112| Int) (|v_#Ultimate.C_memset_#t~loopctr54_115| Int) (|v_#Ultimate.C_memset_#t~loopctr54_108| Int) (|v_#Ultimate.C_memset_#t~loopctr54_109| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_108|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_109|)) (.cse3 (+ |v_#Ultimate.C_memset_#t~loopctr54_110| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse4 (+ |v_#Ultimate.C_memset_#t~loopctr54_111| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse5 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_112|)) (.cse6 (+ |v_#Ultimate.C_memset_#t~loopctr54_113| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse7 (+ |v_#Ultimate.C_memset_#t~loopctr54_114| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse8 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_115|))) (and (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse1 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse1) .cse2 .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1) .cse6 .cse1) .cse7 .cse1) .cse8 .cse1))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0) .cse6 0) .cse7 0) .cse8 0)))))) (exists ((|v_DUPFFnew_#in~maxdeg_BEFORE_CALL_15| Int) (v_arrayElimCell_54 Int)) (= (select |c_#length| v_arrayElimCell_54) (+ (* 4 |v_DUPFFnew_#in~maxdeg_BEFORE_CALL_15|) 4)))) is different from true [2018-02-04 17:51:29,981 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_110| Int) (|v_#Ultimate.C_memset_#t~loopctr54_113| Int) (|v_#Ultimate.C_memset_#t~loopctr54_114| Int) (|v_#Ultimate.C_memset_#t~loopctr54_111| Int) (|v_#Ultimate.C_memset_#t~loopctr54_112| Int) (|v_#Ultimate.C_memset_#t~loopctr54_115| Int) (|v_#Ultimate.C_memset_#t~loopctr54_116| Int) (|v_#Ultimate.C_memset_#t~loopctr54_108| Int) (|v_#Ultimate.C_memset_#t~loopctr54_109| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_108|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_109|)) (.cse3 (+ |v_#Ultimate.C_memset_#t~loopctr54_110| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse4 (+ |v_#Ultimate.C_memset_#t~loopctr54_111| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse5 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_112|)) (.cse6 (+ |v_#Ultimate.C_memset_#t~loopctr54_113| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse7 (+ |v_#Ultimate.C_memset_#t~loopctr54_114| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse8 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_115|)) (.cse9 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_116|))) (and (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse1 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse1) .cse2 .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1) .cse6 .cse1) .cse7 .cse1) .cse8 .cse1) .cse9 .cse1))) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0) .cse6 0) .cse7 0) .cse8 0) .cse9 0)) |c_#memory_$Pointer$.base|)))) (exists ((|v_DUPFFnew_#in~maxdeg_BEFORE_CALL_15| Int) (v_arrayElimCell_54 Int)) (= (select |c_#length| v_arrayElimCell_54) (+ (* 4 |v_DUPFFnew_#in~maxdeg_BEFORE_CALL_15|) 4)))) is different from true [2018-02-04 17:51:30,066 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_110| Int) (|v_#Ultimate.C_memset_#t~loopctr54_113| Int) (|v_#Ultimate.C_memset_#t~loopctr54_114| Int) (|v_#Ultimate.C_memset_#t~loopctr54_111| Int) (|v_#Ultimate.C_memset_#t~loopctr54_112| Int) (|v_#Ultimate.C_memset_#t~loopctr54_117| Int) (|v_#Ultimate.C_memset_#t~loopctr54_115| Int) (|v_#Ultimate.C_memset_#t~loopctr54_116| Int) (|v_#Ultimate.C_memset_#t~loopctr54_108| Int) (|v_#Ultimate.C_memset_#t~loopctr54_109| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_108|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_109|)) (.cse3 (+ |v_#Ultimate.C_memset_#t~loopctr54_110| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse4 (+ |v_#Ultimate.C_memset_#t~loopctr54_111| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse5 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_112|)) (.cse6 (+ |v_#Ultimate.C_memset_#t~loopctr54_113| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse7 (+ |v_#Ultimate.C_memset_#t~loopctr54_114| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse8 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_115|)) (.cse9 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_116|)) (.cse10 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_117|))) (and (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse1 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse1) .cse2 .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1) .cse6 .cse1) .cse7 .cse1) .cse8 .cse1) .cse9 .cse1) .cse10 .cse1))) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0) .cse6 0) .cse7 0) .cse8 0) .cse9 0) .cse10 0)) |c_#memory_$Pointer$.base|)))) (exists ((|v_DUPFFnew_#in~maxdeg_BEFORE_CALL_15| Int) (v_arrayElimCell_54 Int)) (= (select |c_#length| v_arrayElimCell_54) (+ (* 4 |v_DUPFFnew_#in~maxdeg_BEFORE_CALL_15|) 4)))) is different from true [2018-02-04 17:51:30,174 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_110| Int) (|v_#Ultimate.C_memset_#t~loopctr54_113| Int) (|v_#Ultimate.C_memset_#t~loopctr54_114| Int) (|v_#Ultimate.C_memset_#t~loopctr54_111| Int) (|v_#Ultimate.C_memset_#t~loopctr54_112| Int) (|v_#Ultimate.C_memset_#t~loopctr54_117| Int) (|v_#Ultimate.C_memset_#t~loopctr54_118| Int) (|v_#Ultimate.C_memset_#t~loopctr54_115| Int) (|v_#Ultimate.C_memset_#t~loopctr54_116| Int) (|v_#Ultimate.C_memset_#t~loopctr54_108| Int) (|v_#Ultimate.C_memset_#t~loopctr54_109| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_108|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_109|)) (.cse3 (+ |v_#Ultimate.C_memset_#t~loopctr54_110| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse4 (+ |v_#Ultimate.C_memset_#t~loopctr54_111| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse5 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_112|)) (.cse6 (+ |v_#Ultimate.C_memset_#t~loopctr54_113| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse7 (+ |v_#Ultimate.C_memset_#t~loopctr54_114| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse8 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_115|)) (.cse9 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_116|)) (.cse10 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_117|)) (.cse11 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_118|))) (and (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse1 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse1) .cse2 .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1) .cse6 .cse1) .cse7 .cse1) .cse8 .cse1) .cse9 .cse1) .cse10 .cse1) .cse11 .cse1))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0) .cse6 0) .cse7 0) .cse8 0) .cse9 0) .cse10 0) .cse11 0)))))) (exists ((|v_DUPFFnew_#in~maxdeg_BEFORE_CALL_15| Int) (v_arrayElimCell_54 Int)) (= (select |c_#length| v_arrayElimCell_54) (+ (* 4 |v_DUPFFnew_#in~maxdeg_BEFORE_CALL_15|) 4)))) is different from true [2018-02-04 17:51:30,243 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|#Ultimate.C_memset_#value| Int) (|v_#Ultimate.C_memset_#t~loopctr54_110| Int) (|v_#Ultimate.C_memset_#t~loopctr54_113| Int) (|v_#Ultimate.C_memset_#t~loopctr54_114| Int) (|v_#Ultimate.C_memset_#t~loopctr54_111| Int) (|#Ultimate.C_memset_#ptr.offset| Int) (|v_#Ultimate.C_memset_#t~loopctr54_112| Int) (|v_#Ultimate.C_memset_#t~loopctr54_117| Int) (|v_#Ultimate.C_memset_#t~loopctr54_118| Int) (|v_#Ultimate.C_memset_#t~loopctr54_115| Int) (|v_#Ultimate.C_memset_#t~loopctr54_116| Int) (|v_#Ultimate.C_memset_#t~loopctr54_108| Int) (|v_#Ultimate.C_memset_#t~loopctr54_119| Int) (|v_#Ultimate.C_memset_#t~loopctr54_109| Int)) (let ((.cse0 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_108|)) (.cse2 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_109|)) (.cse3 (+ |v_#Ultimate.C_memset_#t~loopctr54_110| |#Ultimate.C_memset_#ptr.offset|)) (.cse4 (+ |v_#Ultimate.C_memset_#t~loopctr54_111| |#Ultimate.C_memset_#ptr.offset|)) (.cse5 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_112|)) (.cse6 (+ |v_#Ultimate.C_memset_#t~loopctr54_113| |#Ultimate.C_memset_#ptr.offset|)) (.cse7 (+ |v_#Ultimate.C_memset_#t~loopctr54_114| |#Ultimate.C_memset_#ptr.offset|)) (.cse8 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_115|)) (.cse9 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_116|)) (.cse10 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_117|)) (.cse11 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_118|)) (.cse12 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_119|))) (and (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse1 (mod |#Ultimate.C_memset_#value| 256))) (store (store (store (store (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse1) .cse2 .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1) .cse6 .cse1) .cse7 .cse1) .cse8 .cse1) .cse9 .cse1) .cse10 .cse1) .cse11 .cse1) .cse12 .cse1))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0) .cse6 0) .cse7 0) .cse8 0) .cse9 0) .cse10 0) .cse11 0) .cse12 0)))))) (exists ((|v_DUPFFnew_#in~maxdeg_BEFORE_CALL_15| Int) (v_arrayElimCell_54 Int)) (= (select |c_#length| v_arrayElimCell_54) (+ (* 4 |v_DUPFFnew_#in~maxdeg_BEFORE_CALL_15|) 4)))) is different from true [2018-02-04 17:51:30,325 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 114 treesize of output 115 [2018-02-04 17:51:30,331 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 98 [2018-02-04 17:51:30,351 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 98 treesize of output 100 [2018-02-04 17:51:30,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 102 [2018-02-04 17:51:30,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 104 [2018-02-04 17:51:30,621 INFO L303 Elim1Store]: Index analysis took 145 ms [2018-02-04 17:51:30,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 106 [2018-02-04 17:51:30,809 INFO L303 Elim1Store]: Index analysis took 186 ms [2018-02-04 17:51:30,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 108 [2018-02-04 17:51:31,110 INFO L303 Elim1Store]: Index analysis took 300 ms [2018-02-04 17:51:31,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 110 [2018-02-04 17:51:31,493 INFO L303 Elim1Store]: Index analysis took 380 ms [2018-02-04 17:51:31,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 112 [2018-02-04 17:51:31,986 INFO L303 Elim1Store]: Index analysis took 492 ms [2018-02-04 17:51:31,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 114 [2018-02-04 17:51:32,578 INFO L303 Elim1Store]: Index analysis took 590 ms [2018-02-04 17:51:32,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 116 [2018-02-04 17:51:33,351 INFO L303 Elim1Store]: Index analysis took 771 ms [2018-02-04 17:51:33,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 118 [2018-02-04 17:51:34,245 INFO L303 Elim1Store]: Index analysis took 891 ms [2018-02-04 17:51:34,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 205 [2018-02-04 17:51:34,246 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:34,434 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:34,593 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:34,762 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:34,938 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:35,109 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:35,292 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:35,474 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:35,640 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:35,815 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:35,977 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:36,152 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:36,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:36,644 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 310 treesize of output 304 [2018-02-04 17:51:36,648 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 74 [2018-02-04 17:51:36,653 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 74 treesize of output 76 [2018-02-04 17:51:36,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, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 78 [2018-02-04 17:51:36,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 80 [2018-02-04 17:51:36,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 82 [2018-02-04 17:51:36,924 INFO L303 Elim1Store]: Index analysis took 122 ms [2018-02-04 17:51:36,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 84 [2018-02-04 17:51:36,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 86 [2018-02-04 17:51:36,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 88 [2018-02-04 17:51:37,204 INFO L303 Elim1Store]: Index analysis took 221 ms [2018-02-04 17:51:37,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 90 [2018-02-04 17:51:37,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 92 [2018-02-04 17:51:37,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 94 [2018-02-04 17:51:37,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 181 [2018-02-04 17:51:37,370 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:37,392 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:37,415 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:37,438 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:37,473 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:37,494 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:37,514 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:37,535 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:37,557 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:37,579 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:37,602 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:37,625 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:37,681 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:37,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 2 dim-2 vars, End of recursive call: 16 dim-0 vars, and 1 xjuncts. [2018-02-04 17:51:37,745 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 18 variables, input treesize:231, output treesize:431 [2018-02-04 17:51:37,836 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 425 treesize of output 329 [2018-02-04 17:51:37,840 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:51:37,842 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 370 treesize of output 416 [2018-02-04 17:51:37,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:37,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:37,976 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 229 treesize of output 234 [2018-02-04 17:51:37,980 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:51:37,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-04 17:51:37,982 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:38,011 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:38,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 2 dim-2 vars, End of recursive call: 14 dim-0 vars, and 1 xjuncts. [2018-02-04 17:51:38,078 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:452, output treesize:422 [2018-02-04 17:51:38,089 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 429 treesize of output 333 [2018-02-04 17:51:38,094 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:51:38,095 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 374 treesize of output 418 [2018-02-04 17:51:38,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:38,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:38,233 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 233 treesize of output 238 [2018-02-04 17:51:38,236 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:51:38,237 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 24 treesize of output 18 [2018-02-04 17:51:38,238 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:38,267 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:38,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 2 dim-2 vars, End of recursive call: 14 dim-0 vars, and 1 xjuncts. [2018-02-04 17:51:38,331 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:460, output treesize:422 [2018-02-04 17:51:38,495 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 361 treesize of output 259 [2018-02-04 17:51:38,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 1 [2018-02-04 17:51:38,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:38,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 142 [2018-02-04 17:51:38,598 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:38,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:38,660 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 147 treesize of output 123 [2018-02-04 17:51:38,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 1 [2018-02-04 17:51:38,715 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:38,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-04 17:51:38,718 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:38,719 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:38,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:38,721 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 17 variables, input treesize:375, output treesize:9 [2018-02-04 17:51:38,768 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 78 not checked. [2018-02-04 17:51:38,768 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:51:38,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 17:51:38,768 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 17:51:38,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 17:51:38,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=240, Unknown=12, NotChecked=492, Total=812 [2018-02-04 17:51:38,769 INFO L87 Difference]: Start difference. First operand 245 states and 299 transitions. Second operand 29 states. [2018-02-04 17:51:42,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:51:42,773 INFO L93 Difference]: Finished difference Result 265 states and 327 transitions. [2018-02-04 17:51:42,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 17:51:42,773 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 79 [2018-02-04 17:51:42,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:51:42,774 INFO L225 Difference]: With dead ends: 265 [2018-02-04 17:51:42,774 INFO L226 Difference]: Without dead ends: 265 [2018-02-04 17:51:42,774 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=158, Invalid=477, Unknown=13, NotChecked=684, Total=1332 [2018-02-04 17:51:42,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-02-04 17:51:42,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 245. [2018-02-04 17:51:42,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-02-04 17:51:42,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 298 transitions. [2018-02-04 17:51:42,777 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 298 transitions. Word has length 79 [2018-02-04 17:51:42,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:51:42,777 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 298 transitions. [2018-02-04 17:51:42,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 17:51:42,777 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 298 transitions. [2018-02-04 17:51:42,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-04 17:51:42,778 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:51:42,778 INFO L351 BasicCegarLoop]: trace histogram [21, 2, 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, 1, 1, 1, 1, 1, 1] [2018-02-04 17:51:42,778 INFO L371 AbstractCegarLoop]: === Iteration 29 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:51:42,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1741206802, now seen corresponding path program 6 times [2018-02-04 17:51:42,778 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:51:42,778 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:51:42,779 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:51:42,779 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:51:42,779 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:51:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:51:42,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:51:43,096 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 209 proven. 25 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-04 17:51:43,096 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:51:43,096 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:51:43,097 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:51:43,145 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-02-04 17:51:43,145 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:51:43,149 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:51:43,391 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 220 proven. 13 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-04 17:51:43,391 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:51:43,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 36 [2018-02-04 17:51:43,391 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 17:51:43,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 17:51:43,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1043, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 17:51:43,392 INFO L87 Difference]: Start difference. First operand 245 states and 298 transitions. Second operand 36 states. [2018-02-04 17:51:44,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:51:44,074 INFO L93 Difference]: Finished difference Result 271 states and 329 transitions. [2018-02-04 17:51:44,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 17:51:44,074 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 80 [2018-02-04 17:51:44,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:51:44,075 INFO L225 Difference]: With dead ends: 271 [2018-02-04 17:51:44,075 INFO L226 Difference]: Without dead ends: 265 [2018-02-04 17:51:44,076 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=565, Invalid=2405, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 17:51:44,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-02-04 17:51:44,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 232. [2018-02-04 17:51:44,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-02-04 17:51:44,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 284 transitions. [2018-02-04 17:51:44,080 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 284 transitions. Word has length 80 [2018-02-04 17:51:44,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:51:44,081 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 284 transitions. [2018-02-04 17:51:44,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 17:51:44,081 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 284 transitions. [2018-02-04 17:51:44,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 17:51:44,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:51:44,082 INFO L351 BasicCegarLoop]: trace histogram [20, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:51:44,082 INFO L371 AbstractCegarLoop]: === Iteration 30 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:51:44,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1424236394, now seen corresponding path program 1 times [2018-02-04 17:51:44,082 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:51:44,082 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:51:44,083 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:51:44,083 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:51:44,083 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:51:44,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:51:44,102 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:51:44,110 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:51:44,110 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:51:44,110 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:51:44,111 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:51:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:51:44,235 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:51:44,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:51:44,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:44,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:44,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:51:44,255 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 5 treesize of output 1 [2018-02-04 17:51:44,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:44,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:44,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-02-04 17:51:44,288 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|DUPFFnew_#t~malloc1.base| Int)) (and (= 0 (select |c_old(#valid)| |DUPFFnew_#t~malloc1.base|)) (= |c_#valid| (store |c_old(#valid)| |DUPFFnew_#t~malloc1.base| 1)))) is different from true [2018-02-04 17:51:44,296 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|DUPFFnew_#t~malloc1.base| Int) (|DUPFFnew_#t~malloc3.base| Int)) (let ((.cse0 (store |c_old(#valid)| |DUPFFnew_#t~malloc1.base| 1))) (and (= 0 (select |c_old(#valid)| |DUPFFnew_#t~malloc1.base|)) (= |c_#valid| (store .cse0 |DUPFFnew_#t~malloc3.base| 1)) (= (select .cse0 |DUPFFnew_#t~malloc3.base|) 0)))) is different from true [2018-02-04 17:51:44,311 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:51:44,312 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-02-04 17:51:44,321 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:51:44,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 17:51:44,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:44,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:44,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:51:44,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-02-04 17:51:45,031 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:51:45,032 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:51:45,033 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:51:45,034 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 40 [2018-02-04 17:51:45,036 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 28 treesize of output 34 [2018-02-04 17:51:45,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:45,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:45,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:51:45,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:28 [2018-02-04 17:51:45,183 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 126 proven. 6 refuted. 0 times theorem prover too weak. 114 trivial. 4 not checked. [2018-02-04 17:51:45,184 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:51:45,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 17:51:45,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:51:45,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:51:45,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=193, Unknown=3, NotChecked=58, Total=306 [2018-02-04 17:51:45,185 INFO L87 Difference]: Start difference. First operand 232 states and 284 transitions. Second operand 18 states. [2018-02-04 17:51:45,527 WARN L143 SmtUtils]: Spent 128ms on a formula simplification that was a NOOP. DAG size: 19 [2018-02-04 17:51:49,971 WARN L146 SmtUtils]: Spent 4009ms on a formula simplification. DAG size of input: 31 DAG size of output 25 [2018-02-04 17:51:54,016 WARN L146 SmtUtils]: Spent 4009ms on a formula simplification. DAG size of input: 31 DAG size of output 25 [2018-02-04 17:51:55,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:51:55,522 INFO L93 Difference]: Finished difference Result 378 states and 483 transitions. [2018-02-04 17:51:55,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 17:51:55,523 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 86 [2018-02-04 17:51:55,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:51:55,524 INFO L225 Difference]: With dead ends: 378 [2018-02-04 17:51:55,524 INFO L226 Difference]: Without dead ends: 378 [2018-02-04 17:51:55,524 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=161, Invalid=770, Unknown=7, NotChecked=118, Total=1056 [2018-02-04 17:51:55,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-02-04 17:51:55,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 329. [2018-02-04 17:51:55,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-02-04 17:51:55,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 460 transitions. [2018-02-04 17:51:55,529 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 460 transitions. Word has length 86 [2018-02-04 17:51:55,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:51:55,529 INFO L432 AbstractCegarLoop]: Abstraction has 329 states and 460 transitions. [2018-02-04 17:51:55,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:51:55,529 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 460 transitions. [2018-02-04 17:51:55,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 17:51:55,530 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:51:55,530 INFO L351 BasicCegarLoop]: trace histogram [20, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:51:55,530 INFO L371 AbstractCegarLoop]: === Iteration 31 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 17:51:55,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1424236393, now seen corresponding path program 1 times [2018-02-04 17:51:55,531 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:51:55,531 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:51:55,531 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:51:55,531 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:51:55,531 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:51:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:51:55,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:51:55,556 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:51:55,556 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:51:55,556 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:51:55,556 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:51:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:51:55,656 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:51:55,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:51:55,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:55,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:51:55,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:55,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:51:55,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-02-04 17:51:55,712 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:51:55,713 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 19 [2018-02-04 17:51:55,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:55,722 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:51:55,722 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:51:55,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:51:55,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:55,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:51:55,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-02-04 17:51:56,122 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|DUPFFnew_#t~malloc1.base| Int) (|DUPFFnew_#t~malloc3.base| Int)) (and (= (store (store |c_old(#length)| |DUPFFnew_#t~malloc1.base| 12) |DUPFFnew_#t~malloc3.base| (+ (* 4 |c_DUPFFnew_#in~maxdeg|) 4)) |c_#length|) (= 0 (select |c_old(#valid)| |DUPFFnew_#t~malloc1.base|)))) is different from true [2018-02-04 17:51:56,124 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-02-04 17:51:56,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 19 [2018-02-04 17:51:56,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:51:56,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:51:56,143 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 5 treesize of output 1 [2018-02-04 17:51:56,143 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:56,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-02-04 17:51:56,149 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:19, output treesize:25 [2018-02-04 17:51:56,302 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_1664 Int) (v_prenex_1663 Int)) (= (+ (* 4 v_prenex_1663) 4) (select |c_#length| v_prenex_1664))) (exists ((|DUPFFnew_#t~malloc1.base| Int) (|DUPFFnew_#t~malloc3.base| Int)) (and (= (store (store |c_old(#length)| |DUPFFnew_#t~malloc1.base| 12) |DUPFFnew_#t~malloc3.base| (+ (* 4 |c_DUPFFnew_#in~maxdeg|) 4)) |c_#length|) (= 0 (select |c_old(#valid)| |DUPFFnew_#t~malloc1.base|))))) is different from true [2018-02-04 17:51:56,308 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:51:56,309 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:51:56,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2018-02-04 17:51:56,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:56,320 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:51:56,321 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:51:56,326 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 2 case distinctions, treesize of input 31 treesize of output 55 [2018-02-04 17:51:56,333 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 2 case distinctions, treesize of input 51 treesize of output 52 [2018-02-04 17:51:56,333 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 17:51:56,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-02-04 17:51:56,365 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:51:56,384 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 17:51:56,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 14 dim-0 vars, and 3 xjuncts. [2018-02-04 17:51:56,407 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:62, output treesize:128 [2018-02-04 17:51:56,855 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 2 proven. 125 refuted. 0 times theorem prover too weak. 114 trivial. 9 not checked. [2018-02-04 17:51:56,855 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:51:56,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 17:51:56,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 17:51:56,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 17:51:56,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=391, Unknown=3, NotChecked=82, Total=552 [2018-02-04 17:51:56,856 INFO L87 Difference]: Start difference. First operand 329 states and 460 transitions. Second operand 24 states. Received shutdown request... [2018-02-04 17:52:15,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 17:52:15,109 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 17:52:15,114 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 17:52:15,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:52:15 BoogieIcfgContainer [2018-02-04 17:52:15,114 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:52:15,115 INFO L168 Benchmark]: Toolchain (without parser) took 199904.89 ms. Allocated memory was 397.9 MB in the beginning and 730.3 MB in the end (delta: 332.4 MB). Free memory was 352.0 MB in the beginning and 404.1 MB in the end (delta: -52.1 MB). Peak memory consumption was 280.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:52:15,115 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 397.9 MB. Free memory is still 359.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:52:15,116 INFO L168 Benchmark]: CACSL2BoogieTranslator took 179.75 ms. Allocated memory is still 397.9 MB. Free memory was 352.0 MB in the beginning and 336.1 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. [2018-02-04 17:52:15,116 INFO L168 Benchmark]: Boogie Preprocessor took 33.81 ms. Allocated memory is still 397.9 MB. Free memory was 336.1 MB in the beginning and 333.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:52:15,116 INFO L168 Benchmark]: RCFGBuilder took 475.45 ms. Allocated memory is still 397.9 MB. Free memory was 333.5 MB in the beginning and 284.5 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 5.3 GB. [2018-02-04 17:52:15,116 INFO L168 Benchmark]: TraceAbstraction took 199213.25 ms. Allocated memory was 397.9 MB in the beginning and 730.3 MB in the end (delta: 332.4 MB). Free memory was 281.9 MB in the beginning and 404.1 MB in the end (delta: -122.2 MB). Peak memory consumption was 210.2 MB. Max. memory is 5.3 GB. [2018-02-04 17:52:15,118 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.13 ms. Allocated memory is still 397.9 MB. Free memory is still 359.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 179.75 ms. Allocated memory is still 397.9 MB. Free memory was 352.0 MB in the beginning and 336.1 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.81 ms. Allocated memory is still 397.9 MB. Free memory was 336.1 MB in the beginning and 333.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 475.45 ms. Allocated memory is still 397.9 MB. Free memory was 333.5 MB in the beginning and 284.5 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 199213.25 ms. Allocated memory was 397.9 MB in the beginning and 730.3 MB in the end (delta: 332.4 MB). Free memory was 281.9 MB in the beginning and 404.1 MB in the end (delta: -122.2 MB). Peak memory consumption was 210.2 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 979). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 979). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 982). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 978). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 978). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 981). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 982). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 981). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 979). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 976). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 976). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 979). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 971). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 971). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1045]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1045). Cancelled while BasicCegarLoop was constructing difference of abstraction (329states) and interpolant automaton (currently 26 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (436 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 210 locations, 55 error locations. TIMEOUT Result, 199.1s OverallTime, 31 OverallIterations, 21 TraceHistogramMax, 78.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6669 SDtfs, 2300 SDslu, 44073 SDs, 0 SdLazy, 18637 SolverSat, 1049 SolverUnsat, 311 SolverUnknown, 0 SolverNotchecked, 55.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1556 GetRequests, 964 SyntacticMatches, 10 SemanticMatches, 582 ConstructedPredicates, 24 IntricatePredicates, 0 DeprecatedPredicates, 2819 ImplicationChecksByTransitivity, 64.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=329occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 30 MinimizatonAttempts, 459 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 119.0s InterpolantComputationTime, 2591 NumberOfCodeBlocks, 2591 NumberOfCodeBlocksAsserted, 87 NumberOfCheckSat, 2118 ConstructedInterpolants, 263 QuantifiedInterpolants, 1339002 SizeOfPredicates, 106 NumberOfNonLiveVariables, 5973 ConjunctsInSsa, 515 ConjunctsInUnsatCore, 44 InterpolantComputations, 12 PerfectInterpolantSequences, 2797/3818 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20020406-1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-52-15-124.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20020406-1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-52-15-124.csv Completed graceful shutdown