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/array-crafted/bAnd4.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:29:41,295 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:29:41,298 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:29:41,312 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:29:41,313 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:29:41,314 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:29:41,315 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:29:41,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:29:41,319 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:29:41,320 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:29:41,321 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:29:41,322 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:29:41,322 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:29:41,323 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:29:41,324 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:29:41,326 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:29:41,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:29:41,328 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:29:41,331 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:29:41,334 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:29:41,339 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:29:41,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:29:41,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:29:41,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:29:41,344 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:29:41,344 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:29:41,345 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:29:41,346 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:29:41,346 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:29:41,347 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:29:41,347 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:29:41,348 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:29:41,349 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:29:41,349 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:29:41,353 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:29:41,353 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:29:41,354 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:29:41,354 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:29:41,354 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:29:41,355 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:29:41,356 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:29:41,357 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-15 01:29:41,372 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:29:41,373 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:29:41,377 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:29:41,377 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:29:41,378 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:29:41,378 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:29:41,378 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:29:41,379 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:29:41,379 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:29:41,379 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:29:41,380 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:29:41,381 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:29:41,381 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:29:41,381 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:29:41,381 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:29:41,382 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:29:41,382 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:29:41,382 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:29:41,382 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:29:41,382 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:29:41,383 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:29:41,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:29:41,383 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:29:41,384 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:29:41,384 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:29:41,384 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:29:41,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:29:41,385 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:29:41,385 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-15 01:29:41,663 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:29:41,676 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:29:41,680 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:29:41,681 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:29:41,682 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:29:41,682 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/bAnd4.i [2019-10-15 01:29:41,746 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c5d33592/057525c7d4a144da87c1c2524dcb0f93/FLAG8769a17da [2019-10-15 01:29:42,189 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:29:42,191 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/bAnd4.i [2019-10-15 01:29:42,197 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c5d33592/057525c7d4a144da87c1c2524dcb0f93/FLAG8769a17da [2019-10-15 01:29:42,600 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c5d33592/057525c7d4a144da87c1c2524dcb0f93 [2019-10-15 01:29:42,612 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:29:42,614 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:29:42,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:29:42,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:29:42,619 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:29:42,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:29:42" (1/1) ... [2019-10-15 01:29:42,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40ea140a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42, skipping insertion in model container [2019-10-15 01:29:42,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:29:42" (1/1) ... [2019-10-15 01:29:42,633 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:29:42,655 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:29:42,856 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:29:42,866 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:29:42,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:29:42,997 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:29:42,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42 WrapperNode [2019-10-15 01:29:42,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:29:42,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:29:42,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:29:42,999 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:29:43,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42" (1/1) ... [2019-10-15 01:29:43,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42" (1/1) ... [2019-10-15 01:29:43,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42" (1/1) ... [2019-10-15 01:29:43,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42" (1/1) ... [2019-10-15 01:29:43,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42" (1/1) ... [2019-10-15 01:29:43,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42" (1/1) ... [2019-10-15 01:29:43,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42" (1/1) ... [2019-10-15 01:29:43,054 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:29:43,055 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:29:43,055 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:29:43,055 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:29:43,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42" (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-15 01:29:43,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:29:43,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:29:43,117 INFO L138 BoogieDeclarations]: Found implementation of procedure bAnd [2019-10-15 01:29:43,117 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:29:43,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:29:43,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:29:43,118 INFO L130 BoogieDeclarations]: Found specification of procedure bAnd [2019-10-15 01:29:43,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:29:43,118 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:29:43,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:29:43,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:29:43,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:29:43,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:29:43,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:29:43,530 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:29:43,531 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-15 01:29:43,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:29:43 BoogieIcfgContainer [2019-10-15 01:29:43,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:29:43,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:29:43,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:29:43,537 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:29:43,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:29:42" (1/3) ... [2019-10-15 01:29:43,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@355e7799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:29:43, skipping insertion in model container [2019-10-15 01:29:43,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42" (2/3) ... [2019-10-15 01:29:43,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@355e7799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:29:43, skipping insertion in model container [2019-10-15 01:29:43,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:29:43" (3/3) ... [2019-10-15 01:29:43,541 INFO L109 eAbstractionObserver]: Analyzing ICFG bAnd4.i [2019-10-15 01:29:43,551 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:29:43,559 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:29:43,571 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:29:43,596 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:29:43,596 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:29:43,596 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:29:43,596 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:29:43,597 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:29:43,597 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:29:43,597 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:29:43,597 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:29:43,616 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-15 01:29:43,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:29:43,623 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:43,624 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:43,626 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:43,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:43,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1674969442, now seen corresponding path program 1 times [2019-10-15 01:29:43,640 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:43,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62733837] [2019-10-15 01:29:43,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:43,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:43,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:43,910 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:29:43,911 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62733837] [2019-10-15 01:29:43,912 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:43,913 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:29:43,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814005149] [2019-10-15 01:29:43,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:43,922 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:43,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:43,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:43,944 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-10-15 01:29:43,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:43,997 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2019-10-15 01:29:43,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:43,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 01:29:44,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:44,011 INFO L225 Difference]: With dead ends: 41 [2019-10-15 01:29:44,012 INFO L226 Difference]: Without dead ends: 20 [2019-10-15 01:29:44,018 INFO L600 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 [2019-10-15 01:29:44,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-15 01:29:44,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-15 01:29:44,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-15 01:29:44,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-15 01:29:44,073 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 24 [2019-10-15 01:29:44,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:44,074 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-15 01:29:44,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:44,074 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-10-15 01:29:44,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:29:44,078 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:44,079 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:44,079 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:44,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:44,080 INFO L82 PathProgramCache]: Analyzing trace with hash -2035795135, now seen corresponding path program 1 times [2019-10-15 01:29:44,080 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:44,081 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620081734] [2019-10-15 01:29:44,081 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:44,081 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:44,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:44,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:29:44,191 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620081734] [2019-10-15 01:29:44,191 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597846582] [2019-10-15 01:29:44,191 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-15 01:29:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:44,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:29:44,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:44,299 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:29:44,299 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:44,362 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:29:44,362 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:29:44,363 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2019-10-15 01:29:44,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751898259] [2019-10-15 01:29:44,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:44,365 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:44,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:44,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:44,366 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-10-15 01:29:44,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:44,377 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-10-15 01:29:44,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:44,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:29:44,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:44,379 INFO L225 Difference]: With dead ends: 33 [2019-10-15 01:29:44,379 INFO L226 Difference]: Without dead ends: 21 [2019-10-15 01:29:44,380 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:44,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-15 01:29:44,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-15 01:29:44,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-15 01:29:44,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-15 01:29:44,387 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 25 [2019-10-15 01:29:44,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:44,388 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-15 01:29:44,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:44,388 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-15 01:29:44,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 01:29:44,389 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:44,390 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:44,595 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:44,595 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:44,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:44,596 INFO L82 PathProgramCache]: Analyzing trace with hash -629127273, now seen corresponding path program 1 times [2019-10-15 01:29:44,597 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:44,597 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76662114] [2019-10-15 01:29:44,597 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:44,598 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:44,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:44,687 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:29:44,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76662114] [2019-10-15 01:29:44,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:44,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:29:44,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656797970] [2019-10-15 01:29:44,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:44,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:44,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:44,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:44,691 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-10-15 01:29:44,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:44,711 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-10-15 01:29:44,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:44,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-15 01:29:44,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:44,714 INFO L225 Difference]: With dead ends: 31 [2019-10-15 01:29:44,714 INFO L226 Difference]: Without dead ends: 22 [2019-10-15 01:29:44,715 INFO L600 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 [2019-10-15 01:29:44,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-15 01:29:44,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-15 01:29:44,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-15 01:29:44,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-15 01:29:44,725 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 28 [2019-10-15 01:29:44,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:44,734 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-15 01:29:44,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:44,736 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-10-15 01:29:44,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:29:44,737 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:44,738 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:44,738 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:44,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:44,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1942163656, now seen corresponding path program 1 times [2019-10-15 01:29:44,742 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:44,742 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113648516] [2019-10-15 01:29:44,742 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:44,742 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:44,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:44,849 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:29:44,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113648516] [2019-10-15 01:29:44,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700809530] [2019-10-15 01:29:44,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:44,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:29:44,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:44,928 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:29:44,929 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:44,968 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:29:44,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1791501158] [2019-10-15 01:29:44,996 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:29:44,996 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:29:45,003 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:29:45,011 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:29:45,012 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:29:45,191 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:29:47,161 INFO L199 IcfgInterpreter]: Interpreting procedure bAnd with input of size 1 for LOIs [2019-10-15 01:29:47,195 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:29:47,199 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:29:47,590 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:29:47,590 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-15 01:29:47,590 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586992385] [2019-10-15 01:29:47,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-15 01:29:47,592 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:47,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-15 01:29:47,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:29:47,595 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 18 states. [2019-10-15 01:29:48,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:48,268 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2019-10-15 01:29:48,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 01:29:48,268 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-10-15 01:29:48,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:48,272 INFO L225 Difference]: With dead ends: 40 [2019-10-15 01:29:48,272 INFO L226 Difference]: Without dead ends: 25 [2019-10-15 01:29:48,273 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2019-10-15 01:29:48,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-15 01:29:48,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-15 01:29:48,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-15 01:29:48,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-10-15 01:29:48,279 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 29 [2019-10-15 01:29:48,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:48,280 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-10-15 01:29:48,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-15 01:29:48,280 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-10-15 01:29:48,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-15 01:29:48,281 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:48,281 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:48,486 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:48,486 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:48,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:48,487 INFO L82 PathProgramCache]: Analyzing trace with hash 143191253, now seen corresponding path program 2 times [2019-10-15 01:29:48,487 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:48,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664492831] [2019-10-15 01:29:48,488 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:48,488 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:48,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:29:48,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664492831] [2019-10-15 01:29:48,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890224576] [2019-10-15 01:29:48,576 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:48,666 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-15 01:29:48,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:29:48,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:29:48,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:48,688 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:29:48,688 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:48,718 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:29:48,719 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [567112338] [2019-10-15 01:29:48,722 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:29:48,723 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:29:48,723 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:29:48,724 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:29:48,724 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:29:48,750 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:29:50,339 INFO L199 IcfgInterpreter]: Interpreting procedure bAnd with input of size 1 for LOIs [2019-10-15 01:29:50,375 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:29:50,381 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:29:50,765 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:29:50,766 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4, 11] total 21 [2019-10-15 01:29:50,766 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318531842] [2019-10-15 01:29:50,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-15 01:29:50,769 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:50,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-15 01:29:50,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-10-15 01:29:50,771 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 22 states. [2019-10-15 01:29:51,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:51,678 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2019-10-15 01:29:51,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-15 01:29:51,678 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-10-15 01:29:51,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:51,680 INFO L225 Difference]: With dead ends: 44 [2019-10-15 01:29:51,680 INFO L226 Difference]: Without dead ends: 29 [2019-10-15 01:29:51,681 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=210, Invalid=1272, Unknown=0, NotChecked=0, Total=1482 [2019-10-15 01:29:51,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-15 01:29:51,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-15 01:29:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-15 01:29:51,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-15 01:29:51,688 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 32 [2019-10-15 01:29:51,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:51,688 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-15 01:29:51,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-15 01:29:51,689 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-15 01:29:51,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 01:29:51,690 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:51,690 INFO L380 BasicCegarLoop]: trace histogram [12, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:51,894 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:51,895 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:51,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:51,895 INFO L82 PathProgramCache]: Analyzing trace with hash 766317228, now seen corresponding path program 3 times [2019-10-15 01:29:51,896 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:51,896 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780321969] [2019-10-15 01:29:51,896 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:51,896 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:51,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:51,993 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 01:29:51,994 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780321969] [2019-10-15 01:29:51,994 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413685403] [2019-10-15 01:29:51,994 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:52,103 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 01:29:52,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:29:52,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-15 01:29:52,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:52,125 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 01:29:52,125 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:52,193 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 01:29:52,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [682280958] [2019-10-15 01:29:52,194 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:29:52,195 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:29:52,195 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:29:52,195 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:29:52,196 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:29:52,213 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:29:53,610 INFO L199 IcfgInterpreter]: Interpreting procedure bAnd with input of size 1 for LOIs [2019-10-15 01:29:53,634 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:29:53,637 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:29:54,048 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:29:54,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 25 [2019-10-15 01:29:54,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934577183] [2019-10-15 01:29:54,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-15 01:29:54,051 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:54,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-15 01:29:54,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2019-10-15 01:29:54,054 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 26 states. [2019-10-15 01:29:55,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:55,321 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2019-10-15 01:29:55,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-15 01:29:55,322 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 42 [2019-10-15 01:29:55,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:55,323 INFO L225 Difference]: With dead ends: 54 [2019-10-15 01:29:55,323 INFO L226 Difference]: Without dead ends: 36 [2019-10-15 01:29:55,327 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=369, Invalid=1701, Unknown=0, NotChecked=0, Total=2070 [2019-10-15 01:29:55,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-15 01:29:55,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-15 01:29:55,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-15 01:29:55,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-15 01:29:55,354 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 42 [2019-10-15 01:29:55,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:55,354 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-15 01:29:55,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-15 01:29:55,355 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-15 01:29:55,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 01:29:55,357 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:55,357 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:55,573 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:55,574 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:55,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:55,575 INFO L82 PathProgramCache]: Analyzing trace with hash 615727983, now seen corresponding path program 4 times [2019-10-15 01:29:55,575 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:55,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887352865] [2019-10-15 01:29:55,575 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:55,576 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:55,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:55,884 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 01:29:55,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887352865] [2019-10-15 01:29:55,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171288574] [2019-10-15 01:29:55,885 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:56,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-15 01:29:56,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:56,055 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 01:29:56,055 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:56,317 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 01:29:56,317 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1255609030] [2019-10-15 01:29:56,319 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:29:56,319 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:29:56,319 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:29:56,320 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:29:56,320 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:29:56,336 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:29:57,601 INFO L199 IcfgInterpreter]: Interpreting procedure bAnd with input of size 1 for LOIs [2019-10-15 01:29:57,623 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:29:57,626 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:29:58,038 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:29:58,038 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 39 [2019-10-15 01:29:58,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780761137] [2019-10-15 01:29:58,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-15 01:29:58,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:58,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-15 01:29:58,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1125, Unknown=0, NotChecked=0, Total=1560 [2019-10-15 01:29:58,042 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 40 states. [2019-10-15 01:29:59,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:59,567 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2019-10-15 01:29:59,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-15 01:29:59,567 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 49 [2019-10-15 01:29:59,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:59,569 INFO L225 Difference]: With dead ends: 68 [2019-10-15 01:29:59,569 INFO L226 Difference]: Without dead ends: 50 [2019-10-15 01:29:59,571 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1364 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1244, Invalid=4158, Unknown=0, NotChecked=0, Total=5402 [2019-10-15 01:29:59,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-15 01:29:59,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-10-15 01:29:59,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-15 01:29:59,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-10-15 01:29:59,580 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 49 [2019-10-15 01:29:59,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:59,580 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-10-15 01:29:59,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-15 01:29:59,580 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-10-15 01:29:59,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-15 01:29:59,581 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:59,583 INFO L380 BasicCegarLoop]: trace histogram [26, 12, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:59,786 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:59,787 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:59,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:59,787 INFO L82 PathProgramCache]: Analyzing trace with hash 2121294031, now seen corresponding path program 5 times [2019-10-15 01:29:59,788 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:59,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975321451] [2019-10-15 01:29:59,788 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:59,788 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:59,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:00,219 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 01:30:00,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975321451] [2019-10-15 01:30:00,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270293101] [2019-10-15 01:30:00,220 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:00,394 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-15 01:30:00,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:00,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:30:00,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:00,449 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 54 proven. 1 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-10-15 01:30:00,449 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:00,508 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2019-10-15 01:30:00,509 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1828204689] [2019-10-15 01:30:00,511 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:30:00,511 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:00,511 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:00,512 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:00,512 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:00,530 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:30:01,910 INFO L199 IcfgInterpreter]: Interpreting procedure bAnd with input of size 1 for LOIs [2019-10-15 01:30:01,933 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:30:01,936 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:02,478 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:02,478 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 4, 4, 11] total 43 [2019-10-15 01:30:02,479 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174824362] [2019-10-15 01:30:02,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-15 01:30:02,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:02,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-15 01:30:02,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=1443, Unknown=0, NotChecked=0, Total=1892 [2019-10-15 01:30:02,482 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 44 states. [2019-10-15 01:30:04,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:04,497 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2019-10-15 01:30:04,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-15 01:30:04,497 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 63 [2019-10-15 01:30:04,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:04,499 INFO L225 Difference]: With dead ends: 72 [2019-10-15 01:30:04,499 INFO L226 Difference]: Without dead ends: 54 [2019-10-15 01:30:04,502 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1350 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1349, Invalid=5457, Unknown=0, NotChecked=0, Total=6806 [2019-10-15 01:30:04,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-15 01:30:04,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-10-15 01:30:04,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-15 01:30:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-10-15 01:30:04,510 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 63 [2019-10-15 01:30:04,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:04,511 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-10-15 01:30:04,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-15 01:30:04,511 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-10-15 01:30:04,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-15 01:30:04,512 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:04,512 INFO L380 BasicCegarLoop]: trace histogram [27, 12, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:04,716 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:04,716 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:04,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:04,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1728770399, now seen corresponding path program 6 times [2019-10-15 01:30:04,717 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:04,717 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731914310] [2019-10-15 01:30:04,717 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:04,718 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:04,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:05,169 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-15 01:30:05,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731914310] [2019-10-15 01:30:05,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085605955] [2019-10-15 01:30:05,169 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:05,400 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 01:30:05,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:05,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-15 01:30:05,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:05,420 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-15 01:30:05,420 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:06,421 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-15 01:30:06,421 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1778008550] [2019-10-15 01:30:06,422 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:30:06,423 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:06,423 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:06,423 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:06,423 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:06,446 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:30:07,596 INFO L199 IcfgInterpreter]: Interpreting procedure bAnd with input of size 1 for LOIs [2019-10-15 01:30:07,629 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:30:07,631 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:08,223 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:08,224 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30, 11] total 69 [2019-10-15 01:30:08,224 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798100785] [2019-10-15 01:30:08,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-15 01:30:08,225 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:08,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-15 01:30:08,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1740, Invalid=3090, Unknown=0, NotChecked=0, Total=4830 [2019-10-15 01:30:08,231 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 70 states. [2019-10-15 01:30:11,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:11,802 INFO L93 Difference]: Finished difference Result 104 states and 140 transitions. [2019-10-15 01:30:11,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-10-15 01:30:11,802 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 67 [2019-10-15 01:30:11,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:11,804 INFO L225 Difference]: With dead ends: 104 [2019-10-15 01:30:11,804 INFO L226 Difference]: Without dead ends: 83 [2019-10-15 01:30:11,809 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3929 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5099, Invalid=12723, Unknown=0, NotChecked=0, Total=17822 [2019-10-15 01:30:11,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-15 01:30:11,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-10-15 01:30:11,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-15 01:30:11,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-10-15 01:30:11,819 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 67 [2019-10-15 01:30:11,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:11,819 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2019-10-15 01:30:11,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-15 01:30:11,819 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2019-10-15 01:30:11,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 01:30:11,820 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:11,821 INFO L380 BasicCegarLoop]: trace histogram [56, 12, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:12,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:12,025 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:12,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:12,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1695588190, now seen corresponding path program 7 times [2019-10-15 01:30:12,026 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:12,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461719323] [2019-10-15 01:30:12,026 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:12,027 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:12,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:13,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-15 01:30:13,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461719323] [2019-10-15 01:30:13,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453276452] [2019-10-15 01:30:13,462 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:13,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-15 01:30:13,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:13,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-15 01:30:13,743 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:17,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-15 01:30:17,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [513187920] [2019-10-15 01:30:17,232 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:30:17,232 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:17,232 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:17,232 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:17,233 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:17,243 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs