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_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/20020406-1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-03 23:10:15,140 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 23:10:15,141 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 23:10:15,151 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 23:10:15,151 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 23:10:15,151 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 23:10:15,152 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 23:10:15,153 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 23:10:15,155 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 23:10:15,155 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 23:10:15,156 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 23:10:15,156 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 23:10:15,157 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 23:10:15,158 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 23:10:15,159 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 23:10:15,161 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 23:10:15,162 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 23:10:15,164 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 23:10:15,165 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 23:10:15,166 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 23:10:15,167 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 23:10:15,168 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 23:10:15,168 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 23:10:15,169 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 23:10:15,169 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 23:10:15,170 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 23:10:15,171 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 23:10:15,171 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 23:10:15,171 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 23:10:15,171 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 23:10:15,172 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 23:10:15,172 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-03 23:10:15,182 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 23:10:15,182 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 23:10:15,183 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 23:10:15,183 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 23:10:15,183 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 23:10:15,183 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 23:10:15,184 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 23:10:15,184 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 23:10:15,184 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 23:10:15,184 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 23:10:15,184 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 23:10:15,184 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 23:10:15,184 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 23:10:15,185 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 23:10:15,185 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 23:10:15,185 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 23:10:15,185 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 23:10:15,185 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 23:10:15,185 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 23:10:15,186 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 23:10:15,186 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 23:10:15,186 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 23:10:15,186 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 23:10:15,186 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 23:10:15,186 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 23:10:15,214 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 23:10:15,223 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 23:10:15,226 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 23:10:15,228 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 23:10:15,228 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 23:10:15,229 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-03 23:10:15,392 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 23:10:15,394 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 23:10:15,394 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 23:10:15,395 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 23:10:15,401 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 23:10:15,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 11:10:15" (1/1) ... [2018-02-03 23:10:15,404 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@87928be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:10:15, skipping insertion in model container [2018-02-03 23:10:15,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 11:10:15" (1/1) ... [2018-02-03 23:10:15,419 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 23:10:15,457 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 23:10:15,561 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 23:10:15,582 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 23:10:15,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:10:15 WrapperNode [2018-02-03 23:10:15,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 23:10:15,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 23:10:15,589 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 23:10:15,589 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 23:10:15,598 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:10:15" (1/1) ... [2018-02-03 23:10:15,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:10:15" (1/1) ... [2018-02-03 23:10:15,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:10:15" (1/1) ... [2018-02-03 23:10:15,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:10:15" (1/1) ... [2018-02-03 23:10:15,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:10:15" (1/1) ... [2018-02-03 23:10:15,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:10:15" (1/1) ... [2018-02-03 23:10:15,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:10:15" (1/1) ... [2018-02-03 23:10:15,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 23:10:15,626 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 23:10:15,626 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 23:10:15,626 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 23:10:15,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:10:15" (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-03 23:10:15,663 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 23:10:15,663 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 23:10:15,663 INFO L136 BoogieDeclarations]: Found implementation of procedure FFmul [2018-02-03 23:10:15,663 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFdeg [2018-02-03 23:10:15,663 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFnew [2018-02-03 23:10:15,663 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFfree [2018-02-03 23:10:15,663 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFswap [2018-02-03 23:10:15,663 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFcopy [2018-02-03 23:10:15,664 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFshift_add [2018-02-03 23:10:15,664 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFexgcd [2018-02-03 23:10:15,664 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 23:10:15,664 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-03 23:10:15,664 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-03 23:10:15,664 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-03 23:10:15,664 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-03 23:10:15,664 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 23:10:15,664 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 23:10:15,664 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 23:10:15,665 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-03 23:10:15,665 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-03 23:10:15,665 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-03 23:10:15,665 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-03 23:10:15,665 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-03 23:10:15,665 INFO L128 BoogieDeclarations]: Found specification of procedure FFmul [2018-02-03 23:10:15,665 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFdeg [2018-02-03 23:10:15,665 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFnew [2018-02-03 23:10:15,666 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFfree [2018-02-03 23:10:15,666 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFswap [2018-02-03 23:10:15,666 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFcopy [2018-02-03 23:10:15,666 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFshift_add [2018-02-03 23:10:15,666 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFexgcd [2018-02-03 23:10:15,666 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 23:10:15,666 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 23:10:15,666 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 23:10:15,830 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-03 23:10:16,090 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 23:10:16,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 11:10:16 BoogieIcfgContainer [2018-02-03 23:10:16,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 23:10:16,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 23:10:16,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 23:10:16,093 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 23:10:16,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 11:10:15" (1/3) ... [2018-02-03 23:10:16,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@262c3fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 11:10:16, skipping insertion in model container [2018-02-03 23:10:16,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:10:15" (2/3) ... [2018-02-03 23:10:16,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@262c3fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 11:10:16, skipping insertion in model container [2018-02-03 23:10:16,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 11:10:16" (3/3) ... [2018-02-03 23:10:16,095 INFO L107 eAbstractionObserver]: Analyzing ICFG 20020406-1_false-valid-memtrack.i [2018-02-03 23:10:16,100 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 23:10:16,107 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-02-03 23:10:16,140 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 23:10:16,141 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 23:10:16,141 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 23:10:16,141 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 23:10:16,141 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 23:10:16,141 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 23:10:16,141 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 23:10:16,142 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 23:10:16,142 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 23:10:16,158 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states. [2018-02-03 23:10:16,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-03 23:10:16,166 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:16,167 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:16,167 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-03 23:10:16,171 INFO L82 PathProgramCache]: Analyzing trace with hash 167141018, now seen corresponding path program 1 times [2018-02-03 23:10:16,173 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:16,173 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:16,215 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:16,216 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:16,216 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:16,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:16,344 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-03 23:10:16,346 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:16,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:10:16,419 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:10:16,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:10:16,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:10:16,431 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 4 states. [2018-02-03 23:10:16,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:16,616 INFO L93 Difference]: Finished difference Result 205 states and 241 transitions. [2018-02-03 23:10:16,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 23:10:16,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-03 23:10:16,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:16,629 INFO L225 Difference]: With dead ends: 205 [2018-02-03 23:10:16,629 INFO L226 Difference]: Without dead ends: 202 [2018-02-03 23:10:16,630 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-03 23:10:16,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-03 23:10:16,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-02-03 23:10:16,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-02-03 23:10:16,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 238 transitions. [2018-02-03 23:10:16,667 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 238 transitions. Word has length 14 [2018-02-03 23:10:16,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:16,667 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 238 transitions. [2018-02-03 23:10:16,667 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:10:16,667 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 238 transitions. [2018-02-03 23:10:16,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-03 23:10:16,667 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:16,667 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:16,668 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-03 23:10:16,668 INFO L82 PathProgramCache]: Analyzing trace with hash 167141019, now seen corresponding path program 1 times [2018-02-03 23:10:16,668 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:16,668 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:16,669 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:16,669 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:16,669 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:16,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:16,759 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-03 23:10:16,760 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:16,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:10:16,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:10:16,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:10:16,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:10:16,765 INFO L87 Difference]: Start difference. First operand 202 states and 238 transitions. Second operand 4 states. [2018-02-03 23:10:16,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:16,921 INFO L93 Difference]: Finished difference Result 206 states and 247 transitions. [2018-02-03 23:10:16,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 23:10:16,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-03 23:10:16,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:16,924 INFO L225 Difference]: With dead ends: 206 [2018-02-03 23:10:16,924 INFO L226 Difference]: Without dead ends: 206 [2018-02-03 23:10:16,924 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-03 23:10:16,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-03 23:10:16,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2018-02-03 23:10:16,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-02-03 23:10:16,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 239 transitions. [2018-02-03 23:10:16,935 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 239 transitions. Word has length 14 [2018-02-03 23:10:16,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:16,935 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 239 transitions. [2018-02-03 23:10:16,935 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:10:16,935 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 239 transitions. [2018-02-03 23:10:16,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-03 23:10:16,935 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:16,936 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:16,936 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-03 23:10:16,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1430949362, now seen corresponding path program 1 times [2018-02-03 23:10:16,936 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:16,936 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:16,937 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:16,937 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:16,937 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:16,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:17,004 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-03 23:10:17,004 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:17,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 23:10:17,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:10:17,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:10:17,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:10:17,005 INFO L87 Difference]: Start difference. First operand 203 states and 239 transitions. Second operand 5 states. [2018-02-03 23:10:17,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:17,131 INFO L93 Difference]: Finished difference Result 202 states and 243 transitions. [2018-02-03 23:10:17,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 23:10:17,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-03 23:10:17,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:17,133 INFO L225 Difference]: With dead ends: 202 [2018-02-03 23:10:17,133 INFO L226 Difference]: Without dead ends: 202 [2018-02-03 23:10:17,133 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-03 23:10:17,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-03 23:10:17,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 197. [2018-02-03 23:10:17,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-03 23:10:17,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 233 transitions. [2018-02-03 23:10:17,144 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 233 transitions. Word has length 17 [2018-02-03 23:10:17,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:17,144 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 233 transitions. [2018-02-03 23:10:17,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:10:17,145 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 233 transitions. [2018-02-03 23:10:17,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-03 23:10:17,145 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:17,145 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-03 23:10:17,145 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-03 23:10:17,146 INFO L82 PathProgramCache]: Analyzing trace with hash 752800660, now seen corresponding path program 1 times [2018-02-03 23:10:17,146 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:17,146 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:17,146 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:17,147 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:17,147 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:17,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:17,188 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-03 23:10:17,189 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:17,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 23:10:17,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:10:17,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:10:17,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:10:17,189 INFO L87 Difference]: Start difference. First operand 197 states and 233 transitions. Second operand 5 states. [2018-02-03 23:10:17,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:17,392 INFO L93 Difference]: Finished difference Result 201 states and 242 transitions. [2018-02-03 23:10:17,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 23:10:17,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-03 23:10:17,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:17,393 INFO L225 Difference]: With dead ends: 201 [2018-02-03 23:10:17,393 INFO L226 Difference]: Without dead ends: 201 [2018-02-03 23:10:17,393 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-03 23:10:17,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-02-03 23:10:17,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 196. [2018-02-03 23:10:17,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-03 23:10:17,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 232 transitions. [2018-02-03 23:10:17,407 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 232 transitions. Word has length 19 [2018-02-03 23:10:17,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:17,407 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 232 transitions. [2018-02-03 23:10:17,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:10:17,407 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 232 transitions. [2018-02-03 23:10:17,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-03 23:10:17,408 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:17,408 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-03 23:10:17,408 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-03 23:10:17,408 INFO L82 PathProgramCache]: Analyzing trace with hash 752800661, now seen corresponding path program 1 times [2018-02-03 23:10:17,409 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:17,409 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:17,410 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:17,410 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:17,410 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:17,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:17,482 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-03 23:10:17,482 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:17,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 23:10:17,483 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:10:17,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:10:17,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:10:17,483 INFO L87 Difference]: Start difference. First operand 196 states and 232 transitions. Second operand 5 states. [2018-02-03 23:10:17,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:17,683 INFO L93 Difference]: Finished difference Result 200 states and 241 transitions. [2018-02-03 23:10:17,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 23:10:17,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-03 23:10:17,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:17,685 INFO L225 Difference]: With dead ends: 200 [2018-02-03 23:10:17,685 INFO L226 Difference]: Without dead ends: 200 [2018-02-03 23:10:17,685 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-03 23:10:17,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-02-03 23:10:17,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 195. [2018-02-03 23:10:17,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-03 23:10:17,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 231 transitions. [2018-02-03 23:10:17,691 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 231 transitions. Word has length 19 [2018-02-03 23:10:17,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:17,691 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 231 transitions. [2018-02-03 23:10:17,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:10:17,692 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 231 transitions. [2018-02-03 23:10:17,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-03 23:10:17,692 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:17,692 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-03 23:10:17,693 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-03 23:10:17,693 INFO L82 PathProgramCache]: Analyzing trace with hash -439424694, now seen corresponding path program 1 times [2018-02-03 23:10:17,693 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:17,693 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:17,693 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:17,693 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:17,693 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:17,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:17,734 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-03 23:10:17,734 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:17,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 23:10:17,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:10:17,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:10:17,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:10:17,735 INFO L87 Difference]: Start difference. First operand 195 states and 231 transitions. Second operand 5 states. [2018-02-03 23:10:17,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:17,765 INFO L93 Difference]: Finished difference Result 210 states and 251 transitions. [2018-02-03 23:10:17,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 23:10:17,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-02-03 23:10:17,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:17,767 INFO L225 Difference]: With dead ends: 210 [2018-02-03 23:10:17,767 INFO L226 Difference]: Without dead ends: 210 [2018-02-03 23:10:17,767 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-03 23:10:17,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-03 23:10:17,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-02-03 23:10:17,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-03 23:10:17,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 251 transitions. [2018-02-03 23:10:17,775 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 251 transitions. Word has length 22 [2018-02-03 23:10:17,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:17,775 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 251 transitions. [2018-02-03 23:10:17,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:10:17,775 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 251 transitions. [2018-02-03 23:10:17,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-03 23:10:17,776 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:17,776 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-03 23:10:17,776 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-03 23:10:17,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1616475983, now seen corresponding path program 1 times [2018-02-03 23:10:17,776 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:17,776 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:17,777 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:17,777 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:17,777 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:17,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:17,820 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-03 23:10:17,820 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:17,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 23:10:17,821 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 23:10:17,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 23:10:17,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 23:10:17,821 INFO L87 Difference]: Start difference. First operand 210 states and 251 transitions. Second operand 6 states. [2018-02-03 23:10:18,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:18,001 INFO L93 Difference]: Finished difference Result 208 states and 249 transitions. [2018-02-03 23:10:18,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 23:10:18,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-02-03 23:10:18,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:18,003 INFO L225 Difference]: With dead ends: 208 [2018-02-03 23:10:18,003 INFO L226 Difference]: Without dead ends: 208 [2018-02-03 23:10:18,004 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-03 23:10:18,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-03 23:10:18,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-02-03 23:10:18,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-03 23:10:18,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 249 transitions. [2018-02-03 23:10:18,010 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 249 transitions. Word has length 32 [2018-02-03 23:10:18,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:18,011 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 249 transitions. [2018-02-03 23:10:18,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 23:10:18,011 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 249 transitions. [2018-02-03 23:10:18,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-03 23:10:18,012 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:18,012 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-03 23:10:18,012 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-03 23:10:18,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1616475984, now seen corresponding path program 1 times [2018-02-03 23:10:18,012 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:18,013 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:18,013 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:18,013 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:18,014 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:18,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:18,111 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-03 23:10:18,111 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:18,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 23:10:18,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 23:10:18,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 23:10:18,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-03 23:10:18,112 INFO L87 Difference]: Start difference. First operand 208 states and 249 transitions. Second operand 8 states. [2018-02-03 23:10:18,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:18,257 INFO L93 Difference]: Finished difference Result 206 states and 247 transitions. [2018-02-03 23:10:18,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 23:10:18,257 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-02-03 23:10:18,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:18,258 INFO L225 Difference]: With dead ends: 206 [2018-02-03 23:10:18,259 INFO L226 Difference]: Without dead ends: 206 [2018-02-03 23:10:18,259 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-03 23:10:18,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-03 23:10:18,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-02-03 23:10:18,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-03 23:10:18,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 247 transitions. [2018-02-03 23:10:18,265 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 247 transitions. Word has length 32 [2018-02-03 23:10:18,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:18,267 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 247 transitions. [2018-02-03 23:10:18,267 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 23:10:18,267 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 247 transitions. [2018-02-03 23:10:18,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-03 23:10:18,268 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:18,268 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-03 23:10:18,268 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-03 23:10:18,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1428852052, now seen corresponding path program 1 times [2018-02-03 23:10:18,269 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:18,269 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:18,269 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:18,269 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:18,270 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:18,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:18,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:18,340 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-03 23:10:18,340 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:18,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 23:10:18,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-03 23:10:18,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-03 23:10:18,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-03 23:10:18,343 INFO L87 Difference]: Start difference. First operand 206 states and 247 transitions. Second operand 7 states. [2018-02-03 23:10:18,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:18,428 INFO L93 Difference]: Finished difference Result 215 states and 261 transitions. [2018-02-03 23:10:18,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-03 23:10:18,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-02-03 23:10:18,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:18,432 INFO L225 Difference]: With dead ends: 215 [2018-02-03 23:10:18,432 INFO L226 Difference]: Without dead ends: 215 [2018-02-03 23:10:18,432 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-03 23:10:18,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-03 23:10:18,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-02-03 23:10:18,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-03 23:10:18,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 261 transitions. [2018-02-03 23:10:18,440 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 261 transitions. Word has length 33 [2018-02-03 23:10:18,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:18,440 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 261 transitions. [2018-02-03 23:10:18,441 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-03 23:10:18,441 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 261 transitions. [2018-02-03 23:10:18,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-03 23:10:18,441 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:18,442 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-03 23:10:18,442 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-03 23:10:18,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1006536674, now seen corresponding path program 1 times [2018-02-03 23:10:18,442 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:18,442 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:18,445 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:18,445 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:18,445 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:18,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:18,552 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-03 23:10:18,553 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:10:18,553 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:10:18,561 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:18,595 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:10:18,670 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-03 23:10:18,701 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:10:18,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-02-03 23:10:18,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-03 23:10:18,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-03 23:10:18,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-03 23:10:18,702 INFO L87 Difference]: Start difference. First operand 215 states and 261 transitions. Second operand 11 states. [2018-02-03 23:10:18,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:18,871 INFO L93 Difference]: Finished difference Result 230 states and 280 transitions. [2018-02-03 23:10:18,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-03 23:10:18,872 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-02-03 23:10:18,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:18,873 INFO L225 Difference]: With dead ends: 230 [2018-02-03 23:10:18,873 INFO L226 Difference]: Without dead ends: 229 [2018-02-03 23:10:18,873 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-02-03 23:10:18,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-03 23:10:18,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 216. [2018-02-03 23:10:18,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-03 23:10:18,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 258 transitions. [2018-02-03 23:10:18,883 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 258 transitions. Word has length 34 [2018-02-03 23:10:18,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:18,883 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 258 transitions. [2018-02-03 23:10:18,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-03 23:10:18,883 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 258 transitions. [2018-02-03 23:10:18,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-03 23:10:18,884 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:18,884 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-03 23:10:18,884 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-03 23:10:18,885 INFO L82 PathProgramCache]: Analyzing trace with hash -799661844, now seen corresponding path program 2 times [2018-02-03 23:10:18,885 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:18,885 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:18,886 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:18,886 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:18,886 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:18,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:18,986 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-03 23:10:18,986 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:10:18,987 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:10:18,996 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 23:10:19,035 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 23:10:19,036 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:10:19,038 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:10:19,070 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-03 23:10:19,088 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:10:19,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2018-02-03 23:10:19,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-03 23:10:19,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-03 23:10:19,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-02-03 23:10:19,089 INFO L87 Difference]: Start difference. First operand 216 states and 258 transitions. Second operand 12 states. [2018-02-03 23:10:19,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:19,259 INFO L93 Difference]: Finished difference Result 233 states and 279 transitions. [2018-02-03 23:10:19,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-03 23:10:19,260 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-02-03 23:10:19,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:19,261 INFO L225 Difference]: With dead ends: 233 [2018-02-03 23:10:19,261 INFO L226 Difference]: Without dead ends: 227 [2018-02-03 23:10:19,262 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-03 23:10:19,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-02-03 23:10:19,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 217. [2018-02-03 23:10:19,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-03 23:10:19,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 260 transitions. [2018-02-03 23:10:19,269 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 260 transitions. Word has length 35 [2018-02-03 23:10:19,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:19,269 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 260 transitions. [2018-02-03 23:10:19,269 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-03 23:10:19,269 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 260 transitions. [2018-02-03 23:10:19,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-03 23:10:19,270 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:19,270 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-03 23:10:19,270 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-03 23:10:19,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1318490590, now seen corresponding path program 3 times [2018-02-03 23:10:19,270 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:19,270 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:19,271 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:19,271 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:10:19,271 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:19,285 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:19,366 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-03 23:10:19,366 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:10:19,366 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:10:19,374 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-03 23:10:19,431 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-03 23:10:19,431 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:10:19,434 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:10:19,473 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-03 23:10:19,505 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:10:19,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2018-02-03 23:10:19,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-03 23:10:19,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-03 23:10:19,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-02-03 23:10:19,506 INFO L87 Difference]: Start difference. First operand 217 states and 260 transitions. Second operand 13 states. [2018-02-03 23:10:19,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:19,711 INFO L93 Difference]: Finished difference Result 236 states and 283 transitions. [2018-02-03 23:10:19,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-03 23:10:19,714 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-02-03 23:10:19,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:19,715 INFO L225 Difference]: With dead ends: 236 [2018-02-03 23:10:19,715 INFO L226 Difference]: Without dead ends: 230 [2018-02-03 23:10:19,716 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-02-03 23:10:19,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-02-03 23:10:19,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 218. [2018-02-03 23:10:19,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-03 23:10:19,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 262 transitions. [2018-02-03 23:10:19,723 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 262 transitions. Word has length 36 [2018-02-03 23:10:19,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:19,723 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 262 transitions. [2018-02-03 23:10:19,723 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-03 23:10:19,723 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 262 transitions. [2018-02-03 23:10:19,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-03 23:10:19,724 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:19,724 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-03 23:10:19,724 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-03 23:10:19,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1738260692, now seen corresponding path program 4 times [2018-02-03 23:10:19,724 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:19,724 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:19,725 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:19,725 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:10:19,725 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:19,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:19,827 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-03 23:10:19,827 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:10:19,827 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:10:19,836 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-03 23:10:19,864 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-03 23:10:19,864 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:10:19,866 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:10:19,897 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-03 23:10:19,914 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:10:19,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 14 [2018-02-03 23:10:19,915 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-03 23:10:19,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-03 23:10:19,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-02-03 23:10:19,915 INFO L87 Difference]: Start difference. First operand 218 states and 262 transitions. Second operand 14 states. [2018-02-03 23:10:20,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:20,120 INFO L93 Difference]: Finished difference Result 239 states and 287 transitions. [2018-02-03 23:10:20,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-03 23:10:20,121 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-02-03 23:10:20,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:20,122 INFO L225 Difference]: With dead ends: 239 [2018-02-03 23:10:20,122 INFO L226 Difference]: Without dead ends: 233 [2018-02-03 23:10:20,123 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-03 23:10:20,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-03 23:10:20,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 219. [2018-02-03 23:10:20,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-03 23:10:20,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 264 transitions. [2018-02-03 23:10:20,129 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 264 transitions. Word has length 37 [2018-02-03 23:10:20,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:20,129 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 264 transitions. [2018-02-03 23:10:20,129 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-03 23:10:20,129 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 264 transitions. [2018-02-03 23:10:20,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-03 23:10:20,130 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:20,130 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-03 23:10:20,130 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-03 23:10:20,130 INFO L82 PathProgramCache]: Analyzing trace with hash -2008269922, now seen corresponding path program 5 times [2018-02-03 23:10:20,130 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:20,130 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:20,131 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:20,131 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:10:20,131 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:20,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:20,237 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-03 23:10:20,237 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:10:20,237 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:10:20,245 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-03 23:10:20,281 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-02-03 23:10:20,281 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:10:20,284 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:10:20,322 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-03 23:10:20,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:10:20,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 15 [2018-02-03 23:10:20,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-03 23:10:20,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-03 23:10:20,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-02-03 23:10:20,355 INFO L87 Difference]: Start difference. First operand 219 states and 264 transitions. Second operand 15 states. [2018-02-03 23:10:20,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:20,535 INFO L93 Difference]: Finished difference Result 242 states and 291 transitions. [2018-02-03 23:10:20,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-03 23:10:20,536 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2018-02-03 23:10:20,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:20,537 INFO L225 Difference]: With dead ends: 242 [2018-02-03 23:10:20,538 INFO L226 Difference]: Without dead ends: 236 [2018-02-03 23:10:20,538 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-03 23:10:20,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-02-03 23:10:20,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 220. [2018-02-03 23:10:20,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-03 23:10:20,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 266 transitions. [2018-02-03 23:10:20,544 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 266 transitions. Word has length 38 [2018-02-03 23:10:20,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:20,545 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 266 transitions. [2018-02-03 23:10:20,545 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-03 23:10:20,545 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 266 transitions. [2018-02-03 23:10:20,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-03 23:10:20,546 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:20,546 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-03 23:10:20,546 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-03 23:10:20,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1788621460, now seen corresponding path program 6 times [2018-02-03 23:10:20,546 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:20,546 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:20,547 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:20,547 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:10:20,547 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:20,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:20,656 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-03 23:10:20,657 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:10:20,657 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:10:20,661 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-03 23:10:20,805 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-02-03 23:10:20,805 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:10:20,807 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:10:20,876 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-03 23:10:20,908 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:10:20,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 16 [2018-02-03 23:10:20,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-03 23:10:20,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-03 23:10:20,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-02-03 23:10:20,910 INFO L87 Difference]: Start difference. First operand 220 states and 266 transitions. Second operand 16 states. [2018-02-03 23:10:21,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:21,175 INFO L93 Difference]: Finished difference Result 245 states and 295 transitions. [2018-02-03 23:10:21,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-03 23:10:21,175 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-02-03 23:10:21,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:21,176 INFO L225 Difference]: With dead ends: 245 [2018-02-03 23:10:21,176 INFO L226 Difference]: Without dead ends: 239 [2018-02-03 23:10:21,176 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-03 23:10:21,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-03 23:10:21,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 221. [2018-02-03 23:10:21,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-03 23:10:21,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 268 transitions. [2018-02-03 23:10:21,182 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 268 transitions. Word has length 39 [2018-02-03 23:10:21,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:21,182 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 268 transitions. [2018-02-03 23:10:21,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-03 23:10:21,182 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 268 transitions. [2018-02-03 23:10:21,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-03 23:10:21,182 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:21,183 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-03 23:10:21,183 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-03 23:10:21,183 INFO L82 PathProgramCache]: Analyzing trace with hash 725513566, now seen corresponding path program 7 times [2018-02-03 23:10:21,183 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:21,183 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:21,184 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:21,184 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:10:21,184 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:21,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:21,300 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-03 23:10:21,300 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:10:21,300 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:10:21,308 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:21,330 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:10:21,384 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-03 23:10:21,403 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:10:21,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 17 [2018-02-03 23:10:21,404 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-03 23:10:21,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-03 23:10:21,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-02-03 23:10:21,404 INFO L87 Difference]: Start difference. First operand 221 states and 268 transitions. Second operand 17 states. [2018-02-03 23:10:21,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:21,573 INFO L93 Difference]: Finished difference Result 248 states and 299 transitions. [2018-02-03 23:10:21,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-03 23:10:21,574 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-02-03 23:10:21,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:21,575 INFO L225 Difference]: With dead ends: 248 [2018-02-03 23:10:21,575 INFO L226 Difference]: Without dead ends: 242 [2018-02-03 23:10:21,575 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-03 23:10:21,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-03 23:10:21,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 222. [2018-02-03 23:10:21,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-03 23:10:21,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 270 transitions. [2018-02-03 23:10:21,580 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 270 transitions. Word has length 40 [2018-02-03 23:10:21,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:21,580 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 270 transitions. [2018-02-03 23:10:21,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-03 23:10:21,580 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 270 transitions. [2018-02-03 23:10:21,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-03 23:10:21,581 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:21,581 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-03 23:10:21,581 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-03 23:10:21,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1354288044, now seen corresponding path program 8 times [2018-02-03 23:10:21,581 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:21,581 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:21,582 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:21,582 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:21,582 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:21,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:21,821 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-03 23:10:21,821 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:10:21,821 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:10:21,827 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 23:10:21,858 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 23:10:21,858 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:10:21,864 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:10:21,882 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-03 23:10:21,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:21,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:21,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 23:10:21,907 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:21,908 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:21,910 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-03 23:10:21,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:21,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:21,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-02-03 23:10:21,940 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-03 23:10:21,942 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-03 23:10:21,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:21,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:21,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:21,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-02-03 23:10:22,001 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 18 treesize of output 14 [2018-02-03 23:10:22,003 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 14 treesize of output 10 [2018-02-03 23:10:22,004 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-03 23:10:22,008 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-03 23:10:22,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 23:10:22,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-02-03 23:10:22,116 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_3 Int) (v_DUPFFnew_~ans~0.base_BEFORE_CALL_1 Int)) (and (= (select |c_#valid| v_DUPFFnew_~ans~0.base_BEFORE_CALL_1) 1) (not (= v_arrayElimCell_3 v_DUPFFnew_~ans~0.base_BEFORE_CALL_1)) (= 1 (select |c_#valid| v_arrayElimCell_3)))) (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-03 23:10:22,221 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_3 Int) (v_DUPFFnew_~ans~0.base_BEFORE_CALL_1 Int)) (and (= (select |c_#valid| v_DUPFFnew_~ans~0.base_BEFORE_CALL_1) 1) (not (= v_arrayElimCell_3 v_DUPFFnew_~ans~0.base_BEFORE_CALL_1)) (= 1 (select |c_#valid| v_arrayElimCell_3)))) (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-03 23:10:22,538 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 82 treesize of output 76 [2018-02-03 23:10:22,541 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-03 23:10:22,544 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-03 23:10:22,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-03 23:10:22,561 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-03 23:10:22,589 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-03 23:10:22,628 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-03 23:10:22,669 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-03 23:10:22,700 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-03 23:10:22,700 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,713 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,723 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,733 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,750 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,760 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,769 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,778 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 1 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2018-02-03 23:10:22,808 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:104, output treesize:164 [2018-02-03 23:10:22,896 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 157 treesize of output 109 [2018-02-03 23:10:22,899 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:22,900 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-03 23:10:22,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2018-02-03 23:10:22,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:165, output treesize:150 [2018-02-03 23:10:22,934 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 161 treesize of output 113 [2018-02-03 23:10:22,937 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:22,938 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-03 23:10:22,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2018-02-03 23:10:22,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:169, output treesize:150 [2018-02-03 23:10:23,174 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 129 treesize of output 75 [2018-02-03 23:10:23,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-02-03 23:10:23,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:23,220 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-03 23:10:23,221 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:23,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:23,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:10:23,225 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 11 variables, input treesize:134, output treesize:15 [2018-02-03 23:10:23,262 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 15 times theorem prover too weak. 0 trivial. 15 not checked. [2018-02-03 23:10:23,280 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:10:23,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21] total 34 [2018-02-03 23:10:23,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-03 23:10:23,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-03 23:10:23,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=785, Unknown=179, NotChecked=126, Total=1190 [2018-02-03 23:10:23,281 INFO L87 Difference]: Start difference. First operand 222 states and 270 transitions. Second operand 35 states. [2018-02-03 23:10:30,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:30,629 INFO L93 Difference]: Finished difference Result 267 states and 328 transitions. [2018-02-03 23:10:30,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-03 23:10:30,629 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 41 [2018-02-03 23:10:30,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:30,630 INFO L225 Difference]: With dead ends: 267 [2018-02-03 23:10:30,630 INFO L226 Difference]: Without dead ends: 267 [2018-02-03 23:10:30,631 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=279, Invalid=2322, Unknown=377, NotChecked=214, Total=3192 [2018-02-03 23:10:30,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-02-03 23:10:30,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 221. [2018-02-03 23:10:30,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-03 23:10:30,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 269 transitions. [2018-02-03 23:10:30,637 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 269 transitions. Word has length 41 [2018-02-03 23:10:30,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:30,637 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 269 transitions. [2018-02-03 23:10:30,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-03 23:10:30,637 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 269 transitions. [2018-02-03 23:10:30,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-03 23:10:30,638 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:30,638 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-03 23:10:30,638 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-03 23:10:30,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1354288045, now seen corresponding path program 1 times [2018-02-03 23:10:30,638 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:30,638 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:30,639 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:30,639 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:10:30,639 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:30,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:31,111 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-03 23:10:31,112 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:10:31,112 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:10:31,117 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:31,136 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:10:31,163 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-03 23:10:31,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:31,171 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:31,171 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:31,172 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-03 23:10:31,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:31,177 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-03 23:10:31,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-02-03 23:10:31,202 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-03 23:10:31,203 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-03 23:10:31,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:31,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:31,213 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-03 23:10:31,215 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-03 23:10:31,215 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:31,216 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:31,223 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-03 23:10:31,223 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:38 [2018-02-03 23:10:31,272 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 9 treesize of output 7 [2018-02-03 23:10:31,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-03 23:10:31,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:31,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:31,279 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-03 23:10:31,281 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-03 23:10:31,282 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-03 23:10:31,286 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-03 23:10:31,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 23:10:31,290 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:41, output treesize:16 [2018-02-03 23:10:31,311 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_13 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_13))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_41| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_41|))) (and (= |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))) (= |c_#memory_$Pointer$.offset| (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)))))))) is different from true [2018-02-03 23:10:31,315 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_42| Int) (|v_#Ultimate.C_memset_#t~loopctr54_41| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_41|)) (.cse1 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_42|))) (and (= (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) .cse1 0)) |c_#memory_$Pointer$.base|) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse2 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse2) .cse1 .cse2))) |c_#memory_$Pointer$.offset|)))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_13 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_13)))) is different from true [2018-02-03 23:10:31,319 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_43| Int) (|v_#Ultimate.C_memset_#t~loopctr54_42| Int) (|v_#Ultimate.C_memset_#t~loopctr54_41| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_41|)) (.cse1 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_42|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_43|))) (and (= |c_#memory_$Pointer$.base| (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) .cse1 0) .cse2 0))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse3 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse3) .cse1 .cse3) .cse2 .cse3))))))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_13 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_13)))) is different from true [2018-02-03 23:10:31,330 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_44| Int) (|v_#Ultimate.C_memset_#t~loopctr54_43| Int) (|v_#Ultimate.C_memset_#t~loopctr54_42| Int) (|v_#Ultimate.C_memset_#t~loopctr54_41| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_41|)) (.cse1 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_42|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_43|)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_44|))) (and (= |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) .cse1 0) .cse2 0) .cse3 0))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse4 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse4) .cse1 .cse4) .cse2 .cse4) .cse3 .cse4))) |c_#memory_$Pointer$.offset|)))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_13 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_13)))) is different from true [2018-02-03 23:10:31,335 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_44| Int) (|v_#Ultimate.C_memset_#t~loopctr54_43| Int) (|v_#Ultimate.C_memset_#t~loopctr54_45| Int) (|v_#Ultimate.C_memset_#t~loopctr54_42| Int) (|v_#Ultimate.C_memset_#t~loopctr54_41| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_41|)) (.cse1 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_42|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_43|)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_44|)) (.cse4 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_45|))) (and (= (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$.base|) (= (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))) |c_#memory_$Pointer$.offset|)))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_13 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_13)))) is different from true [2018-02-03 23:10:31,343 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_44| Int) (|v_#Ultimate.C_memset_#t~loopctr54_43| Int) (|v_#Ultimate.C_memset_#t~loopctr54_46| Int) (|v_#Ultimate.C_memset_#t~loopctr54_45| Int) (|v_#Ultimate.C_memset_#t~loopctr54_42| Int) (|v_#Ultimate.C_memset_#t~loopctr54_41| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_41|)) (.cse1 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_42|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_43|)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_44|)) (.cse4 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_45|)) (.cse5 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_46|))) (and (= |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) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse6 (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 .cse6) .cse1 .cse6) .cse2 .cse6) .cse3 .cse6) .cse4 .cse6) .cse5 .cse6))))))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_13 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_13)))) is different from true [2018-02-03 23:10:31,351 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_47| Int) (|v_#Ultimate.C_memset_#t~loopctr54_44| Int) (|v_#Ultimate.C_memset_#t~loopctr54_43| Int) (|v_#Ultimate.C_memset_#t~loopctr54_46| Int) (|v_#Ultimate.C_memset_#t~loopctr54_45| Int) (|v_#Ultimate.C_memset_#t~loopctr54_42| Int) (|v_#Ultimate.C_memset_#t~loopctr54_41| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_41|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_42|)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_43|)) (.cse4 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_44|)) (.cse5 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_45|)) (.cse6 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_46|)) (.cse7 (+ |v_#Ultimate.C_memset_#t~loopctr54_47| |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 (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$.offset|) (= (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)) |c_#memory_$Pointer$.base|)))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_13 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_13)))) is different from true [2018-02-03 23:10:31,360 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_48| Int) (|v_#Ultimate.C_memset_#t~loopctr54_47| Int) (|#Ultimate.C_memset_#ptr.offset| Int) (|#Ultimate.C_memset_#value| Int) (|v_#Ultimate.C_memset_#t~loopctr54_44| Int) (|v_#Ultimate.C_memset_#t~loopctr54_43| Int) (|v_#Ultimate.C_memset_#t~loopctr54_46| Int) (|v_#Ultimate.C_memset_#t~loopctr54_45| Int) (|v_#Ultimate.C_memset_#t~loopctr54_42| Int) (|v_#Ultimate.C_memset_#t~loopctr54_41| Int)) (let ((.cse0 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_41|)) (.cse2 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_42|)) (.cse3 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_43|)) (.cse4 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_44|)) (.cse5 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_45|)) (.cse6 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_46|)) (.cse7 (+ |v_#Ultimate.C_memset_#t~loopctr54_47| |#Ultimate.C_memset_#ptr.offset|)) (.cse8 (+ |v_#Ultimate.C_memset_#t~loopctr54_48| |#Ultimate.C_memset_#ptr.offset|))) (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 (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|) (= (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)) |c_#memory_$Pointer$.base|)))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_13 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_13)))) is different from true [2018-02-03 23:10:31,403 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 162 treesize of output 156 [2018-02-03 23:10:31,408 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-03 23:10:31,418 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-03 23:10:31,431 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-03 23:10:31,455 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-03 23:10:31,489 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-03 23:10:31,541 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-03 23:10:31,617 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-03 23:10:31,720 INFO L303 Elim1Store]: Index analysis took 102 ms [2018-02-03 23:10:31,720 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-03 23:10:31,721 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:31,756 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:31,790 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:31,826 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:31,872 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:31,918 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:31,960 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:31,997 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,126 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 86 treesize of output 87 [2018-02-03 23:10:32,129 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 67 treesize of output 70 [2018-02-03 23:10:32,132 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 70 treesize of output 72 [2018-02-03 23:10:32,138 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 72 treesize of output 74 [2018-02-03 23:10:32,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 74 treesize of output 76 [2018-02-03 23:10:32,160 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 76 treesize of output 78 [2018-02-03 23:10:32,177 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 78 treesize of output 80 [2018-02-03 23:10:32,198 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 80 treesize of output 82 [2018-02-03 23:10:32,226 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 82 treesize of output 137 [2018-02-03 23:10:32,226 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,241 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,258 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,273 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,289 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,304 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,320 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,335 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,353 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 2 dim-2 vars, End of recursive call: 13 dim-0 vars, and 1 xjuncts. [2018-02-03 23:10:32,404 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 15 variables, input treesize:183, output treesize:303 [2018-02-03 23:10:32,487 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 297 treesize of output 233 [2018-02-03 23:10:32,491 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:32,492 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 258 treesize of output 288 [2018-02-03 23:10:32,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,579 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 161 treesize of output 166 [2018-02-03 23:10:32,582 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:32,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-03 23:10:32,584 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,603 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,642 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-03 23:10:32,642 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 13 variables, input treesize:324, output treesize:294 [2018-02-03 23:10:32,654 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 165 treesize of output 170 [2018-02-03 23:10:32,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:32,659 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-03 23:10:32,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,728 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 301 treesize of output 237 [2018-02-03 23:10:32,732 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:32,734 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 262 treesize of output 290 [2018-02-03 23:10:32,734 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,778 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,817 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-03 23:10:32,818 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 13 variables, input treesize:332, output treesize:294 [2018-02-03 23:10:33,047 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 291 treesize of output 205 [2018-02-03 23:10:33,076 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-03 23:10:33,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:33,099 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 149 treesize of output 102 [2018-02-03 23:10:33,099 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:33,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:33,143 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 107 treesize of output 91 [2018-02-03 23:10:33,168 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 73 treesize of output 1 [2018-02-03 23:10:33,169 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:33,172 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-03 23:10:33,172 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:33,173 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:33,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:10:33,177 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 15 variables, input treesize:312, output treesize:16 [2018-02-03 23:10:33,212 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-03 23:10:33,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:10:33,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 35 [2018-02-03 23:10:33,230 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-03 23:10:33,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-03 23:10:33,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=687, Unknown=8, NotChecked=472, Total=1260 [2018-02-03 23:10:33,231 INFO L87 Difference]: Start difference. First operand 221 states and 269 transitions. Second operand 36 states. [2018-02-03 23:10:33,991 WARN L146 SmtUtils]: Spent 323ms on a formula simplification. DAG size of input: 61 DAG size of output 51 [2018-02-03 23:10:40,052 WARN L146 SmtUtils]: Spent 220ms on a formula simplification. DAG size of input: 121 DAG size of output 111 [2018-02-03 23:10:40,290 WARN L146 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 182 DAG size of output 165 [2018-02-03 23:10:44,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:44,205 INFO L93 Difference]: Finished difference Result 251 states and 309 transitions. [2018-02-03 23:10:44,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-03 23:10:44,205 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 41 [2018-02-03 23:10:44,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:44,208 INFO L225 Difference]: With dead ends: 251 [2018-02-03 23:10:44,208 INFO L226 Difference]: Without dead ends: 251 [2018-02-03 23:10:44,208 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=378, Invalid=2811, Unknown=149, NotChecked=952, Total=4290 [2018-02-03 23:10:44,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-03 23:10:44,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 220. [2018-02-03 23:10:44,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-03 23:10:44,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 268 transitions. [2018-02-03 23:10:44,213 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 268 transitions. Word has length 41 [2018-02-03 23:10:44,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:44,213 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 268 transitions. [2018-02-03 23:10:44,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-03 23:10:44,213 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 268 transitions. [2018-02-03 23:10:44,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-03 23:10:44,213 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:44,213 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-03 23:10:44,213 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-03 23:10:44,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1158116567, now seen corresponding path program 1 times [2018-02-03 23:10:44,214 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:44,214 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:44,214 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:44,214 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:44,214 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:44,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:44,256 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-03 23:10:44,256 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:44,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 23:10:44,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 23:10:44,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 23:10:44,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 23:10:44,257 INFO L87 Difference]: Start difference. First operand 220 states and 268 transitions. Second operand 6 states. [2018-02-03 23:10:44,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:44,395 INFO L93 Difference]: Finished difference Result 218 states and 266 transitions. [2018-02-03 23:10:44,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 23:10:44,396 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-02-03 23:10:44,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:44,396 INFO L225 Difference]: With dead ends: 218 [2018-02-03 23:10:44,396 INFO L226 Difference]: Without dead ends: 218 [2018-02-03 23:10:44,396 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-03 23:10:44,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-03 23:10:44,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-02-03 23:10:44,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-03 23:10:44,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 266 transitions. [2018-02-03 23:10:44,399 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 266 transitions. Word has length 74 [2018-02-03 23:10:44,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:44,400 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 266 transitions. [2018-02-03 23:10:44,400 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 23:10:44,400 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 266 transitions. [2018-02-03 23:10:44,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-03 23:10:44,400 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:44,400 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-03 23:10:44,400 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-03 23:10:44,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1158116568, now seen corresponding path program 1 times [2018-02-03 23:10:44,400 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:44,400 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:44,401 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:44,401 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:44,401 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:44,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:44,496 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-03 23:10:44,496 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:44,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 23:10:44,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 23:10:44,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 23:10:44,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-03 23:10:44,497 INFO L87 Difference]: Start difference. First operand 218 states and 266 transitions. Second operand 8 states. [2018-02-03 23:10:44,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:44,650 INFO L93 Difference]: Finished difference Result 216 states and 264 transitions. [2018-02-03 23:10:44,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 23:10:44,650 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 74 [2018-02-03 23:10:44,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:44,651 INFO L225 Difference]: With dead ends: 216 [2018-02-03 23:10:44,652 INFO L226 Difference]: Without dead ends: 216 [2018-02-03 23:10:44,652 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-03 23:10:44,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-03 23:10:44,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-02-03 23:10:44,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-03 23:10:44,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 264 transitions. [2018-02-03 23:10:44,657 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 264 transitions. Word has length 74 [2018-02-03 23:10:44,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:44,657 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 264 transitions. [2018-02-03 23:10:44,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 23:10:44,657 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 264 transitions. [2018-02-03 23:10:44,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-03 23:10:44,658 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:44,658 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-03 23:10:44,658 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-03 23:10:44,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1541875248, now seen corresponding path program 1 times [2018-02-03 23:10:44,658 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:44,659 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:44,659 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:44,659 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:44,659 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:44,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:44,786 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-03 23:10:44,787 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:10:44,787 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:10:44,793 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:44,830 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:10:44,842 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-03 23:10:44,860 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:10:44,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-02-03 23:10:44,860 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-03 23:10:44,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-03 23:10:44,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-02-03 23:10:44,860 INFO L87 Difference]: Start difference. First operand 216 states and 264 transitions. Second operand 15 states. [2018-02-03 23:10:45,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:45,028 INFO L93 Difference]: Finished difference Result 254 states and 317 transitions. [2018-02-03 23:10:45,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-03 23:10:45,029 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 75 [2018-02-03 23:10:45,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:45,029 INFO L225 Difference]: With dead ends: 254 [2018-02-03 23:10:45,030 INFO L226 Difference]: Without dead ends: 248 [2018-02-03 23:10:45,030 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-03 23:10:45,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-03 23:10:45,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 228. [2018-02-03 23:10:45,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-03 23:10:45,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 281 transitions. [2018-02-03 23:10:45,033 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 281 transitions. Word has length 75 [2018-02-03 23:10:45,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:45,033 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 281 transitions. [2018-02-03 23:10:45,033 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-03 23:10:45,034 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 281 transitions. [2018-02-03 23:10:45,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-03 23:10:45,034 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:45,034 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-03 23:10:45,034 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-03 23:10:45,034 INFO L82 PathProgramCache]: Analyzing trace with hash 889551470, now seen corresponding path program 2 times [2018-02-03 23:10:45,034 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:45,034 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:45,035 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:45,035 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:45,035 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:45,050 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:45,169 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-03 23:10:45,169 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:10:45,169 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:10:45,180 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 23:10:45,239 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 23:10:45,239 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:10:45,241 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:10:45,266 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-03 23:10:45,283 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:10:45,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-02-03 23:10:45,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-03 23:10:45,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-03 23:10:45,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-02-03 23:10:45,284 INFO L87 Difference]: Start difference. First operand 228 states and 281 transitions. Second operand 16 states. [2018-02-03 23:10:45,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:45,432 INFO L93 Difference]: Finished difference Result 257 states and 322 transitions. [2018-02-03 23:10:45,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-03 23:10:45,432 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 76 [2018-02-03 23:10:45,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:45,433 INFO L225 Difference]: With dead ends: 257 [2018-02-03 23:10:45,433 INFO L226 Difference]: Without dead ends: 251 [2018-02-03 23:10:45,433 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-03 23:10:45,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-03 23:10:45,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 231. [2018-02-03 23:10:45,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-03 23:10:45,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 286 transitions. [2018-02-03 23:10:45,437 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 286 transitions. Word has length 76 [2018-02-03 23:10:45,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:45,437 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 286 transitions. [2018-02-03 23:10:45,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-03 23:10:45,437 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 286 transitions. [2018-02-03 23:10:45,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-03 23:10:45,437 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:45,437 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-03 23:10:45,437 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-03 23:10:45,437 INFO L82 PathProgramCache]: Analyzing trace with hash 2142350832, now seen corresponding path program 3 times [2018-02-03 23:10:45,437 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:45,438 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:45,438 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:45,438 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:10:45,438 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:45,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:45,706 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-03 23:10:45,706 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:10:45,706 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:10:45,712 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-03 23:11:00,457 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-02-03 23:11:00,457 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:11:00,463 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:11:00,491 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-03 23:11:00,513 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:11:00,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-02-03 23:11:00,514 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-03 23:11:00,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-03 23:11:00,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2018-02-03 23:11:00,514 INFO L87 Difference]: Start difference. First operand 231 states and 286 transitions. Second operand 17 states. [2018-02-03 23:11:00,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:11:00,647 INFO L93 Difference]: Finished difference Result 260 states and 327 transitions. [2018-02-03 23:11:00,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-03 23:11:00,647 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 77 [2018-02-03 23:11:00,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:11:00,648 INFO L225 Difference]: With dead ends: 260 [2018-02-03 23:11:00,648 INFO L226 Difference]: Without dead ends: 254 [2018-02-03 23:11:00,648 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-03 23:11:00,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-02-03 23:11:00,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 232. [2018-02-03 23:11:00,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-02-03 23:11:00,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 288 transitions. [2018-02-03 23:11:00,652 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 288 transitions. Word has length 77 [2018-02-03 23:11:00,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:11:00,652 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 288 transitions. [2018-02-03 23:11:00,652 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-03 23:11:00,652 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 288 transitions. [2018-02-03 23:11:00,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-03 23:11:00,653 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:11:00,653 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-03 23:11:00,653 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-03 23:11:00,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1970541906, now seen corresponding path program 4 times [2018-02-03 23:11:00,653 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:11:00,653 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:11:00,654 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:11:00,654 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:11:00,654 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:11:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:11:00,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:11:00,795 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-03 23:11:00,795 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:11:00,795 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:11:00,800 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-03 23:11:00,862 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-03 23:11:00,862 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:11:00,864 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:11:00,885 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-03 23:11:00,904 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:11:00,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-02-03 23:11:00,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-03 23:11:00,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-03 23:11:00,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2018-02-03 23:11:00,905 INFO L87 Difference]: Start difference. First operand 232 states and 288 transitions. Second operand 18 states. [2018-02-03 23:11:01,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:11:01,100 INFO L93 Difference]: Finished difference Result 263 states and 332 transitions. [2018-02-03 23:11:01,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-03 23:11:01,100 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2018-02-03 23:11:01,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:11:01,101 INFO L225 Difference]: With dead ends: 263 [2018-02-03 23:11:01,101 INFO L226 Difference]: Without dead ends: 257 [2018-02-03 23:11:01,102 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=296, Invalid=634, Unknown=0, NotChecked=0, Total=930 [2018-02-03 23:11:01,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-03 23:11:01,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 233. [2018-02-03 23:11:01,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-02-03 23:11:01,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 290 transitions. [2018-02-03 23:11:01,108 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 290 transitions. Word has length 78 [2018-02-03 23:11:01,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:11:01,108 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 290 transitions. [2018-02-03 23:11:01,108 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-03 23:11:01,108 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 290 transitions. [2018-02-03 23:11:01,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-03 23:11:01,109 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:11:01,109 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-03 23:11:01,109 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-03 23:11:01,109 INFO L82 PathProgramCache]: Analyzing trace with hash -621197904, now seen corresponding path program 5 times [2018-02-03 23:11:01,109 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:11:01,110 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:11:01,110 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:11:01,110 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:11:01,110 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:11:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:11:01,152 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:11:01,597 WARN L146 SmtUtils]: Spent 270ms on a formula simplification. DAG size of input: 12 DAG size of output 10 [2018-02-03 23:11:02,088 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 125 proven. 82 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-02-03 23:11:02,088 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:11:02,088 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:11:02,093 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-03 23:11:12,526 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-02-03 23:11:12,526 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:11:12,533 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:11:12,536 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-03 23:11:12,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:11:12,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:12,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-03 23:11:12,576 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:11:12,577 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:11:12,577 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-03 23:11:12,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:11:12,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:12,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-02-03 23:11:12,599 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-03 23:11:12,600 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-03 23:11:12,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:11:12,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:12,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:12,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-02-03 23:11:12,648 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-03 23:11:12,649 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-03 23:11:12,649 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-03 23:11:12,651 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-03 23:11:12,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 23:11:12,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:18 [2018-02-03 23:11:12,679 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_DUPFFnew_~ans~0.base_BEFORE_CALL_3 Int) (v_arrayElimCell_26 Int)) (and (= 1 (select |c_#valid| v_arrayElimCell_26)) (not (= v_arrayElimCell_26 v_DUPFFnew_~ans~0.base_BEFORE_CALL_3)) (= (select |c_#valid| v_DUPFFnew_~ans~0.base_BEFORE_CALL_3) 1))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_87| 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_87|) 0))))) is different from true [2018-02-03 23:11:12,682 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_DUPFFnew_~ans~0.base_BEFORE_CALL_3 Int) (v_arrayElimCell_26 Int)) (and (= 1 (select |c_#valid| v_arrayElimCell_26)) (not (= v_arrayElimCell_26 v_DUPFFnew_~ans~0.base_BEFORE_CALL_3)) (= (select |c_#valid| v_DUPFFnew_~ans~0.base_BEFORE_CALL_3) 1))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_88| Int) (|v_#Ultimate.C_memset_#t~loopctr54_87| Int)) (= |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|) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_87|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_88|) 0))))) is different from true [2018-02-03 23:11:12,685 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_DUPFFnew_~ans~0.base_BEFORE_CALL_3 Int) (v_arrayElimCell_26 Int)) (and (= 1 (select |c_#valid| v_arrayElimCell_26)) (not (= v_arrayElimCell_26 v_DUPFFnew_~ans~0.base_BEFORE_CALL_3)) (= (select |c_#valid| v_DUPFFnew_~ans~0.base_BEFORE_CALL_3) 1))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_88| Int) (|v_#Ultimate.C_memset_#t~loopctr54_87| Int) (|v_#Ultimate.C_memset_#t~loopctr54_89| 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_87|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_88|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_89|) 0)) |c_#memory_$Pointer$.base|))) is different from true [2018-02-03 23:11:12,688 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_DUPFFnew_~ans~0.base_BEFORE_CALL_3 Int) (v_arrayElimCell_26 Int)) (and (= 1 (select |c_#valid| v_arrayElimCell_26)) (not (= v_arrayElimCell_26 v_DUPFFnew_~ans~0.base_BEFORE_CALL_3)) (= (select |c_#valid| v_DUPFFnew_~ans~0.base_BEFORE_CALL_3) 1))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_90| Int) (|v_#Ultimate.C_memset_#t~loopctr54_88| Int) (|v_#Ultimate.C_memset_#t~loopctr54_87| Int) (|v_#Ultimate.C_memset_#t~loopctr54_89| 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_87|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_88|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_89|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_90| |c_#Ultimate.C_memset_#ptr.offset|) 0))))) is different from true [2018-02-03 23:11:12,691 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_DUPFFnew_~ans~0.base_BEFORE_CALL_3 Int) (v_arrayElimCell_26 Int)) (and (= 1 (select |c_#valid| v_arrayElimCell_26)) (not (= v_arrayElimCell_26 v_DUPFFnew_~ans~0.base_BEFORE_CALL_3)) (= (select |c_#valid| v_DUPFFnew_~ans~0.base_BEFORE_CALL_3) 1))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_91| Int) (|v_#Ultimate.C_memset_#t~loopctr54_90| Int) (|v_#Ultimate.C_memset_#t~loopctr54_88| Int) (|v_#Ultimate.C_memset_#t~loopctr54_87| Int) (|v_#Ultimate.C_memset_#t~loopctr54_89| 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_87|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_88|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_89|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_90| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_91| |c_#Ultimate.C_memset_#ptr.offset|) 0)) |c_#memory_$Pointer$.base|))) is different from true [2018-02-03 23:11:12,695 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_DUPFFnew_~ans~0.base_BEFORE_CALL_3 Int) (v_arrayElimCell_26 Int)) (and (= 1 (select |c_#valid| v_arrayElimCell_26)) (not (= v_arrayElimCell_26 v_DUPFFnew_~ans~0.base_BEFORE_CALL_3)) (= (select |c_#valid| v_DUPFFnew_~ans~0.base_BEFORE_CALL_3) 1))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_91| Int) (|v_#Ultimate.C_memset_#t~loopctr54_90| Int) (|v_#Ultimate.C_memset_#t~loopctr54_92| Int) (|v_#Ultimate.C_memset_#t~loopctr54_88| Int) (|v_#Ultimate.C_memset_#t~loopctr54_87| Int) (|v_#Ultimate.C_memset_#t~loopctr54_89| 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_87|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_88|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_89|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_90| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_91| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_92| |c_#Ultimate.C_memset_#ptr.offset|) 0))))) is different from true [2018-02-03 23:11:12,700 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_DUPFFnew_~ans~0.base_BEFORE_CALL_3 Int) (v_arrayElimCell_26 Int)) (and (= 1 (select |c_#valid| v_arrayElimCell_26)) (not (= v_arrayElimCell_26 v_DUPFFnew_~ans~0.base_BEFORE_CALL_3)) (= (select |c_#valid| v_DUPFFnew_~ans~0.base_BEFORE_CALL_3) 1))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_91| Int) (|v_#Ultimate.C_memset_#t~loopctr54_90| Int) (|v_#Ultimate.C_memset_#t~loopctr54_93| Int) (|v_#Ultimate.C_memset_#t~loopctr54_92| Int) (|v_#Ultimate.C_memset_#t~loopctr54_88| Int) (|v_#Ultimate.C_memset_#t~loopctr54_87| Int) (|v_#Ultimate.C_memset_#t~loopctr54_89| Int)) (= (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_87|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_88|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_89|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_90| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_91| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_92| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_93| |c_#Ultimate.C_memset_#ptr.offset|) 0)) |c_#memory_$Pointer$.base|))) is different from true [2018-02-03 23:11:12,705 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_DUPFFnew_~ans~0.base_BEFORE_CALL_3 Int) (v_arrayElimCell_26 Int)) (and (= 1 (select |c_#valid| v_arrayElimCell_26)) (not (= v_arrayElimCell_26 v_DUPFFnew_~ans~0.base_BEFORE_CALL_3)) (= (select |c_#valid| v_DUPFFnew_~ans~0.base_BEFORE_CALL_3) 1))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_91| Int) (|v_#Ultimate.C_memset_#t~loopctr54_90| Int) (|v_#Ultimate.C_memset_#t~loopctr54_93| Int) (|v_#Ultimate.C_memset_#t~loopctr54_92| Int) (|v_#Ultimate.C_memset_#t~loopctr54_88| Int) (|v_#Ultimate.C_memset_#t~loopctr54_87| Int) (|v_#Ultimate.C_memset_#t~loopctr54_89| Int) (|v_#Ultimate.C_memset_#t~loopctr54_94| 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|) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_87|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_88|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_89|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_90| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_91| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_92| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_93| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_94|) 0)) |c_#memory_$Pointer$.base|))) is different from true [2018-02-03 23:11:12,712 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_DUPFFnew_~ans~0.base_BEFORE_CALL_3 Int) (v_arrayElimCell_26 Int)) (and (= 1 (select |c_#valid| v_arrayElimCell_26)) (not (= v_arrayElimCell_26 v_DUPFFnew_~ans~0.base_BEFORE_CALL_3)) (= (select |c_#valid| v_DUPFFnew_~ans~0.base_BEFORE_CALL_3) 1))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_91| Int) (|v_#Ultimate.C_memset_#t~loopctr54_90| Int) (|v_#Ultimate.C_memset_#t~loopctr54_93| Int) (|v_#Ultimate.C_memset_#t~loopctr54_92| Int) (|v_#Ultimate.C_memset_#t~loopctr54_88| Int) (|v_#Ultimate.C_memset_#t~loopctr54_87| Int) (|v_#Ultimate.C_memset_#t~loopctr54_89| Int) (|v_#Ultimate.C_memset_#t~loopctr54_95| Int) (|v_#Ultimate.C_memset_#t~loopctr54_94| Int)) (= |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 (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_87|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_88|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_89|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_90| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_91| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_92| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_93| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_94|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_95|) 0))))) is different from true [2018-02-03 23:11:12,718 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_DUPFFnew_~ans~0.base_BEFORE_CALL_3 Int) (v_arrayElimCell_26 Int)) (and (= 1 (select |c_#valid| v_arrayElimCell_26)) (not (= v_arrayElimCell_26 v_DUPFFnew_~ans~0.base_BEFORE_CALL_3)) (= (select |c_#valid| v_DUPFFnew_~ans~0.base_BEFORE_CALL_3) 1))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_91| Int) (|v_#Ultimate.C_memset_#t~loopctr54_90| Int) (|v_#Ultimate.C_memset_#t~loopctr54_93| Int) (|v_#Ultimate.C_memset_#t~loopctr54_92| Int) (|v_#Ultimate.C_memset_#t~loopctr54_88| Int) (|v_#Ultimate.C_memset_#t~loopctr54_87| Int) (|v_#Ultimate.C_memset_#t~loopctr54_89| Int) (|v_#Ultimate.C_memset_#t~loopctr54_95| Int) (|v_#Ultimate.C_memset_#t~loopctr54_94| Int) (|v_#Ultimate.C_memset_#t~loopctr54_96| Int)) (= |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 (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_87|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_88|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_89|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_90| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_91| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_92| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_93| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_94|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_95|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_96|) 0))))) is different from true [2018-02-03 23:11:12,726 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_DUPFFnew_~ans~0.base_BEFORE_CALL_3 Int) (v_arrayElimCell_26 Int)) (and (= 1 (select |c_#valid| v_arrayElimCell_26)) (not (= v_arrayElimCell_26 v_DUPFFnew_~ans~0.base_BEFORE_CALL_3)) (= (select |c_#valid| v_DUPFFnew_~ans~0.base_BEFORE_CALL_3) 1))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_91| Int) (|v_#Ultimate.C_memset_#t~loopctr54_90| Int) (|v_#Ultimate.C_memset_#t~loopctr54_93| Int) (|v_#Ultimate.C_memset_#t~loopctr54_92| Int) (|v_#Ultimate.C_memset_#t~loopctr54_88| Int) (|v_#Ultimate.C_memset_#t~loopctr54_87| Int) (|v_#Ultimate.C_memset_#t~loopctr54_89| Int) (|v_#Ultimate.C_memset_#t~loopctr54_95| Int) (|v_#Ultimate.C_memset_#t~loopctr54_94| Int) (|v_#Ultimate.C_memset_#t~loopctr54_97| Int) (|v_#Ultimate.C_memset_#t~loopctr54_96| Int)) (= |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|) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_87|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_88|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_89|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_90| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_91| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_92| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_93| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_94|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_95|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_96|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_97|) 0))))) is different from true [2018-02-03 23:11:12,739 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_DUPFFnew_~ans~0.base_BEFORE_CALL_3 Int) (v_arrayElimCell_26 Int)) (and (= 1 (select |c_#valid| v_arrayElimCell_26)) (not (= v_arrayElimCell_26 v_DUPFFnew_~ans~0.base_BEFORE_CALL_3)) (= (select |c_#valid| v_DUPFFnew_~ans~0.base_BEFORE_CALL_3) 1))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_91| Int) (|v_#Ultimate.C_memset_#t~loopctr54_90| Int) (|v_#Ultimate.C_memset_#t~loopctr54_93| Int) (|v_#Ultimate.C_memset_#t~loopctr54_92| Int) (|v_#Ultimate.C_memset_#t~loopctr54_88| Int) (|v_#Ultimate.C_memset_#t~loopctr54_87| Int) (|v_#Ultimate.C_memset_#t~loopctr54_98| Int) (|v_#Ultimate.C_memset_#t~loopctr54_89| Int) (|v_#Ultimate.C_memset_#t~loopctr54_95| Int) (|v_#Ultimate.C_memset_#t~loopctr54_94| Int) (|v_#Ultimate.C_memset_#t~loopctr54_97| Int) (|v_#Ultimate.C_memset_#t~loopctr54_96| Int) (|#Ultimate.C_memset_#ptr.offset| Int)) (= (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|) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_87|) 0) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_88|) 0) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_89|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_90| |#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_91| |#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_92| |#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_93| |#Ultimate.C_memset_#ptr.offset|) 0) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_94|) 0) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_95|) 0) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_96|) 0) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_97|) 0) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_98|) 0)) |c_#memory_$Pointer$.base|))) is different from true [2018-02-03 23:11:12,802 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 102 treesize of output 96 [2018-02-03 23:11:12,805 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-03 23:11:12,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2018-02-03 23:11:12,815 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-03 23:11:12,824 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-03 23:11:12,838 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-03 23:11:12,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 82 treesize of output 84 [2018-02-03 23:11:12,883 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-03 23:11:12,910 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-03 23:11:12,945 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-03 23:11:12,985 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-03 23:11:13,032 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-03 23:11:13,155 INFO L303 Elim1Store]: Index analysis took 122 ms [2018-02-03 23:11:13,156 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-03 23:11:13,156 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-03 23:11:13,176 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:13,194 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:13,216 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:13,244 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:13,267 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:13,318 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:13,341 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:13,374 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:13,393 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:13,412 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:13,431 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:13,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:13,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 1 dim-2 vars, End of recursive call: 15 dim-0 vars, and 1 xjuncts. [2018-02-03 23:11:13,482 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 16 variables, input treesize:121, output treesize:221 [2018-02-03 23:11:13,568 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 217 treesize of output 145 [2018-02-03 23:11:13,571 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:11:13,573 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 186 treesize of output 208 [2018-02-03 23:11:13,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:11:13,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:13,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 1 dim-2 vars, End of recursive call: 13 dim-0 vars, and 1 xjuncts. [2018-02-03 23:11:13,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 14 variables, input treesize:222, output treesize:207 [2018-02-03 23:11:13,645 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 221 treesize of output 149 [2018-02-03 23:11:13,649 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:11:13,651 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 190 treesize of output 210 [2018-02-03 23:11:13,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:11:13,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:13,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 1 dim-2 vars, End of recursive call: 13 dim-0 vars, and 1 xjuncts. [2018-02-03 23:11:13,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 14 variables, input treesize:226, output treesize:207 [2018-02-03 23:11:13,951 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 211 treesize of output 109 [2018-02-03 23:11:14,037 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-03 23:11:14,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:11:14,043 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-03 23:11:14,044 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:11:14,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:14,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:11:14,051 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:216, output treesize:15 [2018-02-03 23:11:14,126 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 78 not checked. [2018-02-03 23:11:14,156 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:11:14,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24] total 50 [2018-02-03 23:11:14,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-03 23:11:14,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-03 23:11:14,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1384, Unknown=12, NotChecked=1020, Total=2550 [2018-02-03 23:11:14,157 INFO L87 Difference]: Start difference. First operand 233 states and 290 transitions. Second operand 51 states. [2018-02-03 23:11:22,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:11:22,448 INFO L93 Difference]: Finished difference Result 280 states and 354 transitions. [2018-02-03 23:11:22,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-03 23:11:22,448 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 79 [2018-02-03 23:11:22,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:11:22,449 INFO L225 Difference]: With dead ends: 280 [2018-02-03 23:11:22,449 INFO L226 Difference]: Without dead ends: 280 [2018-02-03 23:11:22,450 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=415, Invalid=4249, Unknown=76, NotChecked=1740, Total=6480 [2018-02-03 23:11:22,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-02-03 23:11:22,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 241. [2018-02-03 23:11:22,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-02-03 23:11:22,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 301 transitions. [2018-02-03 23:11:22,453 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 301 transitions. Word has length 79 [2018-02-03 23:11:22,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:11:22,454 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 301 transitions. [2018-02-03 23:11:22,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-03 23:11:22,454 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 301 transitions. [2018-02-03 23:11:22,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-03 23:11:22,454 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:11:22,454 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-03 23:11:22,454 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-03 23:11:22,455 INFO L82 PathProgramCache]: Analyzing trace with hash -621197903, now seen corresponding path program 1 times [2018-02-03 23:11:22,455 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:11:22,455 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:11:22,455 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:11:22,455 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:11:22,455 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:11:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:11:22,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:11:23,080 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 133 proven. 14 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-02-03 23:11:23,081 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:11:23,081 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:11:23,085 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:11:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:11:23,156 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:11:23,210 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-03 23:11:23,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:11:23,227 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:11:23,233 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:11:23,234 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-03 23:11:23,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:11:23,250 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-03 23:11:23,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-02-03 23:11:23,289 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-03 23:11:23,291 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-03 23:11:23,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:11:23,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:23,302 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-03 23:11:23,311 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-03 23:11:23,312 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:11:23,313 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:23,319 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-03 23:11:23,319 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:38 [2018-02-03 23:11:23,392 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-03 23:11:23,394 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-03 23:11:23,394 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-03 23:11:23,397 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-03 23:11:23,406 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 9 treesize of output 7 [2018-02-03 23:11:23,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-03 23:11:23,408 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:11:23,408 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:23,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 23:11:23,413 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:41, output treesize:16 [2018-02-03 23:11:23,436 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_99| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_99|))) (and (= |c_#memory_$Pointer$.offset| (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$.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 ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_35 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_35)))) is different from true [2018-02-03 23:11:23,441 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_35 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_35))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_100| Int) (|v_#Ultimate.C_memset_#t~loopctr54_99| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_99|)) (.cse2 (+ |v_#Ultimate.C_memset_#t~loopctr54_100| |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 (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-03 23:11:23,448 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_100| Int) (|v_#Ultimate.C_memset_#t~loopctr54_101| Int) (|v_#Ultimate.C_memset_#t~loopctr54_99| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_99|)) (.cse2 (+ |v_#Ultimate.C_memset_#t~loopctr54_100| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_101|))) (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|) (= |c_#memory_$Pointer$.base| (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)))))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_35 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_35)))) is different from true [2018-02-03 23:11:23,456 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_102| Int) (|v_#Ultimate.C_memset_#t~loopctr54_100| Int) (|v_#Ultimate.C_memset_#t~loopctr54_101| Int) (|v_#Ultimate.C_memset_#t~loopctr54_99| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_99|)) (.cse1 (+ |v_#Ultimate.C_memset_#t~loopctr54_100| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_101|)) (.cse3 (+ |v_#Ultimate.C_memset_#t~loopctr54_102| |c_#Ultimate.C_memset_#ptr.offset|))) (and (= |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) .cse1 0) .cse2 0) .cse3 0))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse4 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse4) .cse1 .cse4) .cse2 .cse4) .cse3 .cse4))) |c_#memory_$Pointer$.offset|)))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_35 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_35)))) is different from true [2018-02-03 23:11:23,461 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_35 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_35))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_102| Int) (|v_#Ultimate.C_memset_#t~loopctr54_103| Int) (|v_#Ultimate.C_memset_#t~loopctr54_100| Int) (|v_#Ultimate.C_memset_#t~loopctr54_101| Int) (|v_#Ultimate.C_memset_#t~loopctr54_99| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_99|)) (.cse1 (+ |v_#Ultimate.C_memset_#t~loopctr54_100| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_101|)) (.cse3 (+ |v_#Ultimate.C_memset_#t~loopctr54_102| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse4 (+ |v_#Ultimate.C_memset_#t~loopctr54_103| |c_#Ultimate.C_memset_#ptr.offset|))) (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)))))))) is different from true [2018-02-03 23:11:23,467 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_102| Int) (|v_#Ultimate.C_memset_#t~loopctr54_103| Int) (|v_#Ultimate.C_memset_#t~loopctr54_100| Int) (|v_#Ultimate.C_memset_#t~loopctr54_101| Int) (|v_#Ultimate.C_memset_#t~loopctr54_99| Int) (|v_#Ultimate.C_memset_#t~loopctr54_104| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_99|)) (.cse2 (+ |v_#Ultimate.C_memset_#t~loopctr54_100| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_101|)) (.cse4 (+ |v_#Ultimate.C_memset_#t~loopctr54_102| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse5 (+ |v_#Ultimate.C_memset_#t~loopctr54_103| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse6 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_104|))) (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 ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_35 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_35)))) is different from true [2018-02-03 23:11:23,474 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_35 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_35))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_102| Int) (|v_#Ultimate.C_memset_#t~loopctr54_103| Int) (|v_#Ultimate.C_memset_#t~loopctr54_100| Int) (|v_#Ultimate.C_memset_#t~loopctr54_101| Int) (|v_#Ultimate.C_memset_#t~loopctr54_99| Int) (|v_#Ultimate.C_memset_#t~loopctr54_104| Int) (|v_#Ultimate.C_memset_#t~loopctr54_105| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_99|)) (.cse1 (+ |v_#Ultimate.C_memset_#t~loopctr54_100| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_101|)) (.cse3 (+ |v_#Ultimate.C_memset_#t~loopctr54_102| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse4 (+ |v_#Ultimate.C_memset_#t~loopctr54_103| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse5 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_104|)) (.cse6 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_105|))) (and (= (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) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0) .cse6 0)) |c_#memory_$Pointer$.base|) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse7 (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 .cse7) .cse1 .cse7) .cse2 .cse7) .cse3 .cse7) .cse4 .cse7) .cse5 .cse7) .cse6 .cse7))) |c_#memory_$Pointer$.offset|))))) is different from true [2018-02-03 23:11:23,482 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_102| Int) (|v_#Ultimate.C_memset_#t~loopctr54_103| Int) (|v_#Ultimate.C_memset_#t~loopctr54_100| Int) (|v_#Ultimate.C_memset_#t~loopctr54_101| Int) (|v_#Ultimate.C_memset_#t~loopctr54_99| Int) (|v_#Ultimate.C_memset_#t~loopctr54_106| Int) (|v_#Ultimate.C_memset_#t~loopctr54_104| Int) (|v_#Ultimate.C_memset_#t~loopctr54_105| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_99|)) (.cse1 (+ |v_#Ultimate.C_memset_#t~loopctr54_100| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_101|)) (.cse3 (+ |v_#Ultimate.C_memset_#t~loopctr54_102| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse4 (+ |v_#Ultimate.C_memset_#t~loopctr54_103| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse5 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_104|)) (.cse6 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_105|)) (.cse7 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_106|))) (and (= |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) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0) .cse6 0) .cse7 0))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse8 (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 .cse8) .cse1 .cse8) .cse2 .cse8) .cse3 .cse8) .cse4 .cse8) .cse5 .cse8) .cse6 .cse8) .cse7 .cse8))))))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_35 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_35)))) is different from true [2018-02-03 23:11:23,491 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_35 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_35))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_102| Int) (|v_#Ultimate.C_memset_#t~loopctr54_103| Int) (|v_#Ultimate.C_memset_#t~loopctr54_100| Int) (|v_#Ultimate.C_memset_#t~loopctr54_101| Int) (|v_#Ultimate.C_memset_#t~loopctr54_99| Int) (|v_#Ultimate.C_memset_#t~loopctr54_106| Int) (|v_#Ultimate.C_memset_#t~loopctr54_107| Int) (|v_#Ultimate.C_memset_#t~loopctr54_104| Int) (|v_#Ultimate.C_memset_#t~loopctr54_105| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_99|)) (.cse1 (+ |v_#Ultimate.C_memset_#t~loopctr54_100| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_101|)) (.cse3 (+ |v_#Ultimate.C_memset_#t~loopctr54_102| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse4 (+ |v_#Ultimate.C_memset_#t~loopctr54_103| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse5 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_104|)) (.cse6 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_105|)) (.cse7 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_106|)) (.cse8 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_107|))) (and (= |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 (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0) .cse6 0) .cse7 0) .cse8 0))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse9 (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 .cse9) .cse1 .cse9) .cse2 .cse9) .cse3 .cse9) .cse4 .cse9) .cse5 .cse9) .cse6 .cse9) .cse7 .cse9) .cse8 .cse9)))))))) is different from true [2018-02-03 23:11:23,502 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_102| Int) (|v_#Ultimate.C_memset_#t~loopctr54_103| Int) (|v_#Ultimate.C_memset_#t~loopctr54_100| Int) (|v_#Ultimate.C_memset_#t~loopctr54_101| Int) (|v_#Ultimate.C_memset_#t~loopctr54_99| Int) (|v_#Ultimate.C_memset_#t~loopctr54_106| Int) (|v_#Ultimate.C_memset_#t~loopctr54_107| Int) (|v_#Ultimate.C_memset_#t~loopctr54_104| Int) (|v_#Ultimate.C_memset_#t~loopctr54_105| Int) (|v_#Ultimate.C_memset_#t~loopctr54_108| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_99|)) (.cse2 (+ |v_#Ultimate.C_memset_#t~loopctr54_100| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_101|)) (.cse4 (+ |v_#Ultimate.C_memset_#t~loopctr54_102| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse5 (+ |v_#Ultimate.C_memset_#t~loopctr54_103| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse6 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_104|)) (.cse7 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_105|)) (.cse8 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_106|)) (.cse9 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_107|)) (.cse10 (+ |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| (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 ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_35 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_35)))) is different from true [2018-02-03 23:11:23,518 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_102| Int) (|v_#Ultimate.C_memset_#t~loopctr54_103| Int) (|v_#Ultimate.C_memset_#t~loopctr54_100| Int) (|v_#Ultimate.C_memset_#t~loopctr54_101| Int) (|v_#Ultimate.C_memset_#t~loopctr54_99| Int) (|v_#Ultimate.C_memset_#t~loopctr54_106| Int) (|v_#Ultimate.C_memset_#t~loopctr54_107| Int) (|v_#Ultimate.C_memset_#t~loopctr54_104| Int) (|v_#Ultimate.C_memset_#t~loopctr54_105| 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_99|)) (.cse2 (+ |v_#Ultimate.C_memset_#t~loopctr54_100| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_101|)) (.cse4 (+ |v_#Ultimate.C_memset_#t~loopctr54_102| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse5 (+ |v_#Ultimate.C_memset_#t~loopctr54_103| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse6 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_104|)) (.cse7 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_105|)) (.cse8 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_106|)) (.cse9 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_107|)) (.cse10 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_108|)) (.cse11 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_109|))) (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 (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$.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 ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_35 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_35)))) is different from true [2018-02-03 23:11:23,545 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_35 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_35))) (exists ((|#Ultimate.C_memset_#value| Int) (|v_#Ultimate.C_memset_#t~loopctr54_99| Int) (|v_#Ultimate.C_memset_#t~loopctr54_110| Int) (|v_#Ultimate.C_memset_#t~loopctr54_102| Int) (|v_#Ultimate.C_memset_#t~loopctr54_103| Int) (|v_#Ultimate.C_memset_#t~loopctr54_100| Int) (|#Ultimate.C_memset_#ptr.offset| Int) (|v_#Ultimate.C_memset_#t~loopctr54_101| Int) (|v_#Ultimate.C_memset_#t~loopctr54_106| Int) (|v_#Ultimate.C_memset_#t~loopctr54_107| Int) (|v_#Ultimate.C_memset_#t~loopctr54_104| Int) (|v_#Ultimate.C_memset_#t~loopctr54_105| Int) (|v_#Ultimate.C_memset_#t~loopctr54_108| Int) (|v_#Ultimate.C_memset_#t~loopctr54_109| Int)) (let ((.cse0 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_99|)) (.cse1 (+ |v_#Ultimate.C_memset_#t~loopctr54_100| |#Ultimate.C_memset_#ptr.offset|)) (.cse2 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_101|)) (.cse3 (+ |v_#Ultimate.C_memset_#t~loopctr54_102| |#Ultimate.C_memset_#ptr.offset|)) (.cse4 (+ |v_#Ultimate.C_memset_#t~loopctr54_103| |#Ultimate.C_memset_#ptr.offset|)) (.cse5 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_104|)) (.cse6 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_105|)) (.cse7 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_106|)) (.cse8 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_107|)) (.cse9 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_108|)) (.cse10 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_109|)) (.cse11 (+ |v_#Ultimate.C_memset_#t~loopctr54_110| |#Ultimate.C_memset_#ptr.offset|))) (and (= (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) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0) .cse6 0) .cse7 0) .cse8 0) .cse9 0) .cse10 0) .cse11 0)) |c_#memory_$Pointer$.base|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse12 (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 .cse12) .cse1 .cse12) .cse2 .cse12) .cse3 .cse12) .cse4 .cse12) .cse5 .cse12) .cse6 .cse12) .cse7 .cse12) .cse8 .cse12) .cse9 .cse12) .cse10 .cse12) .cse11 .cse12)))))))) is different from true [2018-02-03 23:11:23,621 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-03 23:11:23,635 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-03 23:11:23,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 98 treesize of output 100 [2018-02-03 23:11:23,687 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-03 23:11:23,774 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-03 23:11:23,911 INFO L303 Elim1Store]: Index analysis took 135 ms [2018-02-03 23:11:23,911 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-03 23:11:24,102 INFO L303 Elim1Store]: Index analysis took 189 ms [2018-02-03 23:11:24,102 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-03 23:11:24,369 INFO L303 Elim1Store]: Index analysis took 265 ms [2018-02-03 23:11:24,370 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-03 23:11:24,763 INFO L303 Elim1Store]: Index analysis took 391 ms [2018-02-03 23:11:24,763 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-03 23:11:25,278 INFO L303 Elim1Store]: Index analysis took 514 ms [2018-02-03 23:11:25,279 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-03 23:11:25,925 INFO L303 Elim1Store]: Index analysis took 644 ms [2018-02-03 23:11:25,926 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-03 23:11:26,625 INFO L303 Elim1Store]: Index analysis took 697 ms [2018-02-03 23:11:26,626 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-03 23:11:27,517 INFO L303 Elim1Store]: Index analysis took 890 ms [2018-02-03 23:11:27,518 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-03 23:11:27,518 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-03 23:11:27,706 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:27,863 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:28,024 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:28,209 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:28,385 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:28,546 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:28,736 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:28,905 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:29,076 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:29,255 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:29,426 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:29,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:29,894 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-03 23:11:29,897 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-03 23:11:29,902 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-03 23:11:29,909 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-03 23:11:29,920 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-03 23:11:30,036 INFO L303 Elim1Store]: Index analysis took 115 ms [2018-02-03 23:11:30,037 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-03 23:11:30,172 INFO L303 Elim1Store]: Index analysis took 134 ms [2018-02-03 23:11:30,173 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-03 23:11:30,203 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-03 23:11:30,236 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-03 23:11:30,275 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-03 23:11:30,523 INFO L303 Elim1Store]: Index analysis took 247 ms [2018-02-03 23:11:30,524 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-03 23:11:30,719 INFO L303 Elim1Store]: Index analysis took 194 ms [2018-02-03 23:11:30,720 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-03 23:11:30,784 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-03 23:11:30,784 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-02-03 23:11:30,807 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:30,831 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:30,853 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:30,876 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:30,901 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:30,928 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:30,955 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:30,979 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:31,000 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:31,022 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:31,045 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:31,105 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:31,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 17 dim-0 vars, 2 dim-2 vars, End of recursive call: 17 dim-0 vars, and 1 xjuncts. [2018-02-03 23:11:31,173 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 19 variables, input treesize:231, output treesize:431 [2018-02-03 23:11:31,287 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-03 23:11:31,291 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:11:31,293 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-03 23:11:31,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:11:31,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:31,448 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-03 23:11:31,453 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:11:31,455 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-03 23:11:31,455 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:11:31,487 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:31,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 2 dim-2 vars, End of recursive call: 15 dim-0 vars, and 1 xjuncts. [2018-02-03 23:11:31,557 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 17 variables, input treesize:452, output treesize:422 [2018-02-03 23:11:31,569 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-03 23:11:31,575 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:11:31,577 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-03 23:11:31,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:11:31,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:31,735 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-03 23:11:31,740 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:11:31,742 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-03 23:11:31,742 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:11:31,797 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:31,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 2 dim-2 vars, End of recursive call: 15 dim-0 vars, and 1 xjuncts. [2018-02-03 23:11:31,859 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 17 variables, input treesize:460, output treesize:422 [2018-02-03 23:11:32,102 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 419 treesize of output 293 [2018-02-03 23:11:32,105 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 209 treesize of output 146 [2018-02-03 23:11:32,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:11:32,213 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-03 23:11:32,213 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:11:32,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:32,280 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 127 [2018-02-03 23:11:32,336 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-03 23:11:32,336 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 23:11:32,340 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-03 23:11:32,340 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-03 23:11:32,341 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:11:32,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 17 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:11:32,344 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 19 variables, input treesize:440, output treesize:16 [2018-02-03 23:11:32,402 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-03 23:11:32,419 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:11:32,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 46 [2018-02-03 23:11:32,419 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-03 23:11:32,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-03 23:11:32,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1065, Unknown=12, NotChecked=924, Total=2162 [2018-02-03 23:11:32,420 INFO L87 Difference]: Start difference. First operand 241 states and 301 transitions. Second operand 47 states. [2018-02-03 23:12:24,955 WARN L146 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 75 DAG size of output 64 [2018-02-03 23:12:56,272 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 87 DAG size of output 76 [2018-02-03 23:12:57,108 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 132 DAG size of output 121 [2018-02-03 23:12:57,519 WARN L146 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 209 DAG size of output 200 [2018-02-03 23:12:59,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:12:59,097 INFO L93 Difference]: Finished difference Result 271 states and 342 transitions. [2018-02-03 23:12:59,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-03 23:12:59,098 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 79 [2018-02-03 23:12:59,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:12:59,099 INFO L225 Difference]: With dead ends: 271 [2018-02-03 23:12:59,099 INFO L226 Difference]: Without dead ends: 271 [2018-02-03 23:12:59,100 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 84.0s TimeCoverageRelationStatistics Valid=547, Invalid=3829, Unknown=228, NotChecked=1716, Total=6320 [2018-02-03 23:12:59,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-02-03 23:12:59,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 240. [2018-02-03 23:12:59,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-02-03 23:12:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 300 transitions. [2018-02-03 23:12:59,103 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 300 transitions. Word has length 79 [2018-02-03 23:12:59,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:12:59,103 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 300 transitions. [2018-02-03 23:12:59,103 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-03 23:12:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 300 transitions. [2018-02-03 23:12:59,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-03 23:12:59,104 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:12:59,104 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-03 23:12:59,104 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-03 23:12:59,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1424236394, now seen corresponding path program 1 times [2018-02-03 23:12:59,104 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:12:59,104 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:12:59,105 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:12:59,105 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:12:59,105 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:12:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:12:59,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:12:59,392 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-02-03 23:12:59,392 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:12:59,392 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:12:59,397 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:12:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:12:59,434 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:12:59,498 WARN L1033 $PredicateComparison]: unable to prove that (exists ((DUPFFnew_~ans~0.base Int) (|DUPFFnew_#t~malloc3.base| Int)) (= |c_#valid| (store (store |c_old(#valid)| DUPFFnew_~ans~0.base 1) |DUPFFnew_#t~malloc3.base| 1))) is different from true [2018-02-03 23:12:59,499 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 9 treesize of output 12 [2018-02-03 23:12:59,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-03 23:12:59,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:12:59,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:12:59,505 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-03 23:12:59,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:9, output treesize:11 [2018-02-03 23:12:59,520 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_DUPFFnew_~ans~0.base_BEFORE_CALL_5 Int)) (= (select |c_#valid| v_DUPFFnew_~ans~0.base_BEFORE_CALL_5) 1)) (exists ((DUPFFnew_~ans~0.base Int) (|DUPFFnew_#t~malloc3.base| Int)) (= |c_#valid| (store (store |c_old(#valid)| DUPFFnew_~ans~0.base 1) |DUPFFnew_#t~malloc3.base| 1)))) is different from true [2018-02-03 23:12:59,524 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 15 treesize of output 17 [2018-02-03 23:12:59,527 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-03 23:12:59,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:12:59,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:12:59,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-03 23:12:59,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:21 [2018-02-03 23:12:59,557 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 8 not checked. [2018-02-03 23:12:59,575 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:12:59,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 20 [2018-02-03 23:12:59,575 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-03 23:12:59,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-03 23:12:59,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=276, Unknown=12, NotChecked=70, Total=420 [2018-02-03 23:12:59,575 INFO L87 Difference]: Start difference. First operand 240 states and 300 transitions. Second operand 21 states. [2018-02-03 23:13:01,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:13:01,960 INFO L93 Difference]: Finished difference Result 401 states and 526 transitions. [2018-02-03 23:13:01,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-03 23:13:01,960 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 86 [2018-02-03 23:13:01,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:13:01,962 INFO L225 Difference]: With dead ends: 401 [2018-02-03 23:13:01,962 INFO L226 Difference]: Without dead ends: 401 [2018-02-03 23:13:01,962 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 79 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=237, Invalid=1011, Unknown=20, NotChecked=138, Total=1406 [2018-02-03 23:13:01,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-02-03 23:13:01,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 334. [2018-02-03 23:13:01,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-02-03 23:13:01,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 467 transitions. [2018-02-03 23:13:01,970 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 467 transitions. Word has length 86 [2018-02-03 23:13:01,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:13:01,971 INFO L432 AbstractCegarLoop]: Abstraction has 334 states and 467 transitions. [2018-02-03 23:13:01,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-03 23:13:01,971 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 467 transitions. [2018-02-03 23:13:01,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-03 23:13:01,972 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:13:01,972 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-03 23:13:01,972 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-03 23:13:01,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1424236393, now seen corresponding path program 1 times [2018-02-03 23:13:01,973 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:13:01,973 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:13:01,973 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:01,973 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:13:01,974 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:13:02,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:13:02,791 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-02-03 23:13:02,791 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:13:02,791 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:13:02,797 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:13:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:13:02,848 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:13:02,850 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-03 23:13:02,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:13:02,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:13:02,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-03 23:13:02,903 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:13:02,905 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-03 23:13:02,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:13:02,912 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:13:02,913 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:13:02,914 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-03 23:13:02,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:13:02,918 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-03 23:13:02,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:19 [2018-02-03 23:13:02,953 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-03 23:13:02,955 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-03 23:13:02,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:13:02,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:13:02,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:13:02,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:31 [2018-02-03 23:13:02,998 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 35 treesize of output 29 [2018-02-03 23:13:03,000 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 29 treesize of output 14 [2018-02-03 23:13:03,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:13:03,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:13:03,012 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-03 23:13:03,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:19 [2018-02-03 23:13:03,591 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|DUPFFnew_#t~malloc1.base| Int) (|DUPFFnew_#t~malloc3.base| Int)) (= (store (store |c_old(#length)| |DUPFFnew_#t~malloc1.base| 12) |DUPFFnew_#t~malloc3.base| (+ (* 4 |c_DUPFFnew_#in~maxdeg|) 4)) |c_#length|)) is different from true [2018-02-03 23:13:03,594 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-03 23:13:03,601 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-03 23:13:03,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 23:13:03,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:13:03,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-02-03 23:13:03,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:13, output treesize:25 [2018-02-03 23:13:03,657 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|DUPFFnew_#t~malloc1.base| Int) (|DUPFFnew_#t~malloc3.base| Int)) (= (store (store |c_old(#length)| |DUPFFnew_#t~malloc1.base| 12) |DUPFFnew_#t~malloc3.base| (+ (* 4 |c_DUPFFnew_#in~maxdeg|) 4)) |c_#length|)) (exists ((v_prenex_6 Int) (|v_DUPFFnew_#in~maxdeg_BEFORE_CALL_14| Int)) (= (+ (* 4 |v_DUPFFnew_#in~maxdeg_BEFORE_CALL_14|) 4) (select |c_#length| v_prenex_6)))) is different from true [2018-02-03 23:13:03,674 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 2 case distinctions, treesize of input 31 treesize of output 37 [2018-02-03 23:13:03,677 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 30 [2018-02-03 23:13:03,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:13:03,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 48 [2018-02-03 23:13:03,705 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-02-03 23:13:03,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-03 23:13:03,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 14 dim-0 vars, and 3 xjuncts. [2018-02-03 23:13:03,750 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:49, output treesize:121 [2018-02-03 23:13:04,040 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 3 proven. 124 refuted. 0 times theorem prover too weak. 114 trivial. 9 not checked. [2018-02-03 23:13:04,057 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:13:04,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 45 [2018-02-03 23:13:04,058 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-03 23:13:04,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-03 23:13:04,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1704, Unknown=7, NotChecked=170, Total=2070 [2018-02-03 23:13:04,058 INFO L87 Difference]: Start difference. First operand 334 states and 467 transitions. Second operand 46 states. [2018-02-03 23:13:06,586 WARN L146 SmtUtils]: Spent 803ms on a formula simplification. DAG size of input: 50 DAG size of output 38 [2018-02-03 23:13:07,641 WARN L146 SmtUtils]: Spent 939ms on a formula simplification. DAG size of input: 64 DAG size of output 45 [2018-02-03 23:13:08,282 WARN L146 SmtUtils]: Spent 397ms on a formula simplification. DAG size of input: 45 DAG size of output 30 [2018-02-03 23:13:15,757 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 82 DAG size of output 65 [2018-02-03 23:13:16,335 WARN L146 SmtUtils]: Spent 393ms on a formula simplification. DAG size of input: 40 DAG size of output 25 [2018-02-03 23:13:23,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:13:23,548 INFO L93 Difference]: Finished difference Result 741 states and 996 transitions. [2018-02-03 23:13:23,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-03 23:13:23,549 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 86 [2018-02-03 23:13:23,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:13:23,551 INFO L225 Difference]: With dead ends: 741 [2018-02-03 23:13:23,551 INFO L226 Difference]: Without dead ends: 741 [2018-02-03 23:13:23,552 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 67 SyntacticMatches, 9 SemanticMatches, 76 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1513 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=641, Invalid=5049, Unknown=18, NotChecked=298, Total=6006 [2018-02-03 23:13:23,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-02-03 23:13:23,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 563. [2018-02-03 23:13:23,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-02-03 23:13:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 849 transitions. [2018-02-03 23:13:23,562 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 849 transitions. Word has length 86 [2018-02-03 23:13:23,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:13:23,562 INFO L432 AbstractCegarLoop]: Abstraction has 563 states and 849 transitions. [2018-02-03 23:13:23,562 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-03 23:13:23,562 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 849 transitions. [2018-02-03 23:13:23,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-03 23:13:23,562 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:13:23,562 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, 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-03 23:13:23,562 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-03 23:13:23,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1589944013, now seen corresponding path program 1 times [2018-02-03 23:13:23,563 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:13:23,563 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:13:23,563 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:23,563 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:13:23,563 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:13:23,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:13:23,620 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-02-03 23:13:23,621 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:13:23,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-03 23:13:23,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-03 23:13:23,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-03 23:13:23,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-03 23:13:23,622 INFO L87 Difference]: Start difference. First operand 563 states and 849 transitions. Second operand 7 states. [2018-02-03 23:13:23,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:13:23,906 INFO L93 Difference]: Finished difference Result 580 states and 863 transitions. [2018-02-03 23:13:23,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 23:13:23,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-02-03 23:13:23,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:13:23,909 INFO L225 Difference]: With dead ends: 580 [2018-02-03 23:13:23,909 INFO L226 Difference]: Without dead ends: 580 [2018-02-03 23:13:23,910 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-03 23:13:23,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-02-03 23:13:23,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 573. [2018-02-03 23:13:23,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-02-03 23:13:23,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 859 transitions. [2018-02-03 23:13:23,923 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 859 transitions. Word has length 93 [2018-02-03 23:13:23,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:13:23,923 INFO L432 AbstractCegarLoop]: Abstraction has 573 states and 859 transitions. [2018-02-03 23:13:23,923 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-03 23:13:23,923 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 859 transitions. [2018-02-03 23:13:23,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-03 23:13:23,924 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:13:23,924 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, 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-03 23:13:23,924 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-03 23:13:23,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1589944012, now seen corresponding path program 1 times [2018-02-03 23:13:23,924 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:13:23,924 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:13:23,925 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:23,925 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:13:23,925 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:13:23,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:13:24,072 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-02-03 23:13:24,073 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:13:24,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-03 23:13:24,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-03 23:13:24,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-03 23:13:24,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-02-03 23:13:24,073 INFO L87 Difference]: Start difference. First operand 573 states and 859 transitions. Second operand 12 states. [2018-02-03 23:13:24,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:13:24,299 INFO L93 Difference]: Finished difference Result 584 states and 865 transitions. [2018-02-03 23:13:24,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-03 23:13:24,300 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2018-02-03 23:13:24,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:13:24,301 INFO L225 Difference]: With dead ends: 584 [2018-02-03 23:13:24,301 INFO L226 Difference]: Without dead ends: 584 [2018-02-03 23:13:24,302 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-02-03 23:13:24,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-02-03 23:13:24,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 573. [2018-02-03 23:13:24,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-02-03 23:13:24,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 857 transitions. [2018-02-03 23:13:24,310 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 857 transitions. Word has length 93 [2018-02-03 23:13:24,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:13:24,310 INFO L432 AbstractCegarLoop]: Abstraction has 573 states and 857 transitions. [2018-02-03 23:13:24,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-03 23:13:24,310 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 857 transitions. [2018-02-03 23:13:24,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-03 23:13:24,311 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:13:24,311 INFO L351 BasicCegarLoop]: trace histogram [20, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2018-02-03 23:13:24,311 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-03 23:13:24,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1788460660, now seen corresponding path program 1 times [2018-02-03 23:13:24,311 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:13:24,311 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:13:24,312 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:24,312 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:13:24,312 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:13:24,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:13:24,386 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-02-03 23:13:24,387 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:13:24,387 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:13:24,394 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:13:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:13:24,450 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:13:24,572 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 133 proven. 2 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-02-03 23:13:24,604 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:13:24,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 12 [2018-02-03 23:13:24,605 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-03 23:13:24,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-03 23:13:24,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-03 23:13:24,605 INFO L87 Difference]: Start difference. First operand 573 states and 857 transitions. Second operand 13 states. [2018-02-03 23:13:25,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:13:25,269 INFO L93 Difference]: Finished difference Result 636 states and 939 transitions. [2018-02-03 23:13:25,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-03 23:13:25,269 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 103 [2018-02-03 23:13:25,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:13:25,272 INFO L225 Difference]: With dead ends: 636 [2018-02-03 23:13:25,272 INFO L226 Difference]: Without dead ends: 636 [2018-02-03 23:13:25,272 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 92 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-02-03 23:13:25,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2018-02-03 23:13:25,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 618. [2018-02-03 23:13:25,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-02-03 23:13:25,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 919 transitions. [2018-02-03 23:13:25,281 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 919 transitions. Word has length 103 [2018-02-03 23:13:25,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:13:25,282 INFO L432 AbstractCegarLoop]: Abstraction has 618 states and 919 transitions. [2018-02-03 23:13:25,282 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-03 23:13:25,282 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 919 transitions. [2018-02-03 23:13:25,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-03 23:13:25,283 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:13:25,283 INFO L351 BasicCegarLoop]: trace histogram [20, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2018-02-03 23:13:25,283 INFO L371 AbstractCegarLoop]: === Iteration 32 === [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-03 23:13:25,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1788460659, now seen corresponding path program 1 times [2018-02-03 23:13:25,283 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:13:25,283 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:13:25,284 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:25,284 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:13:25,284 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:13:25,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:13:25,461 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-02-03 23:13:25,461 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:13:25,461 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:13:25,466 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:13:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:13:25,522 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:13:25,731 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-02-03 23:13:25,748 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:13:25,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-02-03 23:13:25,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-03 23:13:25,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-03 23:13:25,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2018-02-03 23:13:25,749 INFO L87 Difference]: Start difference. First operand 618 states and 919 transitions. Second operand 26 states. [2018-02-03 23:13:26,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:13:26,765 INFO L93 Difference]: Finished difference Result 644 states and 944 transitions. [2018-02-03 23:13:26,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-03 23:13:26,766 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 103 [2018-02-03 23:13:26,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:13:26,768 INFO L225 Difference]: With dead ends: 644 [2018-02-03 23:13:26,768 INFO L226 Difference]: Without dead ends: 644 [2018-02-03 23:13:26,769 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=1184, Unknown=0, NotChecked=0, Total=1332 [2018-02-03 23:13:26,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2018-02-03 23:13:26,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 623. [2018-02-03 23:13:26,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-02-03 23:13:26,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 920 transitions. [2018-02-03 23:13:26,781 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 920 transitions. Word has length 103 [2018-02-03 23:13:26,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:13:26,781 INFO L432 AbstractCegarLoop]: Abstraction has 623 states and 920 transitions. [2018-02-03 23:13:26,782 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-03 23:13:26,782 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 920 transitions. [2018-02-03 23:13:26,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-03 23:13:26,782 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:13:26,783 INFO L351 BasicCegarLoop]: trace histogram [20, 4, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1] [2018-02-03 23:13:26,783 INFO L371 AbstractCegarLoop]: === Iteration 33 === [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-03 23:13:26,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1293541507, now seen corresponding path program 2 times [2018-02-03 23:13:26,783 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:13:26,783 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:13:26,784 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:26,784 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:13:26,784 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:13:26,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:13:26,871 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2018-02-03 23:13:26,871 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:13:26,871 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:13:26,878 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 23:13:26,932 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 23:13:26,932 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:13:26,935 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:13:26,966 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-02-03 23:13:26,984 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:13:26,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2018-02-03 23:13:26,984 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 23:13:26,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 23:13:26,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-03 23:13:26,985 INFO L87 Difference]: Start difference. First operand 623 states and 920 transitions. Second operand 9 states. [2018-02-03 23:13:27,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:13:27,378 INFO L93 Difference]: Finished difference Result 638 states and 934 transitions. [2018-02-03 23:13:27,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-03 23:13:27,378 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2018-02-03 23:13:27,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:13:27,380 INFO L225 Difference]: With dead ends: 638 [2018-02-03 23:13:27,381 INFO L226 Difference]: Without dead ends: 638 [2018-02-03 23:13:27,381 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 104 SyntacticMatches, 8 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-02-03 23:13:27,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-02-03 23:13:27,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 626. [2018-02-03 23:13:27,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-02-03 23:13:27,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 925 transitions. [2018-02-03 23:13:27,394 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 925 transitions. Word has length 110 [2018-02-03 23:13:27,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:13:27,394 INFO L432 AbstractCegarLoop]: Abstraction has 626 states and 925 transitions. [2018-02-03 23:13:27,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 23:13:27,394 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 925 transitions. [2018-02-03 23:13:27,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-03 23:13:27,395 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:13:27,395 INFO L351 BasicCegarLoop]: trace histogram [20, 4, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1] [2018-02-03 23:13:27,395 INFO L371 AbstractCegarLoop]: === Iteration 34 === [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-03 23:13:27,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1293541506, now seen corresponding path program 2 times [2018-02-03 23:13:27,395 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:13:27,395 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:13:27,396 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:27,396 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:13:27,396 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:13:27,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:13:27,620 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2018-02-03 23:13:27,620 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:13:27,621 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:13:27,627 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 23:13:27,740 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 23:13:27,740 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:13:27,745 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:13:28,011 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 7 proven. 26 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-02-03 23:13:28,030 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:13:28,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 30 [2018-02-03 23:13:28,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-03 23:13:28,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-03 23:13:28,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=841, Unknown=0, NotChecked=0, Total=930 [2018-02-03 23:13:28,031 INFO L87 Difference]: Start difference. First operand 626 states and 925 transitions. Second operand 31 states. [2018-02-03 23:13:29,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:13:29,210 INFO L93 Difference]: Finished difference Result 809 states and 1208 transitions. [2018-02-03 23:13:29,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-03 23:13:29,210 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 110 [2018-02-03 23:13:29,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:13:29,213 INFO L225 Difference]: With dead ends: 809 [2018-02-03 23:13:29,213 INFO L226 Difference]: Without dead ends: 809 [2018-02-03 23:13:29,214 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=1704, Unknown=0, NotChecked=0, Total=1892 [2018-02-03 23:13:29,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2018-02-03 23:13:29,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 768. [2018-02-03 23:13:29,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2018-02-03 23:13:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1190 transitions. [2018-02-03 23:13:29,230 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1190 transitions. Word has length 110 [2018-02-03 23:13:29,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:13:29,230 INFO L432 AbstractCegarLoop]: Abstraction has 768 states and 1190 transitions. [2018-02-03 23:13:29,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-03 23:13:29,231 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1190 transitions. [2018-02-03 23:13:29,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-03 23:13:29,231 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:13:29,231 INFO L351 BasicCegarLoop]: trace histogram [20, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:13:29,231 INFO L371 AbstractCegarLoop]: === Iteration 35 === [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-03 23:13:29,232 INFO L82 PathProgramCache]: Analyzing trace with hash 634280140, now seen corresponding path program 1 times [2018-02-03 23:13:29,232 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:13:29,232 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:13:29,232 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:29,233 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:13:29,233 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:13:29,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:13:29,284 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2018-02-03 23:13:29,284 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:13:29,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:13:29,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 23:13:29,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 23:13:29,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:13:29,285 INFO L87 Difference]: Start difference. First operand 768 states and 1190 transitions. Second operand 3 states. [2018-02-03 23:13:29,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:13:29,292 INFO L93 Difference]: Finished difference Result 771 states and 1190 transitions. [2018-02-03 23:13:29,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 23:13:29,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2018-02-03 23:13:29,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:13:29,296 INFO L225 Difference]: With dead ends: 771 [2018-02-03 23:13:29,296 INFO L226 Difference]: Without dead ends: 768 [2018-02-03 23:13:29,296 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:13:29,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2018-02-03 23:13:29,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 768. [2018-02-03 23:13:29,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2018-02-03 23:13:29,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1187 transitions. [2018-02-03 23:13:29,311 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1187 transitions. Word has length 109 [2018-02-03 23:13:29,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:13:29,311 INFO L432 AbstractCegarLoop]: Abstraction has 768 states and 1187 transitions. [2018-02-03 23:13:29,311 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 23:13:29,311 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1187 transitions. [2018-02-03 23:13:29,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-02-03 23:13:29,312 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:13:29,312 INFO L351 BasicCegarLoop]: trace histogram [20, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:13:29,312 INFO L371 AbstractCegarLoop]: === Iteration 36 === [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-03 23:13:29,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1293061200, now seen corresponding path program 1 times [2018-02-03 23:13:29,313 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:13:29,313 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:13:29,313 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:29,313 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:13:29,313 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:29,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:13:29,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:13:31,183 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-02-03 23:13:31,183 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:13:31,183 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:13:31,188 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:13:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:13:31,267 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:13:31,283 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-03 23:13:31,285 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-03 23:13:31,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:13:31,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:13:31,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:13:31,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-02-03 23:13:31,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2018-02-03 23:13:31,909 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 26 treesize of output 19 [2018-02-03 23:13:31,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:13:31,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2018-02-03 23:13:31,916 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:13:31,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 3 [2018-02-03 23:13:31,923 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:13:31,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:13:31,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:13:31,927 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2018-02-03 23:13:32,002 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2018-02-03 23:13:32,021 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:13:32,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [33] total 43 [2018-02-03 23:13:32,021 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-03 23:13:32,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-03 23:13:32,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-02-03 23:13:32,022 INFO L87 Difference]: Start difference. First operand 768 states and 1187 transitions. Second operand 43 states. [2018-02-03 23:13:33,289 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 74 DAG size of output 72 [2018-02-03 23:13:33,446 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 72 DAG size of output 70 [2018-02-03 23:13:33,727 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 113 DAG size of output 78 [2018-02-03 23:13:33,969 WARN L146 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 110 DAG size of output 93 Received shutdown request... [2018-02-03 23:13:34,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-03 23:13:34,634 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-03 23:13:34,638 WARN L185 ceAbstractionStarter]: Timeout [2018-02-03 23:13:34,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 11:13:34 BoogieIcfgContainer [2018-02-03 23:13:34,638 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-03 23:13:34,638 INFO L168 Benchmark]: Toolchain (without parser) took 199245.87 ms. Allocated memory was 405.3 MB in the beginning and 950.5 MB in the end (delta: 545.3 MB). Free memory was 362.0 MB in the beginning and 879.4 MB in the end (delta: -517.3 MB). Peak memory consumption was 27.9 MB. Max. memory is 5.3 GB. [2018-02-03 23:13:34,639 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 405.3 MB. Free memory is still 368.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 23:13:34,639 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.71 ms. Allocated memory is still 405.3 MB. Free memory was 362.0 MB in the beginning and 348.5 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 5.3 GB. [2018-02-03 23:13:34,639 INFO L168 Benchmark]: Boogie Preprocessor took 36.36 ms. Allocated memory is still 405.3 MB. Free memory was 348.5 MB in the beginning and 345.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-03 23:13:34,640 INFO L168 Benchmark]: RCFGBuilder took 464.58 ms. Allocated memory is still 405.3 MB. Free memory was 345.9 MB in the beginning and 294.7 MB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 5.3 GB. [2018-02-03 23:13:34,640 INFO L168 Benchmark]: TraceAbstraction took 198546.88 ms. Allocated memory was 405.3 MB in the beginning and 950.5 MB in the end (delta: 545.3 MB). Free memory was 294.7 MB in the beginning and 879.4 MB in the end (delta: -584.7 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 23:13:34,641 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 405.3 MB. Free memory is still 368.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 194.71 ms. Allocated memory is still 405.3 MB. Free memory was 362.0 MB in the beginning and 348.5 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.36 ms. Allocated memory is still 405.3 MB. Free memory was 348.5 MB in the beginning and 345.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 464.58 ms. Allocated memory is still 405.3 MB. Free memory was 345.9 MB in the beginning and 294.7 MB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 198546.88 ms. Allocated memory was 405.3 MB in the beginning and 950.5 MB in the end (delta: 545.3 MB). Free memory was 294.7 MB in the beginning and 879.4 MB in the end (delta: -584.7 MB). There was no memory consumed. 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 (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 979). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 982). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 978). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 978). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 981). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 982). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 981). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 979). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 976). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 976). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 979). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 971). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 971). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 1045]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1045). Cancelled while BasicCegarLoop was constructing difference of abstraction (768states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 210 locations, 55 error locations. TIMEOUT Result, 198.5s OverallTime, 36 OverallIterations, 20 TraceHistogramMax, 145.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7383 SDtfs, 5051 SDslu, 49467 SDs, 0 SdLazy, 31613 SolverSat, 2408 SolverUnsat, 745 SolverUnknown, 0 SolverNotchecked, 37.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2353 GetRequests, 1412 SyntacticMatches, 65 SemanticMatches, 875 ConstructedPredicates, 38 IntricatePredicates, 0 DeprecatedPredicates, 7954 ImplicationChecksByTransitivity, 114.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=768occurred in iteration=34, 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, 35 MinimizatonAttempts, 709 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 26.6s SatisfiabilityAnalysisTime, 24.9s InterpolantComputationTime, 3683 NumberOfCodeBlocks, 3683 NumberOfCodeBlocksAsserted, 84 NumberOfCheckSat, 3625 ConstructedInterpolants, 323 QuantifiedInterpolants, 2191444 SizeOfPredicates, 128 NumberOfNonLiveVariables, 8181 ConjunctsInSsa, 553 ConjunctsInUnsatCore, 58 InterpolantComputations, 15 PerfectInterpolantSequences, 6532/7729 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_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-03_23-13-34-647.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_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-03_23-13-34-647.csv Completed graceful shutdown