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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:22:16,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:22:16,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:22:16,172 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:22:16,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:22:16,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:22:16,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:22:16,177 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:22:16,179 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:22:16,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:22:16,180 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:22:16,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:22:16,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:22:16,183 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:22:16,184 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:22:16,185 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:22:16,186 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:22:16,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:22:16,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:22:16,190 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:22:16,192 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:22:16,193 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:22:16,194 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:22:16,195 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:22:16,197 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:22:16,198 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:22:16,198 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:22:16,199 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:22:16,199 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:22:16,200 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:22:16,200 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:22:16,201 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:22:16,202 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:22:16,202 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:22:16,204 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:22:16,204 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:22:16,204 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:22:16,205 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:22:16,205 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:22:16,206 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:22:16,207 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:22:16,207 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 23:22:16,225 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:22:16,225 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:22:16,226 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:22:16,227 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:22:16,227 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:22:16,227 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:22:16,227 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:22:16,227 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:22:16,228 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:22:16,228 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:22:16,228 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:22:16,229 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:22:16,229 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:22:16,229 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:22:16,229 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:22:16,230 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:22:16,230 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:22:16,230 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:22:16,230 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:22:16,231 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:22:16,231 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:22:16,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:22:16,231 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:22:16,232 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:22:16,232 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:22:16,232 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:22:16,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:22:16,232 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:22:16,233 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 23:22:16,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:22:16,545 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:22:16,549 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:22:16,550 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:22:16,551 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:22:16,552 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-13 23:22:16,616 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/788193cfb/39d5ab44ed7d489c92dbf43f127e9a21/FLAGdf88ee24a [2019-10-13 23:22:17,237 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:22:17,237 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-13 23:22:17,251 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/788193cfb/39d5ab44ed7d489c92dbf43f127e9a21/FLAGdf88ee24a [2019-10-13 23:22:17,488 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/788193cfb/39d5ab44ed7d489c92dbf43f127e9a21 [2019-10-13 23:22:17,499 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:22:17,501 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:22:17,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:22:17,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:22:17,505 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:22:17,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:22:17" (1/1) ... [2019-10-13 23:22:17,510 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d469f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:17, skipping insertion in model container [2019-10-13 23:22:17,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:22:17" (1/1) ... [2019-10-13 23:22:17,518 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:22:17,607 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:22:18,307 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:22:18,327 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:22:18,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:22:18,806 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:22:18,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:18 WrapperNode [2019-10-13 23:22:18,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:22:18,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:22:18,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:22:18,808 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:22:18,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:18" (1/1) ... [2019-10-13 23:22:18,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:18" (1/1) ... [2019-10-13 23:22:18,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:18" (1/1) ... [2019-10-13 23:22:18,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:18" (1/1) ... [2019-10-13 23:22:18,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:18" (1/1) ... [2019-10-13 23:22:18,920 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:18" (1/1) ... [2019-10-13 23:22:18,932 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:18" (1/1) ... [2019-10-13 23:22:18,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:22:18,949 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:22:18,949 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:22:18,949 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:22:18,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:22:19,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:22:19,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:22:19,036 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:22:19,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:22:19,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 23:22:19,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 23:22:19,037 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 23:22:19,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 23:22:19,037 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 23:22:19,037 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 23:22:19,038 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 23:22:19,038 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 23:22:19,038 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 23:22:19,038 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 23:22:19,038 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 23:22:19,039 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:22:19,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:22:19,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:22:22,095 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:22:22,096 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 23:22:22,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:22:22 BoogieIcfgContainer [2019-10-13 23:22:22,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:22:22,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:22:22,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:22:22,103 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:22:22,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:22:17" (1/3) ... [2019-10-13 23:22:22,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed8347b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:22:22, skipping insertion in model container [2019-10-13 23:22:22,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:18" (2/3) ... [2019-10-13 23:22:22,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed8347b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:22:22, skipping insertion in model container [2019-10-13 23:22:22,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:22:22" (3/3) ... [2019-10-13 23:22:22,117 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-13 23:22:22,128 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:22:22,141 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-13 23:22:22,153 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-13 23:22:22,180 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:22:22,180 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:22:22,180 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:22:22,180 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:22:22,181 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:22:22,181 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:22:22,181 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:22:22,181 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:22:22,208 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states. [2019-10-13 23:22:22,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-13 23:22:22,223 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:22,224 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:22:22,226 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:22,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:22,233 INFO L82 PathProgramCache]: Analyzing trace with hash 588212400, now seen corresponding path program 1 times [2019-10-13 23:22:22,242 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:22,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175465710] [2019-10-13 23:22:22,243 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:22,243 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:22,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:23,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:23,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175465710] [2019-10-13 23:22:23,451 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:23,452 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:23,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706044130] [2019-10-13 23:22:23,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:23,458 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:23,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:23,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:23,475 INFO L87 Difference]: Start difference. First operand 315 states. Second operand 5 states. [2019-10-13 23:22:23,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:23,756 INFO L93 Difference]: Finished difference Result 799 states and 1397 transitions. [2019-10-13 23:22:23,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:23,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-10-13 23:22:23,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:23,779 INFO L225 Difference]: With dead ends: 799 [2019-10-13 23:22:23,780 INFO L226 Difference]: Without dead ends: 547 [2019-10-13 23:22:23,786 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:23,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-10-13 23:22:23,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 526. [2019-10-13 23:22:23,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2019-10-13 23:22:23,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 700 transitions. [2019-10-13 23:22:23,933 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 700 transitions. Word has length 121 [2019-10-13 23:22:23,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:23,934 INFO L462 AbstractCegarLoop]: Abstraction has 526 states and 700 transitions. [2019-10-13 23:22:23,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:23,934 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 700 transitions. [2019-10-13 23:22:23,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-13 23:22:23,945 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:23,945 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:22:23,947 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:23,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:23,949 INFO L82 PathProgramCache]: Analyzing trace with hash -2096026532, now seen corresponding path program 1 times [2019-10-13 23:22:23,949 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:23,950 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150864569] [2019-10-13 23:22:23,950 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:23,950 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:23,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:24,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:24,077 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150864569] [2019-10-13 23:22:24,077 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:24,077 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:24,077 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817094016] [2019-10-13 23:22:24,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:24,080 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:24,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:24,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:24,081 INFO L87 Difference]: Start difference. First operand 526 states and 700 transitions. Second operand 3 states. [2019-10-13 23:22:24,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:24,188 INFO L93 Difference]: Finished difference Result 1158 states and 1577 transitions. [2019-10-13 23:22:24,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:24,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-10-13 23:22:24,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:24,193 INFO L225 Difference]: With dead ends: 1158 [2019-10-13 23:22:24,194 INFO L226 Difference]: Without dead ends: 698 [2019-10-13 23:22:24,200 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-13 23:22:24,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-10-13 23:22:24,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 635. [2019-10-13 23:22:24,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-13 23:22:24,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 874 transitions. [2019-10-13 23:22:24,237 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 874 transitions. Word has length 123 [2019-10-13 23:22:24,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:24,239 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 874 transitions. [2019-10-13 23:22:24,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:24,240 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 874 transitions. [2019-10-13 23:22:24,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-13 23:22:24,245 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:24,245 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:22:24,247 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:24,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:24,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1793558548, now seen corresponding path program 1 times [2019-10-13 23:22:24,248 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:24,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972688018] [2019-10-13 23:22:24,248 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:24,249 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:24,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:24,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:24,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972688018] [2019-10-13 23:22:24,387 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:24,387 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:24,387 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362993780] [2019-10-13 23:22:24,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:24,390 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:24,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:24,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:24,391 INFO L87 Difference]: Start difference. First operand 635 states and 874 transitions. Second operand 3 states. [2019-10-13 23:22:24,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:24,518 INFO L93 Difference]: Finished difference Result 1436 states and 2028 transitions. [2019-10-13 23:22:24,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:24,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-10-13 23:22:24,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:24,526 INFO L225 Difference]: With dead ends: 1436 [2019-10-13 23:22:24,526 INFO L226 Difference]: Without dead ends: 892 [2019-10-13 23:22:24,528 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-13 23:22:24,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2019-10-13 23:22:24,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 839. [2019-10-13 23:22:24,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-10-13 23:22:24,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1202 transitions. [2019-10-13 23:22:24,573 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1202 transitions. Word has length 123 [2019-10-13 23:22:24,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:24,574 INFO L462 AbstractCegarLoop]: Abstraction has 839 states and 1202 transitions. [2019-10-13 23:22:24,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:24,574 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1202 transitions. [2019-10-13 23:22:24,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-13 23:22:24,576 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:24,576 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:22:24,577 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:24,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:24,577 INFO L82 PathProgramCache]: Analyzing trace with hash -214950358, now seen corresponding path program 1 times [2019-10-13 23:22:24,578 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:24,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999719772] [2019-10-13 23:22:24,578 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:24,578 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:24,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:25,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:25,214 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999719772] [2019-10-13 23:22:25,214 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:25,214 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:22:25,215 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842082689] [2019-10-13 23:22:25,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:22:25,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:25,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:22:25,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:22:25,217 INFO L87 Difference]: Start difference. First operand 839 states and 1202 transitions. Second operand 7 states. [2019-10-13 23:22:25,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:25,588 INFO L93 Difference]: Finished difference Result 2522 states and 3737 transitions. [2019-10-13 23:22:25,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 23:22:25,589 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 126 [2019-10-13 23:22:25,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:25,599 INFO L225 Difference]: With dead ends: 2522 [2019-10-13 23:22:25,599 INFO L226 Difference]: Without dead ends: 1830 [2019-10-13 23:22:25,601 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:22:25,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2019-10-13 23:22:25,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1192. [2019-10-13 23:22:25,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2019-10-13 23:22:25,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1722 transitions. [2019-10-13 23:22:25,738 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1722 transitions. Word has length 126 [2019-10-13 23:22:25,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:25,738 INFO L462 AbstractCegarLoop]: Abstraction has 1192 states and 1722 transitions. [2019-10-13 23:22:25,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:22:25,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1722 transitions. [2019-10-13 23:22:25,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-13 23:22:25,741 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:25,741 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:22:25,741 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:25,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:25,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1464091590, now seen corresponding path program 1 times [2019-10-13 23:22:25,742 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:25,743 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602790073] [2019-10-13 23:22:25,743 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:25,744 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:25,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:25,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:25,863 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602790073] [2019-10-13 23:22:25,863 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:25,863 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:22:25,863 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105055623] [2019-10-13 23:22:25,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:22:25,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:25,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:22:25,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:22:25,865 INFO L87 Difference]: Start difference. First operand 1192 states and 1722 transitions. Second operand 6 states. [2019-10-13 23:22:26,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:26,315 INFO L93 Difference]: Finished difference Result 2984 states and 4413 transitions. [2019-10-13 23:22:26,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:26,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2019-10-13 23:22:26,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:26,325 INFO L225 Difference]: With dead ends: 2984 [2019-10-13 23:22:26,326 INFO L226 Difference]: Without dead ends: 1897 [2019-10-13 23:22:26,329 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:22:26,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2019-10-13 23:22:26,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1813. [2019-10-13 23:22:26,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1813 states. [2019-10-13 23:22:26,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 2722 transitions. [2019-10-13 23:22:26,470 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 2722 transitions. Word has length 126 [2019-10-13 23:22:26,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:26,471 INFO L462 AbstractCegarLoop]: Abstraction has 1813 states and 2722 transitions. [2019-10-13 23:22:26,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:22:26,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2722 transitions. [2019-10-13 23:22:26,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-13 23:22:26,474 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:26,474 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:22:26,475 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:26,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:26,475 INFO L82 PathProgramCache]: Analyzing trace with hash -406353067, now seen corresponding path program 1 times [2019-10-13 23:22:26,475 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:26,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223465257] [2019-10-13 23:22:26,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:26,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:26,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:26,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:26,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223465257] [2019-10-13 23:22:26,959 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:26,959 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:26,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063054103] [2019-10-13 23:22:26,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:26,960 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:26,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:26,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:26,961 INFO L87 Difference]: Start difference. First operand 1813 states and 2722 transitions. Second operand 5 states. [2019-10-13 23:22:27,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:27,269 INFO L93 Difference]: Finished difference Result 3438 states and 5192 transitions. [2019-10-13 23:22:27,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:27,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-10-13 23:22:27,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:27,284 INFO L225 Difference]: With dead ends: 3438 [2019-10-13 23:22:27,284 INFO L226 Difference]: Without dead ends: 2811 [2019-10-13 23:22:27,287 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:27,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2811 states. [2019-10-13 23:22:27,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2811 to 2790. [2019-10-13 23:22:27,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2790 states. [2019-10-13 23:22:27,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 4226 transitions. [2019-10-13 23:22:27,573 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 4226 transitions. Word has length 126 [2019-10-13 23:22:27,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:27,575 INFO L462 AbstractCegarLoop]: Abstraction has 2790 states and 4226 transitions. [2019-10-13 23:22:27,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:27,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 4226 transitions. [2019-10-13 23:22:27,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-13 23:22:27,577 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:27,577 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:22:27,578 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:27,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:27,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1334235076, now seen corresponding path program 1 times [2019-10-13 23:22:27,579 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:27,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130630000] [2019-10-13 23:22:27,579 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:27,579 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:27,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:27,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:27,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130630000] [2019-10-13 23:22:27,669 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:27,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:27,669 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558427271] [2019-10-13 23:22:27,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:27,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:27,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:27,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:27,671 INFO L87 Difference]: Start difference. First operand 2790 states and 4226 transitions. Second operand 3 states. [2019-10-13 23:22:28,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:28,047 INFO L93 Difference]: Finished difference Result 7454 states and 11497 transitions. [2019-10-13 23:22:28,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:28,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-10-13 23:22:28,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:28,081 INFO L225 Difference]: With dead ends: 7454 [2019-10-13 23:22:28,081 INFO L226 Difference]: Without dead ends: 4709 [2019-10-13 23:22:28,095 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-13 23:22:28,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4709 states. [2019-10-13 23:22:28,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4709 to 4520. [2019-10-13 23:22:28,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4520 states. [2019-10-13 23:22:28,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4520 states to 4520 states and 6986 transitions. [2019-10-13 23:22:28,669 INFO L78 Accepts]: Start accepts. Automaton has 4520 states and 6986 transitions. Word has length 128 [2019-10-13 23:22:28,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:28,669 INFO L462 AbstractCegarLoop]: Abstraction has 4520 states and 6986 transitions. [2019-10-13 23:22:28,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:28,670 INFO L276 IsEmpty]: Start isEmpty. Operand 4520 states and 6986 transitions. [2019-10-13 23:22:28,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-13 23:22:28,673 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:28,673 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:22:28,674 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:28,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:28,674 INFO L82 PathProgramCache]: Analyzing trace with hash -144793796, now seen corresponding path program 1 times [2019-10-13 23:22:28,674 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:28,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186859764] [2019-10-13 23:22:28,675 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:28,675 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:28,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:28,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:28,810 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186859764] [2019-10-13 23:22:28,810 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:28,810 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:28,811 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754562366] [2019-10-13 23:22:28,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:28,811 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:28,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:28,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:28,812 INFO L87 Difference]: Start difference. First operand 4520 states and 6986 transitions. Second operand 5 states. [2019-10-13 23:22:29,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:29,323 INFO L93 Difference]: Finished difference Result 8997 states and 13926 transitions. [2019-10-13 23:22:29,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:29,324 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2019-10-13 23:22:29,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:29,345 INFO L225 Difference]: With dead ends: 8997 [2019-10-13 23:22:29,346 INFO L226 Difference]: Without dead ends: 4520 [2019-10-13 23:22:29,355 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:22:29,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4520 states. [2019-10-13 23:22:29,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4520 to 4520. [2019-10-13 23:22:29,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4520 states. [2019-10-13 23:22:29,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4520 states to 4520 states and 6896 transitions. [2019-10-13 23:22:29,730 INFO L78 Accepts]: Start accepts. Automaton has 4520 states and 6896 transitions. Word has length 131 [2019-10-13 23:22:29,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:29,731 INFO L462 AbstractCegarLoop]: Abstraction has 4520 states and 6896 transitions. [2019-10-13 23:22:29,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:29,731 INFO L276 IsEmpty]: Start isEmpty. Operand 4520 states and 6896 transitions. [2019-10-13 23:22:29,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-13 23:22:29,733 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:29,733 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:22:29,734 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:29,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:29,734 INFO L82 PathProgramCache]: Analyzing trace with hash 156140215, now seen corresponding path program 1 times [2019-10-13 23:22:29,735 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:29,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260666377] [2019-10-13 23:22:29,735 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:29,735 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:29,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:30,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:30,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260666377] [2019-10-13 23:22:30,089 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:30,089 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:30,090 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217355070] [2019-10-13 23:22:30,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:30,090 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:30,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:30,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:30,091 INFO L87 Difference]: Start difference. First operand 4520 states and 6896 transitions. Second operand 5 states. [2019-10-13 23:22:30,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:30,748 INFO L93 Difference]: Finished difference Result 12085 states and 18447 transitions. [2019-10-13 23:22:30,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:30,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2019-10-13 23:22:30,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:30,786 INFO L225 Difference]: With dead ends: 12085 [2019-10-13 23:22:30,786 INFO L226 Difference]: Without dead ends: 7697 [2019-10-13 23:22:30,796 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:30,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7697 states. [2019-10-13 23:22:31,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7697 to 7676. [2019-10-13 23:22:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7676 states. [2019-10-13 23:22:31,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7676 states to 7676 states and 11602 transitions. [2019-10-13 23:22:31,413 INFO L78 Accepts]: Start accepts. Automaton has 7676 states and 11602 transitions. Word has length 131 [2019-10-13 23:22:31,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:31,414 INFO L462 AbstractCegarLoop]: Abstraction has 7676 states and 11602 transitions. [2019-10-13 23:22:31,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:31,414 INFO L276 IsEmpty]: Start isEmpty. Operand 7676 states and 11602 transitions. [2019-10-13 23:22:31,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-13 23:22:31,417 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:31,418 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:22:31,418 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:31,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:31,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1833269574, now seen corresponding path program 1 times [2019-10-13 23:22:31,419 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:31,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348347019] [2019-10-13 23:22:31,419 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:31,419 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:31,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:32,700 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-10-13 23:22:32,847 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-10-13 23:22:33,043 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-10-13 23:22:33,208 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-10-13 23:22:33,386 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-10-13 23:22:33,636 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 61 [2019-10-13 23:22:33,818 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-10-13 23:22:34,002 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-10-13 23:22:34,262 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-10-13 23:22:34,455 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-10-13 23:22:34,632 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-10-13 23:22:34,828 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-10-13 23:22:35,008 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2019-10-13 23:22:35,278 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-10-13 23:22:35,480 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-10-13 23:22:37,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:37,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348347019] [2019-10-13 23:22:37,358 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:37,358 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2019-10-13 23:22:37,358 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105552573] [2019-10-13 23:22:37,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-13 23:22:37,359 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:37,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-13 23:22:37,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1090, Unknown=0, NotChecked=0, Total=1190 [2019-10-13 23:22:37,360 INFO L87 Difference]: Start difference. First operand 7676 states and 11602 transitions. Second operand 35 states. [2019-10-13 23:22:37,847 WARN L191 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 89 [2019-10-13 23:22:39,026 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-10-13 23:22:39,332 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-10-13 23:22:39,654 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-10-13 23:22:40,019 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-10-13 23:22:40,361 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-10-13 23:22:40,903 WARN L191 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-10-13 23:22:41,377 WARN L191 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 92 [2019-10-13 23:22:42,110 WARN L191 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 100 [2019-10-13 23:22:42,641 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-10-13 23:22:43,210 WARN L191 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 108 [2019-10-13 23:22:44,158 WARN L191 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 114 [2019-10-13 23:22:44,778 WARN L191 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 108 [2019-10-13 23:22:45,303 WARN L191 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 103 [2019-10-13 23:22:45,986 WARN L191 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 113 [2019-10-13 23:22:46,525 WARN L191 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 105 [2019-10-13 23:22:47,319 WARN L191 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 108 [2019-10-13 23:22:48,018 WARN L191 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 111 [2019-10-13 23:22:48,556 WARN L191 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 88 [2019-10-13 23:22:48,944 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-10-13 23:22:52,363 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-10-13 23:22:54,734 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55