java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ldv-regression/test23-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 22:53:38,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 22:53:38,161 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 22:53:38,181 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 22:53:38,181 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 22:53:38,184 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 22:53:38,186 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 22:53:38,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 22:53:38,203 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 22:53:38,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 22:53:38,207 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 22:53:38,209 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 22:53:38,209 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 22:53:38,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 22:53:38,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 22:53:38,216 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 22:53:38,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 22:53:38,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 22:53:38,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 22:53:38,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 22:53:38,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 22:53:38,232 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 22:53:38,235 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 22:53:38,236 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 22:53:38,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 22:53:38,238 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 22:53:38,238 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 22:53:38,240 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 22:53:38,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 22:53:38,242 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 22:53:38,243 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 22:53:38,245 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 22:53:38,245 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 22:53:38,246 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 22:53:38,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 22:53:38,248 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 22:53:38,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 22:53:38,249 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 22:53:38,249 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 22:53:38,250 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 22:53:38,251 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 22:53:38,252 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 22:53:38,284 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 22:53:38,284 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 22:53:38,285 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 22:53:38,286 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 22:53:38,286 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 22:53:38,289 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 22:53:38,290 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 22:53:38,290 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 22:53:38,290 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 22:53:38,290 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 22:53:38,290 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 22:53:38,291 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 22:53:38,291 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 22:53:38,291 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 22:53:38,291 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 22:53:38,291 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 22:53:38,292 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 22:53:38,292 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 22:53:38,292 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 22:53:38,294 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 22:53:38,295 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 22:53:38,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 22:53:38,295 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 22:53:38,295 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 22:53:38,296 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 22:53:38,296 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 22:53:38,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 22:53:38,296 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 22:53:38,296 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 22:53:38,596 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 22:53:38,615 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 22:53:38,618 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 22:53:38,620 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 22:53:38,620 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 22:53:38,621 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test23-2.c [2019-10-13 22:53:38,699 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee8a74e62/bb09ae7aadaa409da8fc6bec4857b3ee/FLAG1f5b104e1 [2019-10-13 22:53:39,206 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 22:53:39,206 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test23-2.c [2019-10-13 22:53:39,213 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee8a74e62/bb09ae7aadaa409da8fc6bec4857b3ee/FLAG1f5b104e1 [2019-10-13 22:53:39,539 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee8a74e62/bb09ae7aadaa409da8fc6bec4857b3ee [2019-10-13 22:53:39,552 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 22:53:39,554 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 22:53:39,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 22:53:39,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 22:53:39,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 22:53:39,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:53:39" (1/1) ... [2019-10-13 22:53:39,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b8a29d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:39, skipping insertion in model container [2019-10-13 22:53:39,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:53:39" (1/1) ... [2019-10-13 22:53:39,574 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 22:53:39,593 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 22:53:39,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:53:39,799 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 22:53:39,894 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:53:39,921 INFO L192 MainTranslator]: Completed translation [2019-10-13 22:53:39,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:39 WrapperNode [2019-10-13 22:53:39,922 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 22:53:39,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 22:53:39,922 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 22:53:39,923 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 22:53:39,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:39" (1/1) ... [2019-10-13 22:53:39,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:39" (1/1) ... [2019-10-13 22:53:39,941 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:39" (1/1) ... [2019-10-13 22:53:39,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:39" (1/1) ... [2019-10-13 22:53:39,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:39" (1/1) ... [2019-10-13 22:53:39,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:39" (1/1) ... [2019-10-13 22:53:39,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:39" (1/1) ... [2019-10-13 22:53:39,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 22:53:39,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 22:53:39,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 22:53:39,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 22:53:39,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:39" (1/1) ... No working directory specified, using /storage/repos/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 [2019-10-13 22:53:40,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 22:53:40,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 22:53:40,031 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-13 22:53:40,031 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2019-10-13 22:53:40,032 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-13 22:53:40,032 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 22:53:40,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 22:53:40,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 22:53:40,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 22:53:40,032 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 22:53:40,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 22:53:40,033 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2019-10-13 22:53:40,033 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 22:53:40,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 22:53:40,033 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 22:53:40,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 22:53:40,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 22:53:40,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 22:53:40,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 22:53:40,432 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 22:53:40,432 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 22:53:40,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:53:40 BoogieIcfgContainer [2019-10-13 22:53:40,434 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 22:53:40,435 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 22:53:40,435 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 22:53:40,438 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 22:53:40,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:53:39" (1/3) ... [2019-10-13 22:53:40,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cdd8b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:53:40, skipping insertion in model container [2019-10-13 22:53:40,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:53:39" (2/3) ... [2019-10-13 22:53:40,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cdd8b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:53:40, skipping insertion in model container [2019-10-13 22:53:40,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:53:40" (3/3) ... [2019-10-13 22:53:40,442 INFO L109 eAbstractionObserver]: Analyzing ICFG test23-2.c [2019-10-13 22:53:40,452 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 22:53:40,460 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 22:53:40,471 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 22:53:40,495 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 22:53:40,495 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 22:53:40,495 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 22:53:40,495 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 22:53:40,495 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 22:53:40,495 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 22:53:40,496 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 22:53:40,496 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 22:53:40,512 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-10-13 22:53:40,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 22:53:40,517 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:53:40,518 INFO L380 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] [2019-10-13 22:53:40,520 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:53:40,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:53:40,524 INFO L82 PathProgramCache]: Analyzing trace with hash -384501524, now seen corresponding path program 1 times [2019-10-13 22:53:40,533 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:53:40,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296144420] [2019-10-13 22:53:40,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:53:40,534 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:53:40,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:53:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:53:40,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 22:53:40,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296144420] [2019-10-13 22:53:40,714 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:53:40,714 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-13 22:53:40,715 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930797682] [2019-10-13 22:53:40,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 22:53:40,720 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:53:40,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 22:53:40,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 22:53:40,735 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2019-10-13 22:53:40,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:53:40,755 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-10-13 22:53:40,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 22:53:40,757 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2019-10-13 22:53:40,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:53:40,764 INFO L225 Difference]: With dead ends: 40 [2019-10-13 22:53:40,765 INFO L226 Difference]: Without dead ends: 23 [2019-10-13 22:53:40,768 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 22:53:40,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-13 22:53:40,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-13 22:53:40,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-13 22:53:40,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-10-13 22:53:40,808 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 23 [2019-10-13 22:53:40,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:53:40,810 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-10-13 22:53:40,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 22:53:40,810 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-10-13 22:53:40,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 22:53:40,812 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:53:40,813 INFO L380 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] [2019-10-13 22:53:40,813 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:53:40,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:53:40,813 INFO L82 PathProgramCache]: Analyzing trace with hash -543446048, now seen corresponding path program 1 times [2019-10-13 22:53:40,814 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:53:40,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47780702] [2019-10-13 22:53:40,814 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:53:40,814 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:53:40,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:53:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:53:41,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 22:53:41,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47780702] [2019-10-13 22:53:41,163 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:53:41,163 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 22:53:41,164 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310778806] [2019-10-13 22:53:41,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 22:53:41,166 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:53:41,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 22:53:41,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-13 22:53:41,167 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 10 states. [2019-10-13 22:53:41,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:53:41,466 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-10-13 22:53:41,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 22:53:41,467 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-10-13 22:53:41,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:53:41,468 INFO L225 Difference]: With dead ends: 32 [2019-10-13 22:53:41,468 INFO L226 Difference]: Without dead ends: 25 [2019-10-13 22:53:41,471 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-10-13 22:53:41,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-13 22:53:41,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-13 22:53:41,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-13 22:53:41,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-10-13 22:53:41,487 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 24 [2019-10-13 22:53:41,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:53:41,488 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-10-13 22:53:41,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 22:53:41,489 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-10-13 22:53:41,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 22:53:41,491 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:53:41,491 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:53:41,491 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:53:41,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:53:41,492 INFO L82 PathProgramCache]: Analyzing trace with hash -8538139, now seen corresponding path program 1 times [2019-10-13 22:53:41,492 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:53:41,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396506498] [2019-10-13 22:53:41,492 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:53:41,493 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:53:41,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:53:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:53:41,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 22:53:41,839 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396506498] [2019-10-13 22:53:41,839 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424282219] [2019-10-13 22:53:41,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:53:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:53:41,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-13 22:53:41,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:53:42,031 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 24 [2019-10-13 22:53:42,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 22:53:42,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 22:53:42,046 INFO L496 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. [2019-10-13 22:53:42,046 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:54 [2019-10-13 22:53:52,282 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 22:53:52,285 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 22:53:52,286 INFO L375 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 52 treesize of output 21 [2019-10-13 22:53:52,287 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 22:53:52,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 22:53:52,297 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 22:53:52,297 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:30 [2019-10-13 22:53:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 22:53:55,147 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:53:55,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 22:53:55,273 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1826011418] [2019-10-13 22:53:55,310 INFO L162 IcfgInterpreter]: Started Sifa with 23 locations of interest [2019-10-13 22:53:55,310 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:53:55,317 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:53:55,326 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:53:55,327 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:53:55,723 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 51 for LOIs [2019-10-13 22:53:55,966 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-10-13 22:53:56,650 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:53:57,859 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:53:58,495 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:53:58,882 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:53:59,236 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:53:59,435 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:53:59,814 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:54:00,376 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:54:00,809 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:54:00,944 INFO L199 IcfgInterpreter]: Interpreting procedure check with input of size 21 for LOIs [2019-10-13 22:54:00,953 INFO L199 IcfgInterpreter]: Interpreting procedure get_dummy with input of size 43 for LOIs [2019-10-13 22:54:00,979 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 28 for LOIs [2019-10-13 22:54:00,989 INFO L199 IcfgInterpreter]: Interpreting procedure init with input of size 51 for LOIs [2019-10-13 22:54:01,000 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:54:01,000 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:54:01,000 INFO L193 IcfgInterpreter]: Reachable states at location L43 satisfy 1307#(and (= |#NULL.base| 0) (<= main_~pd2~0.offset 0) (<= 0 |~#d1~0.offset|) (<= |main_#t~ret13| 1) (<= |#NULL.base| 0) (= |~#d1~0.offset| 0) (<= 0 |main_#t~ret13|) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~pd1~0.offset) (= |~#d2~0.offset| 0) (<= |~#d1~0.offset| 0) (<= main_~pd1~0.offset 0) (<= 0 main_~pd2~0.offset) (= |#NULL.offset| 0)) [2019-10-13 22:54:01,001 INFO L193 IcfgInterpreter]: Reachable states at location L34-1 satisfy 1211#(and (or (and (<= 0 |~#d1~0.offset|) (= (select |old(#memory_int)| |~#d2~0.base|) ((as const (Array Int Int)) 0)) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (not (= |~#d1~0.base| |~#d2~0.base|)) (= |~#d2~0.base| main_~pd1~0.base) (< |~#d2~0.base| |#StackHeapBarrier|) (= 1 (select |#valid| |~#d2~0.base|)) (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#d1~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (= 0 |~#d1~0.offset|) (= main_~pd1~0.offset |~#d2~0.offset|) (= 1 (select |#valid| |~#d1~0.base|)) (<= 0 main_~pd1~0.offset) (not (= 0 |~#d2~0.base|)) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= |#NULL.offset| 0)) (and (<= 0 |~#d1~0.offset|) (= (select |old(#memory_int)| |~#d2~0.base|) ((as const (Array Int Int)) 0)) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (not (= |~#d1~0.base| |~#d2~0.base|)) (< |~#d2~0.base| |#StackHeapBarrier|) (= 1 (select |#valid| |~#d2~0.base|)) (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#d1~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (= 0 |~#d1~0.offset|) (= |~#d1~0.base| main_~pd1~0.base) (= 1 (select |#valid| |~#d1~0.base|)) (<= 0 main_~pd1~0.offset) (not (= 0 |~#d2~0.base|)) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= |#NULL.offset| 0) (= main_~pd1~0.offset |~#d1~0.offset|))) (<= |#NULL.base| 0) (<= |~#d1~0.offset| 0) (<= main_~pd1~0.offset 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:54:01,001 INFO L193 IcfgInterpreter]: Reachable states at location initENTRY satisfy 1339#(and (<= 0 |~#d1~0.offset|) (= (select |old(#memory_int)| |~#d2~0.base|) ((as const (Array Int Int)) 0)) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (< |~#d2~0.base| |#StackHeapBarrier|) (= 1 (select |#valid| |~#d2~0.base|)) (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#d1~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (= 0 |~#d1~0.offset|) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (<= 0 |~#d2~0.offset|) (<= |#NULL.offset| 0) (not (= 0 |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0)) [2019-10-13 22:54:01,001 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 76#(and (<= 0 |~#d1~0.offset|) (= (select |old(#memory_int)| |~#d2~0.base|) ((as const (Array Int Int)) 0)) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< |~#d2~0.base| |#StackHeapBarrier|) (not (= 0 |~#d2~0.base|)) (= 1 (select |#valid| |~#d2~0.base|)) (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#d1~0.base|)) (<= |~#d1~0.offset| 0) (= 72 (select |#length| |~#d1~0.base|)) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= 0 |~#d1~0.offset|) (= |#NULL.offset| 0)) [2019-10-13 22:54:01,001 INFO L193 IcfgInterpreter]: Reachable states at location L44 satisfy 1169#(and (= |#NULL.base| 0) (<= main_~pd2~0.offset 0) (<= 0 |~#d1~0.offset|) (<= |#NULL.base| 0) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~pd1~0.offset) (= |~#d2~0.offset| 0) (<= |~#d1~0.offset| 0) (<= main_~pd1~0.offset 0) (<= 0 main_~pd2~0.offset) (= |#NULL.offset| 0)) [2019-10-13 22:54:01,002 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 1330#(and (= |old(~#d2~0.base)| |~#d2~0.base|) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |old(~#d2~0.offset)| |~#d2~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#d1~0.base)| |~#d1~0.base|) (= |old(~#d1~0.offset)| |~#d1~0.offset|) (= |old(#length)| |#length|)) [2019-10-13 22:54:01,002 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 1202#(and (<= |main_#t~ret7.offset| 0) (or (and (<= 0 |~#d1~0.offset|) (= (select |old(#memory_int)| |~#d2~0.base|) ((as const (Array Int Int)) 0)) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (= |~#d2~0.base| |main_#t~ret7.base|) (< |~#d2~0.base| |#StackHeapBarrier|) (= 1 (select |#valid| |~#d2~0.base|)) (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#d1~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (= 0 |~#d1~0.offset|) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (<= 0 |~#d2~0.offset|) (<= |#NULL.offset| 0) (not (= 0 |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= |main_#t~ret7.offset| |~#d2~0.offset|) (= |#NULL.offset| 0)) (and (<= 0 |~#d1~0.offset|) (= (select |old(#memory_int)| |~#d2~0.base|) ((as const (Array Int Int)) 0)) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (< |~#d2~0.base| |#StackHeapBarrier|) (= 1 (select |#valid| |~#d2~0.base|)) (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#d1~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (= 0 |~#d1~0.offset|) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (<= 0 |~#d2~0.offset|) (= |~#d1~0.base| |main_#t~ret7.base|) (<= |#NULL.offset| 0) (not (= 0 |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (= |main_#t~ret7.offset| |~#d1~0.offset|) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= |#NULL.offset| 0))) (<= 0 |main_#t~ret7.offset|)) [2019-10-13 22:54:01,002 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 1246#(and (= |#NULL.base| 0) (<= 0 |~#d1~0.offset|) (<= main_~pd2~0.offset 0) (<= |#NULL.base| 0) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~pd1~0.offset) (<= main_~i~0 2147483647) (= |~#d2~0.offset| 0) (<= 0 (+ main_~i~0 2147483648)) (<= |~#d1~0.offset| 0) (<= main_~pd1~0.offset 0) (<= 0 main_~pd2~0.offset) (= |#NULL.offset| 0)) [2019-10-13 22:54:01,002 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 1295#(and (= |#NULL.base| 0) (<= main_~pd2~0.offset 0) (<= 0 |~#d1~0.offset|) (<= |#NULL.base| 0) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~pd1~0.offset) (= |~#d2~0.offset| 0) (<= |~#d1~0.offset| 0) (<= main_~pd1~0.offset 0) (<= 0 main_~pd2~0.offset) (= |#NULL.offset| 0)) [2019-10-13 22:54:01,002 INFO L193 IcfgInterpreter]: Reachable states at location get_dummyENTRY satisfy 1321#(and (<= 0 |~#d1~0.offset|) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< |~#d2~0.base| |#StackHeapBarrier|) (not (= 0 |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (= 1 (select |#valid| |~#d2~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= 0 |~#d1~0.offset|) (= |#NULL.offset| 0)) [2019-10-13 22:54:01,003 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 857#(and (<= main_~pd2~0.offset 0) (<= 0 |~#d1~0.offset|) (= |#NULL.base| 0) (<= |#NULL.base| 0) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~pd1~0.offset) (= |~#d2~0.offset| 0) (<= |~#d1~0.offset| 0) (<= main_~pd1~0.offset 0) (<= 0 main_~pd2~0.offset) (= |#NULL.offset| 0)) [2019-10-13 22:54:01,003 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 1251#(and (= |#NULL.base| 0) (<= main_~pd2~0.offset 0) (<= 0 |~#d1~0.offset|) (<= |#NULL.base| 0) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~pd1~0.offset) (= |~#d2~0.offset| 0) (<= |~#d1~0.offset| 0) (<= main_~pd1~0.offset 0) (<= 0 main_~pd2~0.offset) (= |#NULL.offset| 0)) [2019-10-13 22:54:01,003 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= 0 |~#d1~0.offset|) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#d1~0.base|)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< |~#d2~0.base| |#StackHeapBarrier|) (not (= 0 |~#d2~0.base|)) (= 1 (select |#valid| |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#d2~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= 0 |~#d1~0.offset|) (= |#NULL.offset| 0)) [2019-10-13 22:54:01,003 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= 0 |~#d1~0.offset|) (= (select |old(#memory_int)| |~#d2~0.base|) ((as const (Array Int Int)) 0)) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (< |~#d2~0.base| |#StackHeapBarrier|) (= 1 (select |#valid| |~#d2~0.base|)) (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#d1~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (= 0 |~#d1~0.offset|) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (<= 0 |~#d2~0.offset|) (<= |#NULL.offset| 0) (not (= 0 |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0)) [2019-10-13 22:54:01,004 INFO L193 IcfgInterpreter]: Reachable states at location get_dummyEXIT satisfy 1326#(and (<= |get_dummy_#res.offset| 0) (<= 0 |get_dummy_#res.offset|) (or (and (<= 0 |~#d1~0.offset|) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (= |get_dummy_#res.offset| |~#d2~0.offset|) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< |~#d2~0.base| |#StackHeapBarrier|) (not (= 0 |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (= 1 (select |#valid| |~#d2~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= 0 |~#d1~0.offset|) (= |#NULL.offset| 0) (= |get_dummy_#res.base| |~#d2~0.base|)) (and (<= 0 |~#d1~0.offset|) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (= |get_dummy_#res.offset| |~#d1~0.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< |~#d2~0.base| |#StackHeapBarrier|) (not (= 0 |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (= 1 (select |#valid| |~#d2~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= 0 |~#d1~0.offset|) (= |#NULL.offset| 0) (= |~#d1~0.base| |get_dummy_#res.base|)))) [2019-10-13 22:54:01,004 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 1335#(and (<= 0 |~#d1~0.offset|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (= |#length| (store (store |old(#length)| |~#d1~0.base| 72) |~#d2~0.base| 72)) (= |#memory_int| (store (store |old(#memory_int)| |~#d1~0.base| ((as const (Array Int Int)) 0)) |~#d2~0.base| ((as const (Array Int Int)) 0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| (store (store (store |old(#valid)| 0 0) |~#d1~0.base| 1) |~#d2~0.base| 1)) (< |~#d2~0.base| |#StackHeapBarrier|) (not (= 0 |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (< |~#d1~0.base| |#StackHeapBarrier|) (= (select (store |old(#valid)| 0 0) |~#d1~0.base|) 0) (= (select (store (store |old(#valid)| 0 0) |~#d1~0.base| 1) |~#d2~0.base|) 0) (= 0 |~#d1~0.offset|) (= |#NULL.offset| 0)) [2019-10-13 22:54:01,004 INFO L193 IcfgInterpreter]: Reachable states at location checkEXIT satisfy 1317#(and (= |#NULL.base| 0) (<= 0 |~#d1~0.offset|) (= |check_#in~i| check_~i) (= (ite (= (select (select |#memory_int| check_~s1.base) (+ (* check_~i 4) check_~s1.offset 8)) check_~i) 1 0) |check_#res|) (<= check_~s1.offset 0) (<= |#NULL.base| 0) (<= |check_#in~s1.offset| 0) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |check_#res|) (<= 0 |check_#in~s1.offset|) (<= |check_#res| 1) (= |~#d2~0.offset| 0) (<= |~#d1~0.offset| 0) (= |check_#in~s1.base| check_~s1.base) (<= 0 check_~s1.offset) (= check_~s1.offset |check_#in~s1.offset|) (= |#NULL.offset| 0)) [2019-10-13 22:54:01,004 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:54:01,005 INFO L193 IcfgInterpreter]: Reachable states at location L40-1 satisfy 1290#(and (= |#NULL.base| 0) (<= main_~pd2~0.offset 0) (<= 0 |~#d1~0.offset|) (<= |#NULL.base| 0) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~pd1~0.offset) (= |~#d2~0.offset| 0) (<= |~#d1~0.offset| 0) (<= main_~pd1~0.offset 0) (<= 0 main_~pd2~0.offset) (= |#NULL.offset| 0)) [2019-10-13 22:54:01,005 INFO L193 IcfgInterpreter]: Reachable states at location initEXIT satisfy 1344#(exists ((|v_init_#t~nondet2_11| Int) (|v_init_#t~nondet0_11| Int) (|v_init_#t~nondet3_11| Int) (|v_init_#t~nondet1_11| Int)) (and (<= 0 |~#d1~0.offset|) (= (select |old(#memory_int)| |~#d2~0.base|) ((as const (Array Int Int)) 0)) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (<= |v_init_#t~nondet2_11| 2147483647) (<= 0 |#NULL.offset|) (<= 0 (+ |v_init_#t~nondet0_11| 2147483648)) (<= |v_init_#t~nondet3_11| 2147483647) (< |~#d2~0.base| |#StackHeapBarrier|) (= 1 (select |#valid| |~#d2~0.base|)) (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#d1~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (<= 0 (+ |v_init_#t~nondet3_11| 2147483648)) (= 0 |~#d1~0.offset|) (<= 0 (+ |v_init_#t~nondet2_11| 2147483648)) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (<= 0 |~#d2~0.offset|) (<= |#NULL.offset| 0) (<= |v_init_#t~nondet0_11| 2147483647) (not (= 0 |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (<= 0 (+ |v_init_#t~nondet1_11| 2147483648)) (<= |v_init_#t~nondet1_11| 2147483647) (= |#NULL.offset| 0) (= |#memory_int| (store (store |old(#memory_int)| |~#d1~0.base| (store (store (select |old(#memory_int)| |~#d1~0.base|) |~#d1~0.offset| |v_init_#t~nondet0_11|) (+ |~#d1~0.offset| 4) |v_init_#t~nondet1_11|)) |~#d2~0.base| (store (store (select (store |old(#memory_int)| |~#d1~0.base| (store (store (select |old(#memory_int)| |~#d1~0.base|) |~#d1~0.offset| |v_init_#t~nondet0_11|) (+ |~#d1~0.offset| 4) |v_init_#t~nondet1_11|)) |~#d2~0.base|) |~#d2~0.offset| |v_init_#t~nondet2_11|) (+ |~#d2~0.offset| 4) |v_init_#t~nondet3_11|))))) [2019-10-13 22:54:01,005 INFO L193 IcfgInterpreter]: Reachable states at location checkENTRY satisfy 1312#(and (= |#NULL.base| 0) (<= 0 |~#d1~0.offset|) (<= |#NULL.base| 0) (<= |check_#in~s1.offset| 0) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |check_#in~s1.offset|) (= |~#d2~0.offset| 0) (<= |~#d1~0.offset| 0) (= |#NULL.offset| 0)) [2019-10-13 22:54:01,006 INFO L193 IcfgInterpreter]: Reachable states at location L43-1 satisfy 1164#(and (= |#NULL.base| 0) (<= main_~pd2~0.offset 0) (<= 0 |~#d1~0.offset|) (<= |main_#t~ret13| 1) (<= |#NULL.base| 0) (= |~#d1~0.offset| 0) (<= 0 |main_#t~ret13|) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~pd1~0.offset) (= |~#d2~0.offset| 0) (<= |~#d1~0.offset| 0) (<= main_~pd1~0.offset 0) (<= 0 main_~pd2~0.offset) (= |#NULL.offset| 0)) [2019-10-13 22:54:01,006 INFO L193 IcfgInterpreter]: Reachable states at location L34-2 satisfy 1233#(and (= |#NULL.base| 0) (<= 0 |~#d1~0.offset|) (<= |#NULL.base| 0) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~pd1~0.offset) (= |~#d2~0.offset| 0) (<= |~#d1~0.offset| 0) (<= main_~pd1~0.offset 0) (<= |main_#t~ret8.offset| 0) (= |#NULL.offset| 0) (<= 0 |main_#t~ret8.offset|)) [2019-10-13 22:54:01,253 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-10-13 22:54:01,404 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-10-13 22:54:01,549 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-10-13 22:54:14,222 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-10-13 22:54:16,638 WARN L191 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-10-13 22:54:19,004 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-10-13 22:54:19,552 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:54:19,553 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5, 16] total 34 [2019-10-13 22:54:19,553 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419864302] [2019-10-13 22:54:19,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-13 22:54:19,555 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:54:19,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-13 22:54:19,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=981, Unknown=11, NotChecked=0, Total=1122 [2019-10-13 22:54:19,556 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 34 states.