/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 04:41:44,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 04:41:44,831 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 04:41:44,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 04:41:44,843 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 04:41:44,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 04:41:44,845 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 04:41:44,847 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 04:41:44,849 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 04:41:44,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 04:41:44,851 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 04:41:44,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 04:41:44,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 04:41:44,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 04:41:44,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 04:41:44,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 04:41:44,856 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 04:41:44,857 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 04:41:44,859 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 04:41:44,861 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 04:41:44,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 04:41:44,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 04:41:44,865 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 04:41:44,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 04:41:44,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 04:41:44,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 04:41:44,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 04:41:44,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 04:41:44,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 04:41:44,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 04:41:44,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 04:41:44,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 04:41:44,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 04:41:44,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 04:41:44,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 04:41:44,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 04:41:44,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 04:41:44,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 04:41:44,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 04:41:44,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 04:41:44,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 04:41:44,879 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 04:41:44,893 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 04:41:44,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 04:41:44,895 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 04:41:44,895 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 04:41:44,895 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 04:41:44,895 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 04:41:44,895 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 04:41:44,896 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 04:41:44,896 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 04:41:44,896 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 04:41:44,896 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 04:41:44,896 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 04:41:44,897 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 04:41:44,897 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 04:41:44,897 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 04:41:44,897 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 04:41:44,897 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 04:41:44,898 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 04:41:44,898 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 04:41:44,898 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 04:41:44,898 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 04:41:44,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:41:44,899 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 04:41:44,899 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 04:41:44,899 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 04:41:44,899 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 04:41:44,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 04:41:44,900 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 04:41:44,900 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-11-07 04:41:45,193 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 04:41:45,216 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 04:41:45,221 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 04:41:45,222 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 04:41:45,222 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 04:41:45,223 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-07 04:41:45,304 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fbb3ba2c/83f9cfcd6d814636a595daea2f9d5930/FLAG56fa7bfa2 [2019-11-07 04:41:45,887 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 04:41:45,888 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-07 04:41:45,913 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fbb3ba2c/83f9cfcd6d814636a595daea2f9d5930/FLAG56fa7bfa2 [2019-11-07 04:41:46,067 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fbb3ba2c/83f9cfcd6d814636a595daea2f9d5930 [2019-11-07 04:41:46,076 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 04:41:46,078 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 04:41:46,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 04:41:46,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 04:41:46,083 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 04:41:46,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:41:46" (1/1) ... [2019-11-07 04:41:46,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48f0e6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:46, skipping insertion in model container [2019-11-07 04:41:46,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:41:46" (1/1) ... [2019-11-07 04:41:46,096 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 04:41:46,178 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 04:41:46,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:41:47,001 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 04:41:47,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:41:47,458 INFO L192 MainTranslator]: Completed translation [2019-11-07 04:41:47,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:47 WrapperNode [2019-11-07 04:41:47,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 04:41:47,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 04:41:47,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 04:41:47,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 04:41:47,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:47" (1/1) ... [2019-11-07 04:41:47,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:47" (1/1) ... [2019-11-07 04:41:47,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:47" (1/1) ... [2019-11-07 04:41:47,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:47" (1/1) ... [2019-11-07 04:41:47,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:47" (1/1) ... [2019-11-07 04:41:47,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:47" (1/1) ... [2019-11-07 04:41:47,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:47" (1/1) ... [2019-11-07 04:41:47,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 04:41:47,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 04:41:47,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 04:41:47,646 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 04:41:47,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:41:47,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 04:41:47,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 04:41:47,747 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 04:41:47,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 04:41:47,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 04:41:47,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 04:41:47,748 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 04:41:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 04:41:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 04:41:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 04:41:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 04:41:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 04:41:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 04:41:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 04:41:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 04:41:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 04:41:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 04:41:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 04:41:50,243 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 04:41:50,244 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 04:41:50,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:41:50 BoogieIcfgContainer [2019-11-07 04:41:50,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 04:41:50,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 04:41:50,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 04:41:50,250 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 04:41:50,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:41:46" (1/3) ... [2019-11-07 04:41:50,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a010a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:41:50, skipping insertion in model container [2019-11-07 04:41:50,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:47" (2/3) ... [2019-11-07 04:41:50,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a010a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:41:50, skipping insertion in model container [2019-11-07 04:41:50,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:41:50" (3/3) ... [2019-11-07 04:41:50,254 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-07 04:41:50,265 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 04:41:50,274 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-07 04:41:50,286 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-07 04:41:50,320 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 04:41:50,320 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 04:41:50,321 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 04:41:50,321 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 04:41:50,321 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 04:41:50,321 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 04:41:50,321 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 04:41:50,322 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 04:41:50,351 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states. [2019-11-07 04:41:50,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-07 04:41:50,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:50,367 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:41:50,369 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:50,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:50,373 INFO L82 PathProgramCache]: Analyzing trace with hash 118183988, now seen corresponding path program 1 times [2019-11-07 04:41:50,381 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:50,382 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038395846] [2019-11-07 04:41:50,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:50,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:41:50,918 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038395846] [2019-11-07 04:41:50,919 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:50,919 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:41:50,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90788169] [2019-11-07 04:41:50,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:41:50,926 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:50,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:41:50,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:41:50,942 INFO L87 Difference]: Start difference. First operand 422 states. Second operand 3 states. [2019-11-07 04:41:51,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:51,131 INFO L93 Difference]: Finished difference Result 626 states and 1096 transitions. [2019-11-07 04:41:51,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:41:51,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-07 04:41:51,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:51,171 INFO L225 Difference]: With dead ends: 626 [2019-11-07 04:41:51,171 INFO L226 Difference]: Without dead ends: 503 [2019-11-07 04:41:51,184 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:41:51,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-11-07 04:41:51,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 497. [2019-11-07 04:41:51,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2019-11-07 04:41:51,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 637 transitions. [2019-11-07 04:41:51,323 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 637 transitions. Word has length 53 [2019-11-07 04:41:51,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:51,324 INFO L462 AbstractCegarLoop]: Abstraction has 497 states and 637 transitions. [2019-11-07 04:41:51,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:41:51,325 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 637 transitions. [2019-11-07 04:41:51,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-07 04:41:51,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:51,337 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:41:51,337 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:51,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:51,339 INFO L82 PathProgramCache]: Analyzing trace with hash 986153255, now seen corresponding path program 1 times [2019-11-07 04:41:51,339 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:51,339 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612012248] [2019-11-07 04:41:51,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:51,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:41:51,547 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612012248] [2019-11-07 04:41:51,547 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:51,548 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:41:51,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290249157] [2019-11-07 04:41:51,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:41:51,550 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:51,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:41:51,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:41:51,551 INFO L87 Difference]: Start difference. First operand 497 states and 637 transitions. Second operand 3 states. [2019-11-07 04:41:51,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:51,622 INFO L93 Difference]: Finished difference Result 828 states and 1093 transitions. [2019-11-07 04:41:51,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:41:51,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-07 04:41:51,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:51,626 INFO L225 Difference]: With dead ends: 828 [2019-11-07 04:41:51,627 INFO L226 Difference]: Without dead ends: 633 [2019-11-07 04:41:51,629 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:41:51,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-11-07 04:41:51,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 627. [2019-11-07 04:41:51,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-11-07 04:41:51,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 814 transitions. [2019-11-07 04:41:51,656 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 814 transitions. Word has length 53 [2019-11-07 04:41:51,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:51,657 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 814 transitions. [2019-11-07 04:41:51,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:41:51,657 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 814 transitions. [2019-11-07 04:41:51,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-07 04:41:51,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:51,660 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:41:51,660 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:51,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:51,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1690641165, now seen corresponding path program 1 times [2019-11-07 04:41:51,661 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:51,661 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868706239] [2019-11-07 04:41:51,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:51,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:41:51,851 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868706239] [2019-11-07 04:41:51,852 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:51,852 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 04:41:51,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045212654] [2019-11-07 04:41:51,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 04:41:51,853 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:51,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 04:41:51,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:41:51,854 INFO L87 Difference]: Start difference. First operand 627 states and 814 transitions. Second operand 10 states. [2019-11-07 04:41:53,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:53,940 INFO L93 Difference]: Finished difference Result 1680 states and 2273 transitions. [2019-11-07 04:41:53,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-07 04:41:53,941 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-11-07 04:41:53,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:53,951 INFO L225 Difference]: With dead ends: 1680 [2019-11-07 04:41:53,951 INFO L226 Difference]: Without dead ends: 1584 [2019-11-07 04:41:53,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2019-11-07 04:41:53,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2019-11-07 04:41:54,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 638. [2019-11-07 04:41:54,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-11-07 04:41:54,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 828 transitions. [2019-11-07 04:41:54,008 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 828 transitions. Word has length 53 [2019-11-07 04:41:54,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:54,009 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 828 transitions. [2019-11-07 04:41:54,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 04:41:54,009 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 828 transitions. [2019-11-07 04:41:54,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 04:41:54,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:54,012 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:41:54,012 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:54,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:54,013 INFO L82 PathProgramCache]: Analyzing trace with hash 826964088, now seen corresponding path program 1 times [2019-11-07 04:41:54,013 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:54,013 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727477417] [2019-11-07 04:41:54,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:54,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:41:54,156 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727477417] [2019-11-07 04:41:54,156 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:54,156 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:41:54,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985831207] [2019-11-07 04:41:54,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:41:54,157 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:54,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:41:54,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:41:54,158 INFO L87 Difference]: Start difference. First operand 638 states and 828 transitions. Second operand 3 states. [2019-11-07 04:41:54,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:54,303 INFO L93 Difference]: Finished difference Result 1145 states and 1509 transitions. [2019-11-07 04:41:54,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:41:54,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-07 04:41:54,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:54,309 INFO L225 Difference]: With dead ends: 1145 [2019-11-07 04:41:54,309 INFO L226 Difference]: Without dead ends: 900 [2019-11-07 04:41:54,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:41:54,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-11-07 04:41:54,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 893. [2019-11-07 04:41:54,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2019-11-07 04:41:54,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1164 transitions. [2019-11-07 04:41:54,364 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1164 transitions. Word has length 54 [2019-11-07 04:41:54,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:54,364 INFO L462 AbstractCegarLoop]: Abstraction has 893 states and 1164 transitions. [2019-11-07 04:41:54,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:41:54,365 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1164 transitions. [2019-11-07 04:41:54,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 04:41:54,367 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:54,367 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:41:54,368 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:54,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:54,368 INFO L82 PathProgramCache]: Analyzing trace with hash 720923157, now seen corresponding path program 1 times [2019-11-07 04:41:54,368 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:54,369 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842547005] [2019-11-07 04:41:54,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:54,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:41:54,568 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842547005] [2019-11-07 04:41:54,568 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:54,568 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-07 04:41:54,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055887896] [2019-11-07 04:41:54,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-07 04:41:54,569 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:54,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-07 04:41:54,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-11-07 04:41:54,570 INFO L87 Difference]: Start difference. First operand 893 states and 1164 transitions. Second operand 12 states. [2019-11-07 04:41:57,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:57,733 INFO L93 Difference]: Finished difference Result 2772 states and 3661 transitions. [2019-11-07 04:41:57,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-07 04:41:57,734 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-11-07 04:41:57,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:57,749 INFO L225 Difference]: With dead ends: 2772 [2019-11-07 04:41:57,749 INFO L226 Difference]: Without dead ends: 2639 [2019-11-07 04:41:57,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2019-11-07 04:41:57,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2639 states. [2019-11-07 04:41:57,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2639 to 909. [2019-11-07 04:41:57,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-11-07 04:41:57,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1187 transitions. [2019-11-07 04:41:57,913 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1187 transitions. Word has length 54 [2019-11-07 04:41:57,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:57,914 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1187 transitions. [2019-11-07 04:41:57,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-07 04:41:57,915 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1187 transitions. [2019-11-07 04:41:58,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 04:41:58,009 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:58,009 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:41:58,009 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:58,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:58,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1425411067, now seen corresponding path program 1 times [2019-11-07 04:41:58,010 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:58,011 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622759384] [2019-11-07 04:41:58,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:58,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:41:58,243 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622759384] [2019-11-07 04:41:58,244 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:58,244 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:41:58,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455369228] [2019-11-07 04:41:58,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:41:58,245 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:58,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:41:58,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:41:58,246 INFO L87 Difference]: Start difference. First operand 909 states and 1187 transitions. Second operand 9 states. [2019-11-07 04:41:59,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:59,623 INFO L93 Difference]: Finished difference Result 3241 states and 4310 transitions. [2019-11-07 04:41:59,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 04:41:59,623 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-11-07 04:41:59,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:59,638 INFO L225 Difference]: With dead ends: 3241 [2019-11-07 04:41:59,638 INFO L226 Difference]: Without dead ends: 2641 [2019-11-07 04:41:59,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-11-07 04:41:59,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2641 states. [2019-11-07 04:41:59,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2641 to 1900. [2019-11-07 04:41:59,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1900 states. [2019-11-07 04:41:59,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 2528 transitions. [2019-11-07 04:41:59,949 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 2528 transitions. Word has length 54 [2019-11-07 04:41:59,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:59,954 INFO L462 AbstractCegarLoop]: Abstraction has 1900 states and 2528 transitions. [2019-11-07 04:41:59,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:41:59,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2528 transitions. [2019-11-07 04:41:59,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 04:41:59,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:59,961 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:41:59,962 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:59,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:59,962 INFO L82 PathProgramCache]: Analyzing trace with hash 671280621, now seen corresponding path program 1 times [2019-11-07 04:41:59,963 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:59,973 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008517047] [2019-11-07 04:41:59,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:00,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:00,247 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008517047] [2019-11-07 04:42:00,247 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:00,248 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 04:42:00,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725179078] [2019-11-07 04:42:00,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 04:42:00,249 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:00,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 04:42:00,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:42:00,250 INFO L87 Difference]: Start difference. First operand 1900 states and 2528 transitions. Second operand 10 states. [2019-11-07 04:42:02,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:02,077 INFO L93 Difference]: Finished difference Result 4351 states and 5721 transitions. [2019-11-07 04:42:02,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-07 04:42:02,077 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-11-07 04:42:02,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:02,096 INFO L225 Difference]: With dead ends: 4351 [2019-11-07 04:42:02,096 INFO L226 Difference]: Without dead ends: 4092 [2019-11-07 04:42:02,098 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-11-07 04:42:02,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4092 states. [2019-11-07 04:42:02,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4092 to 1911. [2019-11-07 04:42:02,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1911 states. [2019-11-07 04:42:02,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 2542 transitions. [2019-11-07 04:42:02,307 INFO L78 Accepts]: Start accepts. Automaton has 1911 states and 2542 transitions. Word has length 54 [2019-11-07 04:42:02,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:02,307 INFO L462 AbstractCegarLoop]: Abstraction has 1911 states and 2542 transitions. [2019-11-07 04:42:02,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 04:42:02,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 2542 transitions. [2019-11-07 04:42:02,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 04:42:02,310 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:02,311 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:02,311 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:02,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:02,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1263798090, now seen corresponding path program 1 times [2019-11-07 04:42:02,312 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:02,312 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077075093] [2019-11-07 04:42:02,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:02,442 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077075093] [2019-11-07 04:42:02,443 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:02,443 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:42:02,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706900438] [2019-11-07 04:42:02,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:42:02,444 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:02,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:42:02,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:42:02,445 INFO L87 Difference]: Start difference. First operand 1911 states and 2542 transitions. Second operand 9 states. [2019-11-07 04:42:04,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:04,095 INFO L93 Difference]: Finished difference Result 4351 states and 5791 transitions. [2019-11-07 04:42:04,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 04:42:04,095 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-11-07 04:42:04,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:04,111 INFO L225 Difference]: With dead ends: 4351 [2019-11-07 04:42:04,112 INFO L226 Difference]: Without dead ends: 3985 [2019-11-07 04:42:04,114 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-11-07 04:42:04,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3985 states. [2019-11-07 04:42:04,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3985 to 1926. [2019-11-07 04:42:04,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1926 states. [2019-11-07 04:42:04,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 2564 transitions. [2019-11-07 04:42:04,414 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 2564 transitions. Word has length 55 [2019-11-07 04:42:04,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:04,414 INFO L462 AbstractCegarLoop]: Abstraction has 1926 states and 2564 transitions. [2019-11-07 04:42:04,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:42:04,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2564 transitions. [2019-11-07 04:42:04,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 04:42:04,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:04,418 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:04,419 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:04,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:04,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1901142492, now seen corresponding path program 1 times [2019-11-07 04:42:04,419 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:04,419 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474660928] [2019-11-07 04:42:04,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:04,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:04,557 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474660928] [2019-11-07 04:42:04,558 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:04,558 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:42:04,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221297773] [2019-11-07 04:42:04,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:42:04,560 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:04,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:42:04,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:42:04,560 INFO L87 Difference]: Start difference. First operand 1926 states and 2564 transitions. Second operand 6 states. [2019-11-07 04:42:05,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:05,131 INFO L93 Difference]: Finished difference Result 3137 states and 4192 transitions. [2019-11-07 04:42:05,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:42:05,131 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-11-07 04:42:05,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:05,138 INFO L225 Difference]: With dead ends: 3137 [2019-11-07 04:42:05,139 INFO L226 Difference]: Without dead ends: 1813 [2019-11-07 04:42:05,141 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:42:05,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2019-11-07 04:42:05,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1342. [2019-11-07 04:42:05,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-11-07 04:42:05,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1765 transitions. [2019-11-07 04:42:05,322 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1765 transitions. Word has length 55 [2019-11-07 04:42:05,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:05,323 INFO L462 AbstractCegarLoop]: Abstraction has 1342 states and 1765 transitions. [2019-11-07 04:42:05,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:42:05,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1765 transitions. [2019-11-07 04:42:05,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 04:42:05,327 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:05,327 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:05,328 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:05,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:05,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1734009014, now seen corresponding path program 1 times [2019-11-07 04:42:05,328 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:05,329 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732100435] [2019-11-07 04:42:05,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:05,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:05,479 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732100435] [2019-11-07 04:42:05,480 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:05,482 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 04:42:05,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407619345] [2019-11-07 04:42:05,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 04:42:05,484 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:05,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 04:42:05,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:42:05,484 INFO L87 Difference]: Start difference. First operand 1342 states and 1765 transitions. Second operand 10 states. [2019-11-07 04:42:09,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:09,084 INFO L93 Difference]: Finished difference Result 6178 states and 8352 transitions. [2019-11-07 04:42:09,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-07 04:42:09,084 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-11-07 04:42:09,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:09,103 INFO L225 Difference]: With dead ends: 6178 [2019-11-07 04:42:09,103 INFO L226 Difference]: Without dead ends: 5828 [2019-11-07 04:42:09,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=240, Invalid=516, Unknown=0, NotChecked=0, Total=756 [2019-11-07 04:42:09,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5828 states. [2019-11-07 04:42:09,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5828 to 1342. [2019-11-07 04:42:09,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-11-07 04:42:09,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1765 transitions. [2019-11-07 04:42:09,314 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1765 transitions. Word has length 55 [2019-11-07 04:42:09,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:09,315 INFO L462 AbstractCegarLoop]: Abstraction has 1342 states and 1765 transitions. [2019-11-07 04:42:09,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 04:42:09,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1765 transitions. [2019-11-07 04:42:09,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 04:42:09,317 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:09,317 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:09,317 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:09,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:09,318 INFO L82 PathProgramCache]: Analyzing trace with hash -810802093, now seen corresponding path program 1 times [2019-11-07 04:42:09,318 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:09,318 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483764553] [2019-11-07 04:42:09,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:09,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:09,474 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483764553] [2019-11-07 04:42:09,474 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:09,474 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:42:09,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489894547] [2019-11-07 04:42:09,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:42:09,475 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:09,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:42:09,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:42:09,475 INFO L87 Difference]: Start difference. First operand 1342 states and 1765 transitions. Second operand 9 states. [2019-11-07 04:42:11,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:11,381 INFO L93 Difference]: Finished difference Result 5855 states and 7757 transitions. [2019-11-07 04:42:11,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 04:42:11,382 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-11-07 04:42:11,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:11,407 INFO L225 Difference]: With dead ends: 5855 [2019-11-07 04:42:11,407 INFO L226 Difference]: Without dead ends: 4755 [2019-11-07 04:42:11,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-11-07 04:42:11,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4755 states. [2019-11-07 04:42:11,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4755 to 3230. [2019-11-07 04:42:11,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3230 states. [2019-11-07 04:42:11,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3230 states to 3230 states and 4279 transitions. [2019-11-07 04:42:11,868 INFO L78 Accepts]: Start accepts. Automaton has 3230 states and 4279 transitions. Word has length 55 [2019-11-07 04:42:11,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:11,868 INFO L462 AbstractCegarLoop]: Abstraction has 3230 states and 4279 transitions. [2019-11-07 04:42:11,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:42:11,868 INFO L276 IsEmpty]: Start isEmpty. Operand 3230 states and 4279 transitions. [2019-11-07 04:42:11,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 04:42:11,873 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:11,873 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:11,873 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:11,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:11,874 INFO L82 PathProgramCache]: Analyzing trace with hash -890852479, now seen corresponding path program 1 times [2019-11-07 04:42:11,874 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:11,874 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636986216] [2019-11-07 04:42:11,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:11,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:11,984 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636986216] [2019-11-07 04:42:11,984 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:11,984 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:42:11,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414937592] [2019-11-07 04:42:11,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:42:11,985 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:11,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:42:11,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:42:11,986 INFO L87 Difference]: Start difference. First operand 3230 states and 4279 transitions. Second operand 9 states. [2019-11-07 04:42:16,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:16,596 INFO L93 Difference]: Finished difference Result 12907 states and 17014 transitions. [2019-11-07 04:42:16,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-07 04:42:16,596 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-11-07 04:42:16,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:16,630 INFO L225 Difference]: With dead ends: 12907 [2019-11-07 04:42:16,630 INFO L226 Difference]: Without dead ends: 11893 [2019-11-07 04:42:16,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2019-11-07 04:42:16,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11893 states. [2019-11-07 04:42:17,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11893 to 3244. [2019-11-07 04:42:17,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3244 states. [2019-11-07 04:42:17,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 3244 states and 4297 transitions. [2019-11-07 04:42:17,219 INFO L78 Accepts]: Start accepts. Automaton has 3244 states and 4297 transitions. Word has length 55 [2019-11-07 04:42:17,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:17,219 INFO L462 AbstractCegarLoop]: Abstraction has 3244 states and 4297 transitions. [2019-11-07 04:42:17,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:42:17,219 INFO L276 IsEmpty]: Start isEmpty. Operand 3244 states and 4297 transitions. [2019-11-07 04:42:17,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 04:42:17,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:17,223 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:17,223 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:17,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:17,224 INFO L82 PathProgramCache]: Analyzing trace with hash 154971769, now seen corresponding path program 1 times [2019-11-07 04:42:17,224 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:17,224 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397934258] [2019-11-07 04:42:17,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:17,372 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397934258] [2019-11-07 04:42:17,372 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:17,372 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 04:42:17,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747086334] [2019-11-07 04:42:17,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 04:42:17,375 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:17,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 04:42:17,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:42:17,376 INFO L87 Difference]: Start difference. First operand 3244 states and 4297 transitions. Second operand 7 states. [2019-11-07 04:42:19,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:19,602 INFO L93 Difference]: Finished difference Result 7810 states and 10405 transitions. [2019-11-07 04:42:19,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 04:42:19,603 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-11-07 04:42:19,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:19,617 INFO L225 Difference]: With dead ends: 7810 [2019-11-07 04:42:19,617 INFO L226 Difference]: Without dead ends: 7307 [2019-11-07 04:42:19,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-11-07 04:42:19,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7307 states. [2019-11-07 04:42:20,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7307 to 3262. [2019-11-07 04:42:20,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3262 states. [2019-11-07 04:42:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 4321 transitions. [2019-11-07 04:42:20,285 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 4321 transitions. Word has length 55 [2019-11-07 04:42:20,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:20,285 INFO L462 AbstractCegarLoop]: Abstraction has 3262 states and 4321 transitions. [2019-11-07 04:42:20,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 04:42:20,287 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 4321 transitions. [2019-11-07 04:42:20,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-07 04:42:20,291 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:20,291 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:20,291 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:20,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:20,292 INFO L82 PathProgramCache]: Analyzing trace with hash 377850356, now seen corresponding path program 1 times [2019-11-07 04:42:20,292 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:20,292 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485193354] [2019-11-07 04:42:20,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:20,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:20,391 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485193354] [2019-11-07 04:42:20,392 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:20,392 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 04:42:20,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316757942] [2019-11-07 04:42:20,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 04:42:20,392 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:20,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 04:42:20,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:42:20,393 INFO L87 Difference]: Start difference. First operand 3262 states and 4321 transitions. Second operand 7 states.