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-36ac518-m [2019-10-07 15:51:30,193 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 15:51:30,195 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 15:51:30,208 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 15:51:30,208 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 15:51:30,209 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 15:51:30,210 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 15:51:30,212 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 15:51:30,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 15:51:30,215 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 15:51:30,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 15:51:30,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 15:51:30,217 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 15:51:30,218 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 15:51:30,219 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 15:51:30,220 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 15:51:30,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 15:51:30,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 15:51:30,224 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 15:51:30,226 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 15:51:30,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 15:51:30,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 15:51:30,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 15:51:30,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 15:51:30,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 15:51:30,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 15:51:30,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 15:51:30,233 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 15:51:30,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 15:51:30,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 15:51:30,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 15:51:30,235 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 15:51:30,236 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 15:51:30,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 15:51:30,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 15:51:30,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 15:51:30,239 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 15:51:30,239 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 15:51:30,239 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 15:51:30,240 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 15:51:30,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 15:51:30,242 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-07 15:51:30,255 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 15:51:30,255 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 15:51:30,256 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 15:51:30,257 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 15:51:30,257 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 15:51:30,257 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 15:51:30,257 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 15:51:30,258 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 15:51:30,258 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 15:51:30,258 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 15:51:30,258 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 15:51:30,258 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 15:51:30,259 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 15:51:30,259 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 15:51:30,259 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 15:51:30,259 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 15:51:30,259 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 15:51:30,260 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 15:51:30,260 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 15:51:30,260 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 15:51:30,260 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 15:51:30,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 15:51:30,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 15:51:30,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 15:51:30,261 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 15:51:30,261 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 15:51:30,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 15:51:30,262 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 15:51:30,262 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-07 15:51:30,566 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 15:51:30,579 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 15:51:30,584 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 15:51:30,585 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 15:51:30,586 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 15:51:30,586 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-10-07 15:51:30,659 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8b83375e/ade08a960c1040ee9582bad974a73a46/FLAG246ad2aa2 [2019-10-07 15:51:31,151 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 15:51:31,152 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-10-07 15:51:31,173 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8b83375e/ade08a960c1040ee9582bad974a73a46/FLAG246ad2aa2 [2019-10-07 15:51:31,496 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8b83375e/ade08a960c1040ee9582bad974a73a46 [2019-10-07 15:51:31,506 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 15:51:31,508 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 15:51:31,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 15:51:31,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 15:51:31,513 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 15:51:31,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:51:31" (1/1) ... [2019-10-07 15:51:31,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5808f98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:51:31, skipping insertion in model container [2019-10-07 15:51:31,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:51:31" (1/1) ... [2019-10-07 15:51:31,524 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 15:51:31,573 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 15:51:31,896 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:51:32,009 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 15:51:32,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:51:32,120 INFO L192 MainTranslator]: Completed translation [2019-10-07 15:51:32,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:51:32 WrapperNode [2019-10-07 15:51:32,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 15:51:32,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 15:51:32,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 15:51:32,121 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 15:51:32,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:51:32" (1/1) ... [2019-10-07 15:51:32,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:51:32" (1/1) ... [2019-10-07 15:51:32,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:51:32" (1/1) ... [2019-10-07 15:51:32,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:51:32" (1/1) ... [2019-10-07 15:51:32,158 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:51:32" (1/1) ... [2019-10-07 15:51:32,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:51:32" (1/1) ... [2019-10-07 15:51:32,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:51:32" (1/1) ... [2019-10-07 15:51:32,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 15:51:32,179 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 15:51:32,179 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 15:51:32,180 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 15:51:32,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:51:32" (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-07 15:51:32,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 15:51:32,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 15:51:32,267 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 15:51:32,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 15:51:32,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-07 15:51:32,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-07 15:51:32,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-07 15:51:32,270 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-07 15:51:32,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 15:51:32,270 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-07 15:51:32,270 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-07 15:51:32,271 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-07 15:51:32,271 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-07 15:51:32,271 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-07 15:51:32,272 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-07 15:51:32,272 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-07 15:51:32,274 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 15:51:32,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 15:51:32,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 15:51:33,755 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 15:51:33,755 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-07 15:51:33,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:51:33 BoogieIcfgContainer [2019-10-07 15:51:33,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 15:51:33,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 15:51:33,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 15:51:33,761 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 15:51:33,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:51:31" (1/3) ... [2019-10-07 15:51:33,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28104c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:51:33, skipping insertion in model container [2019-10-07 15:51:33,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:51:32" (2/3) ... [2019-10-07 15:51:33,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28104c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:51:33, skipping insertion in model container [2019-10-07 15:51:33,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:51:33" (3/3) ... [2019-10-07 15:51:33,765 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-10-07 15:51:33,775 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 15:51:33,783 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 15:51:33,795 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 15:51:33,822 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 15:51:33,822 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 15:51:33,822 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 15:51:33,822 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 15:51:33,823 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 15:51:33,823 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 15:51:33,823 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 15:51:33,823 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 15:51:33,844 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2019-10-07 15:51:33,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-07 15:51:33,852 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:51:33,853 INFO L385 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-10-07 15:51:33,855 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:51:33,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:51:33,862 INFO L82 PathProgramCache]: Analyzing trace with hash 2138769479, now seen corresponding path program 1 times [2019-10-07 15:51:33,872 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:51:33,872 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:51:33,872 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:51:33,873 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:51:33,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:51:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:51:34,368 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-07 15:51:34,369 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:51:34,370 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:51:34,370 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:51:34,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:51:34,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:51:34,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:51:34,392 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2019-10-07 15:51:34,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:51:34,468 INFO L93 Difference]: Finished difference Result 220 states and 356 transitions. [2019-10-07 15:51:34,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:51:34,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-07 15:51:34,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:51:34,484 INFO L225 Difference]: With dead ends: 220 [2019-10-07 15:51:34,485 INFO L226 Difference]: Without dead ends: 144 [2019-10-07 15:51:34,488 INFO L606 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-07 15:51:34,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-10-07 15:51:34,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2019-10-07 15:51:34,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-10-07 15:51:34,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 213 transitions. [2019-10-07 15:51:34,545 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 213 transitions. Word has length 41 [2019-10-07 15:51:34,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:51:34,546 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 213 transitions. [2019-10-07 15:51:34,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:51:34,546 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 213 transitions. [2019-10-07 15:51:34,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-07 15:51:34,548 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:51:34,548 INFO L385 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-10-07 15:51:34,549 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:51:34,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:51:34,549 INFO L82 PathProgramCache]: Analyzing trace with hash 2105877559, now seen corresponding path program 1 times [2019-10-07 15:51:34,549 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:51:34,550 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:51:34,550 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:51:34,550 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:51:34,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:51:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:51:34,719 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-07 15:51:34,719 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:51:34,720 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:51:34,720 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:51:34,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:51:34,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:51:34,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:51:34,723 INFO L87 Difference]: Start difference. First operand 142 states and 213 transitions. Second operand 3 states. [2019-10-07 15:51:34,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:51:34,835 INFO L93 Difference]: Finished difference Result 319 states and 500 transitions. [2019-10-07 15:51:34,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:51:34,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-07 15:51:34,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:51:34,841 INFO L225 Difference]: With dead ends: 319 [2019-10-07 15:51:34,843 INFO L226 Difference]: Without dead ends: 207 [2019-10-07 15:51:34,845 INFO L606 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-07 15:51:34,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-10-07 15:51:34,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2019-10-07 15:51:34,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-07 15:51:34,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 312 transitions. [2019-10-07 15:51:34,893 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 312 transitions. Word has length 43 [2019-10-07 15:51:34,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:51:34,894 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 312 transitions. [2019-10-07 15:51:34,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:51:34,896 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 312 transitions. [2019-10-07 15:51:34,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-07 15:51:34,898 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:51:34,899 INFO L385 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-10-07 15:51:34,901 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:51:34,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:51:34,902 INFO L82 PathProgramCache]: Analyzing trace with hash -486820712, now seen corresponding path program 1 times [2019-10-07 15:51:34,903 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:51:34,904 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:51:34,904 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:51:34,904 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:51:34,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:51:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:51:35,050 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-07 15:51:35,051 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:51:35,051 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:51:35,051 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:51:35,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:51:35,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:51:35,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:51:35,053 INFO L87 Difference]: Start difference. First operand 205 states and 312 transitions. Second operand 3 states. [2019-10-07 15:51:35,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:51:35,088 INFO L93 Difference]: Finished difference Result 509 states and 803 transitions. [2019-10-07 15:51:35,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:51:35,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-07 15:51:35,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:51:35,092 INFO L225 Difference]: With dead ends: 509 [2019-10-07 15:51:35,092 INFO L226 Difference]: Without dead ends: 336 [2019-10-07 15:51:35,094 INFO L606 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-07 15:51:35,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-10-07 15:51:35,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-10-07 15:51:35,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-10-07 15:51:35,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 519 transitions. [2019-10-07 15:51:35,119 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 519 transitions. Word has length 45 [2019-10-07 15:51:35,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:51:35,121 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 519 transitions. [2019-10-07 15:51:35,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:51:35,122 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 519 transitions. [2019-10-07 15:51:35,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-07 15:51:35,126 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:51:35,126 INFO L385 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-10-07 15:51:35,127 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:51:35,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:51:35,127 INFO L82 PathProgramCache]: Analyzing trace with hash 219909761, now seen corresponding path program 1 times [2019-10-07 15:51:35,127 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:51:35,127 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:51:35,128 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:51:35,128 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:51:35,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:51:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:51:35,228 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-07 15:51:35,228 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:51:35,229 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:51:35,229 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:51:35,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:51:35,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:51:35,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:51:35,230 INFO L87 Difference]: Start difference. First operand 334 states and 519 transitions. Second operand 3 states. [2019-10-07 15:51:35,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:51:35,271 INFO L93 Difference]: Finished difference Result 825 states and 1310 transitions. [2019-10-07 15:51:35,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:51:35,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-07 15:51:35,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:51:35,277 INFO L225 Difference]: With dead ends: 825 [2019-10-07 15:51:35,277 INFO L226 Difference]: Without dead ends: 523 [2019-10-07 15:51:35,280 INFO L606 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-07 15:51:35,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-10-07 15:51:35,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 521. [2019-10-07 15:51:35,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2019-10-07 15:51:35,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 819 transitions. [2019-10-07 15:51:35,316 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 819 transitions. Word has length 47 [2019-10-07 15:51:35,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:51:35,317 INFO L462 AbstractCegarLoop]: Abstraction has 521 states and 819 transitions. [2019-10-07 15:51:35,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:51:35,317 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 819 transitions. [2019-10-07 15:51:35,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-07 15:51:35,327 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:51:35,327 INFO L385 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-10-07 15:51:35,327 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:51:35,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:51:35,328 INFO L82 PathProgramCache]: Analyzing trace with hash -82051422, now seen corresponding path program 1 times [2019-10-07 15:51:35,328 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:51:35,328 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:51:35,328 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:51:35,328 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:51:35,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:51:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:51:35,417 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-07 15:51:35,417 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:51:35,418 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:51:35,418 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:51:35,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:51:35,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:51:35,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:51:35,419 INFO L87 Difference]: Start difference. First operand 521 states and 819 transitions. Second operand 3 states. [2019-10-07 15:51:35,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:51:35,478 INFO L93 Difference]: Finished difference Result 1341 states and 2138 transitions. [2019-10-07 15:51:35,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:51:35,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-10-07 15:51:35,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:51:35,484 INFO L225 Difference]: With dead ends: 1341 [2019-10-07 15:51:35,484 INFO L226 Difference]: Without dead ends: 868 [2019-10-07 15:51:35,486 INFO L606 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-07 15:51:35,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2019-10-07 15:51:35,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 866. [2019-10-07 15:51:35,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2019-10-07 15:51:35,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1365 transitions. [2019-10-07 15:51:35,527 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1365 transitions. Word has length 49 [2019-10-07 15:51:35,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:51:35,528 INFO L462 AbstractCegarLoop]: Abstraction has 866 states and 1365 transitions. [2019-10-07 15:51:35,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:51:35,528 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1365 transitions. [2019-10-07 15:51:35,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-07 15:51:35,530 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:51:35,531 INFO L385 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-10-07 15:51:35,531 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:51:35,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:51:35,531 INFO L82 PathProgramCache]: Analyzing trace with hash -2105773738, now seen corresponding path program 1 times [2019-10-07 15:51:35,531 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:51:35,532 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:51:35,532 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:51:35,532 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:51:35,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:51:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:51:35,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-10-07 15:51:35,622 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:51:35,622 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:51:35,623 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:51:35,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:51:35,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:51:35,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:51:35,624 INFO L87 Difference]: Start difference. First operand 866 states and 1365 transitions. Second operand 3 states. [2019-10-07 15:51:35,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:51:35,727 INFO L93 Difference]: Finished difference Result 2173 states and 3461 transitions. [2019-10-07 15:51:35,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:51:35,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-10-07 15:51:35,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:51:35,736 INFO L225 Difference]: With dead ends: 2173 [2019-10-07 15:51:35,736 INFO L226 Difference]: Without dead ends: 1355 [2019-10-07 15:51:35,740 INFO L606 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-07 15:51:35,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2019-10-07 15:51:35,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1353. [2019-10-07 15:51:35,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1353 states. [2019-10-07 15:51:35,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 2142 transitions. [2019-10-07 15:51:35,826 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 2142 transitions. Word has length 51 [2019-10-07 15:51:35,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:51:35,830 INFO L462 AbstractCegarLoop]: Abstraction has 1353 states and 2142 transitions. [2019-10-07 15:51:35,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:51:35,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 2142 transitions. [2019-10-07 15:51:35,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-07 15:51:35,832 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:51:35,832 INFO L385 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-10-07 15:51:35,832 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:51:35,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:51:35,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1506952457, now seen corresponding path program 1 times [2019-10-07 15:51:35,841 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:51:35,841 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:51:35,841 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:51:35,841 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:51:35,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:51:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:51:36,000 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-07 15:51:36,001 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:51:36,001 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:51:36,002 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:51:36,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:51:36,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:51:36,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:51:36,005 INFO L87 Difference]: Start difference. First operand 1353 states and 2142 transitions. Second operand 5 states. [2019-10-07 15:51:36,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:51:36,361 INFO L93 Difference]: Finished difference Result 3441 states and 5469 transitions. [2019-10-07 15:51:36,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 15:51:36,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-10-07 15:51:36,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:51:36,375 INFO L225 Difference]: With dead ends: 3441 [2019-10-07 15:51:36,375 INFO L226 Difference]: Without dead ends: 2152 [2019-10-07 15:51:36,379 INFO L606 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-10-07 15:51:36,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2152 states. [2019-10-07 15:51:36,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2152 to 2142. [2019-10-07 15:51:36,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2142 states. [2019-10-07 15:51:36,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 3376 transitions. [2019-10-07 15:51:36,548 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 3376 transitions. Word has length 53 [2019-10-07 15:51:36,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:51:36,549 INFO L462 AbstractCegarLoop]: Abstraction has 2142 states and 3376 transitions. [2019-10-07 15:51:36,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:51:36,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 3376 transitions. [2019-10-07 15:51:36,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-07 15:51:36,550 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:51:36,550 INFO L385 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-10-07 15:51:36,550 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:51:36,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:51:36,551 INFO L82 PathProgramCache]: Analyzing trace with hash 467503626, now seen corresponding path program 1 times [2019-10-07 15:51:36,551 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:51:36,551 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:51:36,551 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:51:36,551 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:51:36,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:51:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:51:36,635 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-07 15:51:36,635 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:51:36,635 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:51:36,635 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 15:51:36,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 15:51:36,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 15:51:36,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 15:51:36,637 INFO L87 Difference]: Start difference. First operand 2142 states and 3376 transitions. Second operand 6 states. [2019-10-07 15:51:37,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:51:37,169 INFO L93 Difference]: Finished difference Result 5867 states and 9260 transitions. [2019-10-07 15:51:37,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 15:51:37,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-10-07 15:51:37,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:51:37,188 INFO L225 Difference]: With dead ends: 5867 [2019-10-07 15:51:37,189 INFO L226 Difference]: Without dead ends: 3789 [2019-10-07 15:51:37,197 INFO L606 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-10-07 15:51:37,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3789 states. [2019-10-07 15:51:37,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3789 to 2571. [2019-10-07 15:51:37,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2571 states. [2019-10-07 15:51:37,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 4020 transitions. [2019-10-07 15:51:37,446 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 4020 transitions. Word has length 54 [2019-10-07 15:51:37,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:51:37,446 INFO L462 AbstractCegarLoop]: Abstraction has 2571 states and 4020 transitions. [2019-10-07 15:51:37,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 15:51:37,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 4020 transitions. [2019-10-07 15:51:37,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-07 15:51:37,447 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:51:37,448 INFO L385 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-10-07 15:51:37,448 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:51:37,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:51:37,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1550658078, now seen corresponding path program 1 times [2019-10-07 15:51:37,449 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:51:37,449 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:51:37,449 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:51:37,449 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:51:37,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:51:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:51:37,526 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-07 15:51:37,527 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:51:37,527 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:51:37,527 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:51:37,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:51:37,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:51:37,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:51:37,529 INFO L87 Difference]: Start difference. First operand 2571 states and 4020 transitions. Second operand 4 states. [2019-10-07 15:51:37,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:51:37,720 INFO L93 Difference]: Finished difference Result 5080 states and 7961 transitions. [2019-10-07 15:51:37,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:51:37,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-10-07 15:51:37,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:51:37,734 INFO L225 Difference]: With dead ends: 5080 [2019-10-07 15:51:37,734 INFO L226 Difference]: Without dead ends: 2573 [2019-10-07 15:51:37,739 INFO L606 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-10-07 15:51:37,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2019-10-07 15:51:37,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 2571. [2019-10-07 15:51:37,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2571 states. [2019-10-07 15:51:37,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 4008 transitions. [2019-10-07 15:51:37,880 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 4008 transitions. Word has length 55 [2019-10-07 15:51:37,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:51:37,880 INFO L462 AbstractCegarLoop]: Abstraction has 2571 states and 4008 transitions. [2019-10-07 15:51:37,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:51:37,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 4008 transitions. [2019-10-07 15:51:37,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-07 15:51:37,881 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:51:37,881 INFO L385 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-10-07 15:51:37,882 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:51:37,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:51:37,882 INFO L82 PathProgramCache]: Analyzing trace with hash 773265745, now seen corresponding path program 1 times [2019-10-07 15:51:37,882 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:51:37,882 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:51:37,883 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:51:37,883 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:51:37,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:51:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:51:37,972 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-07 15:51:37,972 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:51:37,972 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:51:37,973 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:51:37,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:51:37,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:51:37,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:51:37,974 INFO L87 Difference]: Start difference. First operand 2571 states and 4008 transitions. Second operand 4 states. [2019-10-07 15:51:38,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:51:38,192 INFO L93 Difference]: Finished difference Result 5080 states and 7937 transitions. [2019-10-07 15:51:38,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:51:38,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-10-07 15:51:38,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:51:38,205 INFO L225 Difference]: With dead ends: 5080 [2019-10-07 15:51:38,205 INFO L226 Difference]: Without dead ends: 2573 [2019-10-07 15:51:38,213 INFO L606 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-10-07 15:51:38,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2019-10-07 15:51:38,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 2571. [2019-10-07 15:51:38,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2571 states. [2019-10-07 15:51:38,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 3996 transitions. [2019-10-07 15:51:38,356 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 3996 transitions. Word has length 56 [2019-10-07 15:51:38,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:51:38,356 INFO L462 AbstractCegarLoop]: Abstraction has 2571 states and 3996 transitions. [2019-10-07 15:51:38,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:51:38,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3996 transitions. [2019-10-07 15:51:38,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-07 15:51:38,357 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:51:38,357 INFO L385 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-10-07 15:51:38,358 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:51:38,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:51:38,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1410596863, now seen corresponding path program 1 times [2019-10-07 15:51:38,358 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:51:38,359 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:51:38,359 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:51:38,359 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:51:38,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:51:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:51:38,649 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-07 15:51:38,650 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:51:38,650 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:51:38,650 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:51:38,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:51:38,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:51:38,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:51:38,651 INFO L87 Difference]: Start difference. First operand 2571 states and 3996 transitions. Second operand 5 states. [2019-10-07 15:51:38,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:51:38,918 INFO L93 Difference]: Finished difference Result 5080 states and 7913 transitions. [2019-10-07 15:51:38,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 15:51:38,919 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-10-07 15:51:38,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:51:38,932 INFO L225 Difference]: With dead ends: 5080 [2019-10-07 15:51:38,933 INFO L226 Difference]: Without dead ends: 2573 [2019-10-07 15:51:38,939 INFO L606 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-10-07 15:51:38,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2019-10-07 15:51:39,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 2571. [2019-10-07 15:51:39,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2571 states. [2019-10-07 15:51:39,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 3988 transitions. [2019-10-07 15:51:39,118 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 3988 transitions. Word has length 58 [2019-10-07 15:51:39,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:51:39,118 INFO L462 AbstractCegarLoop]: Abstraction has 2571 states and 3988 transitions. [2019-10-07 15:51:39,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:51:39,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3988 transitions. [2019-10-07 15:51:39,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-07 15:51:39,120 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:51:39,120 INFO L385 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-10-07 15:51:39,120 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:51:39,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:51:39,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1114339215, now seen corresponding path program 1 times [2019-10-07 15:51:39,121 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:51:39,121 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:51:39,121 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:51:39,121 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:51:39,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:51:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:51:39,279 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-07 15:51:39,279 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:51:39,279 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:51:39,280 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:51:39,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:51:39,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:51:39,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:51:39,281 INFO L87 Difference]: Start difference. First operand 2571 states and 3988 transitions. Second operand 5 states. [2019-10-07 15:51:39,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:51:39,598 INFO L93 Difference]: Finished difference Result 6291 states and 9761 transitions. [2019-10-07 15:51:39,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 15:51:39,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-10-07 15:51:39,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:51:39,618 INFO L225 Difference]: With dead ends: 6291 [2019-10-07 15:51:39,618 INFO L226 Difference]: Without dead ends: 3784 [2019-10-07 15:51:39,624 INFO L606 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-10-07 15:51:39,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2019-10-07 15:51:39,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 2571. [2019-10-07 15:51:39,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2571 states. [2019-10-07 15:51:39,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 3987 transitions. [2019-10-07 15:51:39,880 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 3987 transitions. Word has length 61 [2019-10-07 15:51:39,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:51:39,880 INFO L462 AbstractCegarLoop]: Abstraction has 2571 states and 3987 transitions. [2019-10-07 15:51:39,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:51:39,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3987 transitions. [2019-10-07 15:51:39,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-07 15:51:39,885 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:51:39,885 INFO L385 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-10-07 15:51:39,886 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:51:39,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:51:39,886 INFO L82 PathProgramCache]: Analyzing trace with hash 195201472, now seen corresponding path program 1 times [2019-10-07 15:51:39,886 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:51:39,886 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:51:39,887 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:51:39,887 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:51:39,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:51:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:51:40,037 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-07 15:51:40,038 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:51:40,038 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:51:40,038 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 15:51:40,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 15:51:40,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 15:51:40,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-07 15:51:40,040 INFO L87 Difference]: Start difference. First operand 2571 states and 3987 transitions. Second operand 7 states. [2019-10-07 15:51:40,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:51:40,650 INFO L93 Difference]: Finished difference Result 7282 states and 11293 transitions. [2019-10-07 15:51:40,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 15:51:40,651 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-10-07 15:51:40,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:51:40,699 INFO L225 Difference]: With dead ends: 7282 [2019-10-07 15:51:40,699 INFO L226 Difference]: Without dead ends: 5543 [2019-10-07 15:51:40,705 INFO L606 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-10-07 15:51:40,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5543 states. [2019-10-07 15:51:41,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5543 to 3604. [2019-10-07 15:51:41,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3604 states. [2019-10-07 15:51:41,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3604 states to 3604 states and 5435 transitions. [2019-10-07 15:51:41,021 INFO L78 Accepts]: Start accepts. Automaton has 3604 states and 5435 transitions. Word has length 62 [2019-10-07 15:51:41,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:51:41,021 INFO L462 AbstractCegarLoop]: Abstraction has 3604 states and 5435 transitions. [2019-10-07 15:51:41,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 15:51:41,021 INFO L276 IsEmpty]: Start isEmpty. Operand 3604 states and 5435 transitions. [2019-10-07 15:51:41,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-07 15:51:41,023 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:51:41,023 INFO L385 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-10-07 15:51:41,023 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:51:41,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:51:41,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1719559429, now seen corresponding path program 1 times [2019-10-07 15:51:41,024 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:51:41,024 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:51:41,024 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:51:41,025 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:51:41,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:51:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:51:41,567 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 15:51:41,568 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:51:41,568 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:51:41,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:51:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:51:41,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-07 15:51:41,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:51:42,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,499 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 15:51:42,499 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:51:42,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,717 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 28 [2019-10-07 15:51:42,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 15:51:42,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,942 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-10-07 15:51:42,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-07 15:51:42,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:42,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:43,391 WARN L191 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-10-07 15:51:43,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-07 15:51:43,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-07 15:51:43,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-07 15:51:43,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:43,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:43,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-07 15:51:43,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-07 15:51:43,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 15:51:43,813 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-10-07 15:51:44,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-07 15:51:44,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 15:51:44,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:44,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-07 15:51:44,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:44,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 15:51:44,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:44,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 15:51:44,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:51:44,445 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 15:51:44,446 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 15:51:44,474 INFO L162 IcfgInterpreter]: Started Sifa with 63 locations of interest [2019-10-07 15:51:44,474 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 15:51:44,481 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 15:51:44,490 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 15:51:44,490 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 15:51:45,021 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 234 [2019-10-07 15:51:45,711 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 282 for LOIs [2019-10-07 15:51:46,113 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 410 [2019-10-07 15:51:46,548 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 455 [2019-10-07 15:51:46,552 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-07 15:52:20,983 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 262144 conjuctions. This might take some time...