/usr/bin/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/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 04:42:29,760 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 04:42:29,763 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 04:42:29,781 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 04:42:29,782 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 04:42:29,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 04:42:29,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 04:42:29,794 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 04:42:29,796 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 04:42:29,796 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 04:42:29,798 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 04:42:29,799 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 04:42:29,799 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 04:42:29,800 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 04:42:29,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 04:42:29,802 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 04:42:29,803 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 04:42:29,804 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 04:42:29,805 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 04:42:29,807 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 04:42:29,809 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 04:42:29,810 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 04:42:29,811 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 04:42:29,811 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 04:42:29,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 04:42:29,814 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 04:42:29,814 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 04:42:29,815 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 04:42:29,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 04:42:29,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 04:42:29,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 04:42:29,817 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 04:42:29,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 04:42:29,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 04:42:29,820 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 04:42:29,820 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 04:42:29,821 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 04:42:29,821 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 04:42:29,821 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 04:42:29,822 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 04:42:29,823 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 04:42:29,823 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-11-07 04:42:29,844 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 04:42:29,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 04:42:29,846 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 04:42:29,846 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 04:42:29,846 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 04:42:29,846 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 04:42:29,846 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 04:42:29,847 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 04:42:29,847 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 04:42:29,847 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 04:42:29,848 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 04:42:29,848 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 04:42:29,848 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 04:42:29,849 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 04:42:29,849 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 04:42:29,849 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 04:42:29,849 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 04:42:29,849 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 04:42:29,850 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 04:42:29,850 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 04:42:29,850 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 04:42:29,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:42:29,850 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 04:42:29,851 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 04:42:29,851 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 04:42:29,851 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 04:42:29,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 04:42:29,851 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 04:42:29,852 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-11-07 04:42:30,122 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 04:42:30,137 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 04:42:30,142 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 04:42:30,143 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 04:42:30,143 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 04:42:30,144 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-11-07 04:42:30,215 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04287e4a7/901ee91d2910460c83bad28718b01dbe/FLAG4080034d7 [2019-11-07 04:42:30,732 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 04:42:30,733 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-11-07 04:42:30,745 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04287e4a7/901ee91d2910460c83bad28718b01dbe/FLAG4080034d7 [2019-11-07 04:42:31,045 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04287e4a7/901ee91d2910460c83bad28718b01dbe [2019-11-07 04:42:31,066 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 04:42:31,067 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 04:42:31,069 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 04:42:31,070 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 04:42:31,078 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 04:42:31,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:42:31" (1/1) ... [2019-11-07 04:42:31,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53802932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:31, skipping insertion in model container [2019-11-07 04:42:31,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:42:31" (1/1) ... [2019-11-07 04:42:31,106 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 04:42:31,190 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 04:42:31,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:42:31,596 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 04:42:31,675 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:42:31,699 INFO L192 MainTranslator]: Completed translation [2019-11-07 04:42:31,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:31 WrapperNode [2019-11-07 04:42:31,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 04:42:31,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 04:42:31,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 04:42:31,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 04:42:31,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:31" (1/1) ... [2019-11-07 04:42:31,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:31" (1/1) ... [2019-11-07 04:42:31,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:31" (1/1) ... [2019-11-07 04:42:31,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:31" (1/1) ... [2019-11-07 04:42:31,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:31" (1/1) ... [2019-11-07 04:42:31,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:31" (1/1) ... [2019-11-07 04:42:31,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:31" (1/1) ... [2019-11-07 04:42:31,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 04:42:31,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 04:42:31,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 04:42:31,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 04:42:31,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:31" (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-11-07 04:42:31,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 04:42:31,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 04:42:31,827 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 04:42:31,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 04:42:31,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 04:42:31,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-11-07 04:42:31,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 04:42:31,829 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 04:42:31,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 04:42:31,829 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 04:42:31,829 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 04:42:31,830 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 04:42:31,830 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 04:42:31,830 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 04:42:31,830 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 04:42:31,830 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 04:42:31,833 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 04:42:31,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 04:42:31,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 04:42:33,412 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 04:42:33,412 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 04:42:33,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:42:33 BoogieIcfgContainer [2019-11-07 04:42:33,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 04:42:33,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 04:42:33,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 04:42:33,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 04:42:33,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:42:31" (1/3) ... [2019-11-07 04:42:33,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb4426c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:42:33, skipping insertion in model container [2019-11-07 04:42:33,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:31" (2/3) ... [2019-11-07 04:42:33,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb4426c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:42:33, skipping insertion in model container [2019-11-07 04:42:33,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:42:33" (3/3) ... [2019-11-07 04:42:33,433 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-11-07 04:42:33,445 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 04:42:33,456 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 04:42:33,468 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 04:42:33,498 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 04:42:33,499 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 04:42:33,499 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 04:42:33,499 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 04:42:33,499 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 04:42:33,500 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 04:42:33,500 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 04:42:33,500 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 04:42:33,529 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2019-11-07 04:42:33,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-07 04:42:33,539 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:33,541 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:33,543 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:33,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:33,550 INFO L82 PathProgramCache]: Analyzing trace with hash 2138769479, now seen corresponding path program 1 times [2019-11-07 04:42:33,560 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:33,561 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112994462] [2019-11-07 04:42:33,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:34,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:34,066 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112994462] [2019-11-07 04:42:34,067 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:34,068 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:34,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166769270] [2019-11-07 04:42:34,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:34,076 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:34,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:34,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:34,096 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2019-11-07 04:42:34,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:34,212 INFO L93 Difference]: Finished difference Result 220 states and 356 transitions. [2019-11-07 04:42:34,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:34,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-07 04:42:34,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:34,236 INFO L225 Difference]: With dead ends: 220 [2019-11-07 04:42:34,237 INFO L226 Difference]: Without dead ends: 144 [2019-11-07 04:42:34,244 INFO L630 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-11-07 04:42:34,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-07 04:42:34,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2019-11-07 04:42:34,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-07 04:42:34,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 213 transitions. [2019-11-07 04:42:34,351 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 213 transitions. Word has length 41 [2019-11-07 04:42:34,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:34,351 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 213 transitions. [2019-11-07 04:42:34,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:34,352 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 213 transitions. [2019-11-07 04:42:34,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-07 04:42:34,356 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:34,356 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:34,356 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:34,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:34,358 INFO L82 PathProgramCache]: Analyzing trace with hash 2105877559, now seen corresponding path program 1 times [2019-11-07 04:42:34,358 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:34,358 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6747708] [2019-11-07 04:42:34,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:34,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:34,619 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6747708] [2019-11-07 04:42:34,620 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:34,620 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:34,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014747013] [2019-11-07 04:42:34,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:34,622 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:34,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:34,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:34,623 INFO L87 Difference]: Start difference. First operand 142 states and 213 transitions. Second operand 3 states. [2019-11-07 04:42:34,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:34,719 INFO L93 Difference]: Finished difference Result 319 states and 500 transitions. [2019-11-07 04:42:34,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:34,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-07 04:42:34,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:34,726 INFO L225 Difference]: With dead ends: 319 [2019-11-07 04:42:34,727 INFO L226 Difference]: Without dead ends: 207 [2019-11-07 04:42:34,730 INFO L630 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-11-07 04:42:34,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-11-07 04:42:34,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2019-11-07 04:42:34,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-07 04:42:34,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 312 transitions. [2019-11-07 04:42:34,783 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 312 transitions. Word has length 43 [2019-11-07 04:42:34,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:34,783 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 312 transitions. [2019-11-07 04:42:34,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:34,784 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 312 transitions. [2019-11-07 04:42:34,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-07 04:42:34,787 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:34,788 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:34,788 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:34,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:34,789 INFO L82 PathProgramCache]: Analyzing trace with hash -486820712, now seen corresponding path program 1 times [2019-11-07 04:42:34,790 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:34,791 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464390501] [2019-11-07 04:42:34,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:34,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:34,912 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464390501] [2019-11-07 04:42:34,912 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:34,912 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:34,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302434657] [2019-11-07 04:42:34,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:34,914 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:34,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:34,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:34,914 INFO L87 Difference]: Start difference. First operand 205 states and 312 transitions. Second operand 3 states. [2019-11-07 04:42:34,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:34,971 INFO L93 Difference]: Finished difference Result 509 states and 803 transitions. [2019-11-07 04:42:34,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:34,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-07 04:42:34,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:34,976 INFO L225 Difference]: With dead ends: 509 [2019-11-07 04:42:34,982 INFO L226 Difference]: Without dead ends: 336 [2019-11-07 04:42:34,985 INFO L630 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-11-07 04:42:34,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-07 04:42:35,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-11-07 04:42:35,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-07 04:42:35,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 519 transitions. [2019-11-07 04:42:35,028 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 519 transitions. Word has length 45 [2019-11-07 04:42:35,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:35,029 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 519 transitions. [2019-11-07 04:42:35,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:35,029 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 519 transitions. [2019-11-07 04:42:35,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-07 04:42:35,033 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:35,033 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:35,033 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:35,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:35,034 INFO L82 PathProgramCache]: Analyzing trace with hash 219909761, now seen corresponding path program 1 times [2019-11-07 04:42:35,034 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:35,034 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3170475] [2019-11-07 04:42:35,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:35,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:35,151 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3170475] [2019-11-07 04:42:35,152 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:35,153 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:35,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436456663] [2019-11-07 04:42:35,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:35,154 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:35,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:35,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:35,155 INFO L87 Difference]: Start difference. First operand 334 states and 519 transitions. Second operand 3 states. [2019-11-07 04:42:35,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:35,211 INFO L93 Difference]: Finished difference Result 825 states and 1310 transitions. [2019-11-07 04:42:35,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:35,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-11-07 04:42:35,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:35,219 INFO L225 Difference]: With dead ends: 825 [2019-11-07 04:42:35,219 INFO L226 Difference]: Without dead ends: 523 [2019-11-07 04:42:35,225 INFO L630 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-11-07 04:42:35,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-11-07 04:42:35,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 521. [2019-11-07 04:42:35,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2019-11-07 04:42:35,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 819 transitions. [2019-11-07 04:42:35,266 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 819 transitions. Word has length 47 [2019-11-07 04:42:35,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:35,268 INFO L462 AbstractCegarLoop]: Abstraction has 521 states and 819 transitions. [2019-11-07 04:42:35,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:35,269 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 819 transitions. [2019-11-07 04:42:35,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-07 04:42:35,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:35,278 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:35,278 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:35,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:35,279 INFO L82 PathProgramCache]: Analyzing trace with hash -82051422, now seen corresponding path program 1 times [2019-11-07 04:42:35,279 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:35,280 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95027583] [2019-11-07 04:42:35,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:35,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:35,394 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95027583] [2019-11-07 04:42:35,395 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:35,395 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:35,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722067171] [2019-11-07 04:42:35,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:35,396 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:35,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:35,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:35,397 INFO L87 Difference]: Start difference. First operand 521 states and 819 transitions. Second operand 3 states. [2019-11-07 04:42:35,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:35,463 INFO L93 Difference]: Finished difference Result 1341 states and 2138 transitions. [2019-11-07 04:42:35,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:35,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-07 04:42:35,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:35,471 INFO L225 Difference]: With dead ends: 1341 [2019-11-07 04:42:35,472 INFO L226 Difference]: Without dead ends: 868 [2019-11-07 04:42:35,474 INFO L630 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-11-07 04:42:35,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2019-11-07 04:42:35,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 866. [2019-11-07 04:42:35,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2019-11-07 04:42:35,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1365 transitions. [2019-11-07 04:42:35,531 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1365 transitions. Word has length 49 [2019-11-07 04:42:35,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:35,535 INFO L462 AbstractCegarLoop]: Abstraction has 866 states and 1365 transitions. [2019-11-07 04:42:35,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:35,535 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1365 transitions. [2019-11-07 04:42:35,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-07 04:42:35,539 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:35,540 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:35,540 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:35,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:35,540 INFO L82 PathProgramCache]: Analyzing trace with hash -2105773738, now seen corresponding path program 1 times [2019-11-07 04:42:35,541 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:35,541 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667489148] [2019-11-07 04:42:35,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:35,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:35,661 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667489148] [2019-11-07 04:42:35,662 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:35,662 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:35,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281477175] [2019-11-07 04:42:35,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:35,663 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:35,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:35,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:35,665 INFO L87 Difference]: Start difference. First operand 866 states and 1365 transitions. Second operand 3 states. [2019-11-07 04:42:35,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:35,758 INFO L93 Difference]: Finished difference Result 2173 states and 3461 transitions. [2019-11-07 04:42:35,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:35,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-07 04:42:35,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:35,767 INFO L225 Difference]: With dead ends: 2173 [2019-11-07 04:42:35,767 INFO L226 Difference]: Without dead ends: 1355 [2019-11-07 04:42:35,770 INFO L630 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-11-07 04:42:35,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2019-11-07 04:42:35,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1353. [2019-11-07 04:42:35,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1353 states. [2019-11-07 04:42:35,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 2142 transitions. [2019-11-07 04:42:35,844 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 2142 transitions. Word has length 51 [2019-11-07 04:42:35,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:35,844 INFO L462 AbstractCegarLoop]: Abstraction has 1353 states and 2142 transitions. [2019-11-07 04:42:35,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:35,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 2142 transitions. [2019-11-07 04:42:35,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-07 04:42:35,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:35,846 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:35,846 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:35,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:35,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1506952457, now seen corresponding path program 1 times [2019-11-07 04:42:35,847 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:35,847 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611744962] [2019-11-07 04:42:35,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:35,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:35,956 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611744962] [2019-11-07 04:42:35,956 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:35,956 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:42:35,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495477300] [2019-11-07 04:42:35,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:42:35,957 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:35,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:42:35,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:42:35,958 INFO L87 Difference]: Start difference. First operand 1353 states and 2142 transitions. Second operand 5 states. [2019-11-07 04:42:36,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:36,382 INFO L93 Difference]: Finished difference Result 3441 states and 5469 transitions. [2019-11-07 04:42:36,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 04:42:36,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-11-07 04:42:36,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:36,395 INFO L225 Difference]: With dead ends: 3441 [2019-11-07 04:42:36,395 INFO L226 Difference]: Without dead ends: 2152 [2019-11-07 04:42:36,399 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:42:36,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2152 states. [2019-11-07 04:42:36,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2152 to 2142. [2019-11-07 04:42:36,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2142 states. [2019-11-07 04:42:36,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 3376 transitions. [2019-11-07 04:42:36,527 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 3376 transitions. Word has length 53 [2019-11-07 04:42:36,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:36,528 INFO L462 AbstractCegarLoop]: Abstraction has 2142 states and 3376 transitions. [2019-11-07 04:42:36,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:42:36,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 3376 transitions. [2019-11-07 04:42:36,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 04:42:36,529 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:36,529 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:36,529 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:36,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:36,530 INFO L82 PathProgramCache]: Analyzing trace with hash 467503626, now seen corresponding path program 1 times [2019-11-07 04:42:36,530 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:36,530 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595044530] [2019-11-07 04:42:36,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:36,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:36,623 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595044530] [2019-11-07 04:42:36,623 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:36,623 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:42:36,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148918178] [2019-11-07 04:42:36,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:42:36,624 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:36,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:42:36,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:42:36,625 INFO L87 Difference]: Start difference. First operand 2142 states and 3376 transitions. Second operand 6 states. [2019-11-07 04:42:37,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:37,255 INFO L93 Difference]: Finished difference Result 5867 states and 9260 transitions. [2019-11-07 04:42:37,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 04:42:37,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-07 04:42:37,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:37,277 INFO L225 Difference]: With dead ends: 5867 [2019-11-07 04:42:37,277 INFO L226 Difference]: Without dead ends: 3789 [2019-11-07 04:42:37,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-11-07 04:42:37,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3789 states. [2019-11-07 04:42:37,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3789 to 2571. [2019-11-07 04:42:37,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2571 states. [2019-11-07 04:42:37,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 4020 transitions. [2019-11-07 04:42:37,478 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 4020 transitions. Word has length 54 [2019-11-07 04:42:37,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:37,478 INFO L462 AbstractCegarLoop]: Abstraction has 2571 states and 4020 transitions. [2019-11-07 04:42:37,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:42:37,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 4020 transitions. [2019-11-07 04:42:37,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 04:42:37,479 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:37,480 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:37,480 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:37,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:37,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1550658078, now seen corresponding path program 1 times [2019-11-07 04:42:37,481 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:37,481 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552945770] [2019-11-07 04:42:37,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:37,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:37,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:37,554 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552945770] [2019-11-07 04:42:37,554 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:37,554 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:42:37,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786710736] [2019-11-07 04:42:37,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:42:37,555 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:37,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:42:37,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:42:37,556 INFO L87 Difference]: Start difference. First operand 2571 states and 4020 transitions. Second operand 4 states. [2019-11-07 04:42:37,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:37,795 INFO L93 Difference]: Finished difference Result 5080 states and 7961 transitions. [2019-11-07 04:42:37,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:42:37,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-11-07 04:42:37,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:37,810 INFO L225 Difference]: With dead ends: 5080 [2019-11-07 04:42:37,810 INFO L226 Difference]: Without dead ends: 2573 [2019-11-07 04:42:37,815 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:42:37,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2019-11-07 04:42:37,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 2571. [2019-11-07 04:42:37,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2571 states. [2019-11-07 04:42:38,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 4008 transitions. [2019-11-07 04:42:38,004 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 4008 transitions. Word has length 55 [2019-11-07 04:42:38,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:38,004 INFO L462 AbstractCegarLoop]: Abstraction has 2571 states and 4008 transitions. [2019-11-07 04:42:38,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:42:38,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 4008 transitions. [2019-11-07 04:42:38,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-07 04:42:38,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:38,005 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:38,005 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:38,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:38,006 INFO L82 PathProgramCache]: Analyzing trace with hash 773265745, now seen corresponding path program 1 times [2019-11-07 04:42:38,006 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:38,006 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896854480] [2019-11-07 04:42:38,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:38,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:38,086 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896854480] [2019-11-07 04:42:38,087 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:38,089 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:42:38,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937017322] [2019-11-07 04:42:38,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:42:38,090 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:38,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:42:38,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:42:38,091 INFO L87 Difference]: Start difference. First operand 2571 states and 4008 transitions. Second operand 4 states. [2019-11-07 04:42:38,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:38,335 INFO L93 Difference]: Finished difference Result 5080 states and 7937 transitions. [2019-11-07 04:42:38,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:42:38,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-07 04:42:38,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:38,351 INFO L225 Difference]: With dead ends: 5080 [2019-11-07 04:42:38,352 INFO L226 Difference]: Without dead ends: 2573 [2019-11-07 04:42:38,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:42:38,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2019-11-07 04:42:38,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 2571. [2019-11-07 04:42:38,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2571 states. [2019-11-07 04:42:38,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 3996 transitions. [2019-11-07 04:42:38,583 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 3996 transitions. Word has length 56 [2019-11-07 04:42:38,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:38,584 INFO L462 AbstractCegarLoop]: Abstraction has 2571 states and 3996 transitions. [2019-11-07 04:42:38,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:42:38,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3996 transitions. [2019-11-07 04:42:38,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 04:42:38,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:38,585 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:38,586 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:38,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:38,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1410596863, now seen corresponding path program 1 times [2019-11-07 04:42:38,587 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:38,587 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62001897] [2019-11-07 04:42:38,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:38,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:38,869 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62001897] [2019-11-07 04:42:38,869 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:38,869 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:42:38,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033877282] [2019-11-07 04:42:38,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:42:38,870 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:38,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:42:38,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:42:38,871 INFO L87 Difference]: Start difference. First operand 2571 states and 3996 transitions. Second operand 5 states. [2019-11-07 04:42:39,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:39,142 INFO L93 Difference]: Finished difference Result 5080 states and 7913 transitions. [2019-11-07 04:42:39,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:42:39,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-11-07 04:42:39,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:39,159 INFO L225 Difference]: With dead ends: 5080 [2019-11-07 04:42:39,159 INFO L226 Difference]: Without dead ends: 2573 [2019-11-07 04:42:39,164 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:42:39,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2019-11-07 04:42:39,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 2571. [2019-11-07 04:42:39,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2571 states. [2019-11-07 04:42:39,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 3988 transitions. [2019-11-07 04:42:39,325 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 3988 transitions. Word has length 58 [2019-11-07 04:42:39,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:39,325 INFO L462 AbstractCegarLoop]: Abstraction has 2571 states and 3988 transitions. [2019-11-07 04:42:39,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:42:39,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3988 transitions. [2019-11-07 04:42:39,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-07 04:42:39,326 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:39,327 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:39,327 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:39,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:39,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1114339215, now seen corresponding path program 1 times [2019-11-07 04:42:39,327 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:39,328 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137368612] [2019-11-07 04:42:39,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:39,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:39,558 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137368612] [2019-11-07 04:42:39,559 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:39,559 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:42:39,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462259523] [2019-11-07 04:42:39,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:42:39,560 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:39,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:42:39,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:42:39,561 INFO L87 Difference]: Start difference. First operand 2571 states and 3988 transitions. Second operand 5 states. [2019-11-07 04:42:39,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:39,959 INFO L93 Difference]: Finished difference Result 6291 states and 9761 transitions. [2019-11-07 04:42:39,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:42:39,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-11-07 04:42:39,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:39,980 INFO L225 Difference]: With dead ends: 6291 [2019-11-07 04:42:39,980 INFO L226 Difference]: Without dead ends: 3784 [2019-11-07 04:42:39,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-07 04:42:39,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2019-11-07 04:42:40,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 2571. [2019-11-07 04:42:40,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2571 states. [2019-11-07 04:42:40,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 3987 transitions. [2019-11-07 04:42:40,205 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 3987 transitions. Word has length 61 [2019-11-07 04:42:40,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:40,206 INFO L462 AbstractCegarLoop]: Abstraction has 2571 states and 3987 transitions. [2019-11-07 04:42:40,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:42:40,206 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3987 transitions. [2019-11-07 04:42:40,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-07 04:42:40,210 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:40,210 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:40,210 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:40,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:40,211 INFO L82 PathProgramCache]: Analyzing trace with hash 195201472, now seen corresponding path program 1 times [2019-11-07 04:42:40,211 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:40,211 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681141414] [2019-11-07 04:42:40,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:40,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:40,366 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681141414] [2019-11-07 04:42:40,366 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:40,366 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 04:42:40,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638184579] [2019-11-07 04:42:40,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 04:42:40,368 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:40,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 04:42:40,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:42:40,369 INFO L87 Difference]: Start difference. First operand 2571 states and 3987 transitions. Second operand 7 states. [2019-11-07 04:42:41,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:41,249 INFO L93 Difference]: Finished difference Result 7282 states and 11293 transitions. [2019-11-07 04:42:41,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-07 04:42:41,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-11-07 04:42:41,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:41,285 INFO L225 Difference]: With dead ends: 7282 [2019-11-07 04:42:41,285 INFO L226 Difference]: Without dead ends: 5543 [2019-11-07 04:42:41,292 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-11-07 04:42:41,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5543 states. [2019-11-07 04:42:41,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5543 to 3604. [2019-11-07 04:42:41,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3604 states. [2019-11-07 04:42:41,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3604 states to 3604 states and 5435 transitions. [2019-11-07 04:42:41,684 INFO L78 Accepts]: Start accepts. Automaton has 3604 states and 5435 transitions. Word has length 62 [2019-11-07 04:42:41,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:41,685 INFO L462 AbstractCegarLoop]: Abstraction has 3604 states and 5435 transitions. [2019-11-07 04:42:41,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 04:42:41,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3604 states and 5435 transitions. [2019-11-07 04:42:41,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-07 04:42:41,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:41,686 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:41,687 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:41,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:41,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1719559429, now seen corresponding path program 1 times [2019-11-07 04:42:41,687 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:41,687 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923098343] [2019-11-07 04:42:41,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:42,243 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:42,243 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923098343] [2019-11-07 04:42:42,243 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001208168] [2019-11-07 04:42:42,244 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-11-07 04:42:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:42,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-07 04:42:42,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:42:42,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:42,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:42,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:42,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:42,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:42,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,187 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:43,188 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:42:43,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,467 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 28 [2019-11-07 04:42:43,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 04:42:43,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,710 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-11-07 04:42:43,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-07 04:42:43,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:43,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:44,223 WARN L191 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-11-07 04:42:44,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-07 04:42:44,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-07 04:42:44,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-07 04:42:44,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:44,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:44,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-07 04:42:44,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-07 04:42:44,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 04:42:44,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-07 04:42:44,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 04:42:44,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:45,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-07 04:42:45,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:45,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 04:42:45,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:45,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 04:42:45,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:45,390 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:45,390 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2128700298] [2019-11-07 04:42:45,421 INFO L159 IcfgInterpreter]: Started Sifa with 63 locations of interest [2019-11-07 04:42:45,421 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 04:42:45,428 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 04:42:45,436 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 04:42:45,436 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 04:42:45,916 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 234 [2019-11-07 04:42:46,124 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 234 [2019-11-07 04:42:46,139 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 282 for LOIs [2019-11-07 04:42:46,581 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12