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-f4eb214f-m [2019-10-13 23:22:05,775 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:22:05,778 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:22:05,799 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:22:05,799 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:22:05,802 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:22:05,803 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:22:05,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:22:05,818 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:22:05,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:22:05,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:22:05,823 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:22:05,823 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:22:05,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:22:05,830 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:22:05,831 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:22:05,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:22:05,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:22:05,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:22:05,843 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:22:05,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:22:05,852 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:22:05,854 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:22:05,856 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:22:05,858 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:22:05,858 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:22:05,858 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:22:05,859 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:22:05,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:22:05,862 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:22:05,863 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:22:05,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:22:05,865 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:22:05,866 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:22:05,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:22:05,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:22:05,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:22:05,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:22:05,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:22:05,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:22:05,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:22:05,872 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 23:22:05,891 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:22:05,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:22:05,894 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:22:05,895 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:22:05,895 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:22:05,895 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:22:05,895 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:22:05,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:22:05,896 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:22:05,896 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:22:05,897 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:22:05,897 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:22:05,898 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:22:05,898 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:22:05,898 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:22:05,898 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:22:05,899 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:22:05,899 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:22:05,899 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:22:05,899 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:22:05,900 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:22:05,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:22:05,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:22:05,900 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:22:05,900 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:22:05,901 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:22:05,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:22:05,901 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:22:05,901 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 23:22:06,227 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:22:06,241 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:22:06,245 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:22:06,246 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:22:06,246 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:22:06,247 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-13 23:22:06,310 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35c4d80b6/fdc70c5b20614c72b43d71de58fbba2d/FLAG0b77d3e80 [2019-10-13 23:22:06,846 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:22:06,847 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-13 23:22:06,866 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35c4d80b6/fdc70c5b20614c72b43d71de58fbba2d/FLAG0b77d3e80 [2019-10-13 23:22:07,160 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35c4d80b6/fdc70c5b20614c72b43d71de58fbba2d [2019-10-13 23:22:07,170 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:22:07,171 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:22:07,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:22:07,173 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:22:07,176 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:22:07,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:22:07" (1/1) ... [2019-10-13 23:22:07,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a88d122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:07, skipping insertion in model container [2019-10-13 23:22:07,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:22:07" (1/1) ... [2019-10-13 23:22:07,188 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:22:07,243 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:22:07,517 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:22:07,534 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:22:07,718 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:22:07,746 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:22:07,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:07 WrapperNode [2019-10-13 23:22:07,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:22:07,748 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:22:07,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:22:07,748 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:22:07,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:07" (1/1) ... [2019-10-13 23:22:07,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:07" (1/1) ... [2019-10-13 23:22:07,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:07" (1/1) ... [2019-10-13 23:22:07,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:07" (1/1) ... [2019-10-13 23:22:07,792 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:07" (1/1) ... [2019-10-13 23:22:07,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:07" (1/1) ... [2019-10-13 23:22:07,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:07" (1/1) ... [2019-10-13 23:22:07,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:22:07,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:22:07,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:22:07,825 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:22:07,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:22:07,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:22:07,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:22:07,884 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:22:07,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:22:07,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 23:22:07,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-13 23:22:07,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 23:22:07,886 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 23:22:07,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 23:22:07,886 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 23:22:07,887 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 23:22:07,888 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 23:22:07,888 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 23:22:07,888 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 23:22:07,888 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 23:22:07,888 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 23:22:07,891 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:22:07,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:22:07,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:22:09,483 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:22:09,483 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 23:22:09,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:22:09 BoogieIcfgContainer [2019-10-13 23:22:09,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:22:09,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:22:09,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:22:09,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:22:09,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:22:07" (1/3) ... [2019-10-13 23:22:09,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a6f0cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:22:09, skipping insertion in model container [2019-10-13 23:22:09,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:07" (2/3) ... [2019-10-13 23:22:09,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a6f0cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:22:09, skipping insertion in model container [2019-10-13 23:22:09,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:22:09" (3/3) ... [2019-10-13 23:22:09,493 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-10-13 23:22:09,503 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:22:09,512 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 23:22:09,524 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 23:22:09,550 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:22:09,550 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:22:09,551 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:22:09,551 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:22:09,551 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:22:09,551 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:22:09,552 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:22:09,552 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:22:09,573 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2019-10-13 23:22:09,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 23:22:09,582 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:09,583 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:09,585 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:09,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:09,592 INFO L82 PathProgramCache]: Analyzing trace with hash 2138769479, now seen corresponding path program 1 times [2019-10-13 23:22:09,602 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:09,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785086846] [2019-10-13 23:22:09,602 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:09,603 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:09,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:10,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:10,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785086846] [2019-10-13 23:22:10,042 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:10,043 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:10,043 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540451103] [2019-10-13 23:22:10,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:10,049 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:10,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:10,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:10,066 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2019-10-13 23:22:10,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:10,171 INFO L93 Difference]: Finished difference Result 220 states and 356 transitions. [2019-10-13 23:22:10,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:10,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-13 23:22:10,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:10,199 INFO L225 Difference]: With dead ends: 220 [2019-10-13 23:22:10,199 INFO L226 Difference]: Without dead ends: 144 [2019-10-13 23:22:10,207 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:10,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-10-13 23:22:10,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2019-10-13 23:22:10,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-10-13 23:22:10,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 213 transitions. [2019-10-13 23:22:10,314 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 213 transitions. Word has length 41 [2019-10-13 23:22:10,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:10,315 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 213 transitions. [2019-10-13 23:22:10,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:10,315 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 213 transitions. [2019-10-13 23:22:10,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-13 23:22:10,319 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:10,319 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:10,320 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:10,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:10,321 INFO L82 PathProgramCache]: Analyzing trace with hash 2105877559, now seen corresponding path program 1 times [2019-10-13 23:22:10,321 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:10,322 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475889815] [2019-10-13 23:22:10,322 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:10,322 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:10,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:10,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:10,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475889815] [2019-10-13 23:22:10,501 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:10,502 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:10,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111627946] [2019-10-13 23:22:10,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:10,505 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:10,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:10,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:10,506 INFO L87 Difference]: Start difference. First operand 142 states and 213 transitions. Second operand 3 states. [2019-10-13 23:22:10,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:10,585 INFO L93 Difference]: Finished difference Result 319 states and 500 transitions. [2019-10-13 23:22:10,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:10,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-13 23:22:10,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:10,588 INFO L225 Difference]: With dead ends: 319 [2019-10-13 23:22:10,589 INFO L226 Difference]: Without dead ends: 207 [2019-10-13 23:22:10,590 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:10,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-10-13 23:22:10,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2019-10-13 23:22:10,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-13 23:22:10,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 312 transitions. [2019-10-13 23:22:10,645 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 312 transitions. Word has length 43 [2019-10-13 23:22:10,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:10,645 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 312 transitions. [2019-10-13 23:22:10,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:10,646 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 312 transitions. [2019-10-13 23:22:10,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-13 23:22:10,647 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:10,648 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:10,648 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:10,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:10,649 INFO L82 PathProgramCache]: Analyzing trace with hash -486820712, now seen corresponding path program 1 times [2019-10-13 23:22:10,649 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:10,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609034911] [2019-10-13 23:22:10,649 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:10,649 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:10,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:10,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:10,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609034911] [2019-10-13 23:22:10,758 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:10,759 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:10,759 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532596496] [2019-10-13 23:22:10,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:10,760 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:10,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:10,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:10,762 INFO L87 Difference]: Start difference. First operand 205 states and 312 transitions. Second operand 3 states. [2019-10-13 23:22:10,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:10,804 INFO L93 Difference]: Finished difference Result 509 states and 803 transitions. [2019-10-13 23:22:10,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:10,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-13 23:22:10,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:10,807 INFO L225 Difference]: With dead ends: 509 [2019-10-13 23:22:10,807 INFO L226 Difference]: Without dead ends: 336 [2019-10-13 23:22:10,809 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:10,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-10-13 23:22:10,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-10-13 23:22:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-10-13 23:22:10,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 519 transitions. [2019-10-13 23:22:10,833 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 519 transitions. Word has length 45 [2019-10-13 23:22:10,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:10,834 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 519 transitions. [2019-10-13 23:22:10,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:10,834 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 519 transitions. [2019-10-13 23:22:10,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-13 23:22:10,835 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:10,835 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:10,836 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:10,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:10,836 INFO L82 PathProgramCache]: Analyzing trace with hash 219909761, now seen corresponding path program 1 times [2019-10-13 23:22:10,836 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:10,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757012848] [2019-10-13 23:22:10,837 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:10,837 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:10,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:10,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:10,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757012848] [2019-10-13 23:22:10,914 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:10,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:10,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773741856] [2019-10-13 23:22:10,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:10,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:10,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:10,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:10,916 INFO L87 Difference]: Start difference. First operand 334 states and 519 transitions. Second operand 3 states. [2019-10-13 23:22:10,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:10,958 INFO L93 Difference]: Finished difference Result 825 states and 1310 transitions. [2019-10-13 23:22:10,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:10,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-13 23:22:10,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:10,962 INFO L225 Difference]: With dead ends: 825 [2019-10-13 23:22:10,963 INFO L226 Difference]: Without dead ends: 523 [2019-10-13 23:22:10,965 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:10,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-10-13 23:22:10,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 521. [2019-10-13 23:22:10,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2019-10-13 23:22:10,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 819 transitions. [2019-10-13 23:22:10,991 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 819 transitions. Word has length 47 [2019-10-13 23:22:10,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:10,992 INFO L462 AbstractCegarLoop]: Abstraction has 521 states and 819 transitions. [2019-10-13 23:22:10,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:10,992 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 819 transitions. [2019-10-13 23:22:10,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-13 23:22:10,993 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:10,994 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:10,994 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:10,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:10,994 INFO L82 PathProgramCache]: Analyzing trace with hash -82051422, now seen corresponding path program 1 times [2019-10-13 23:22:10,995 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:10,995 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835462857] [2019-10-13 23:22:10,995 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:10,995 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:10,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:11,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:11,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835462857] [2019-10-13 23:22:11,060 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:11,060 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:11,060 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518126723] [2019-10-13 23:22:11,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:11,061 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:11,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:11,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:11,062 INFO L87 Difference]: Start difference. First operand 521 states and 819 transitions. Second operand 3 states. [2019-10-13 23:22:11,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:11,111 INFO L93 Difference]: Finished difference Result 1341 states and 2138 transitions. [2019-10-13 23:22:11,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:11,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-10-13 23:22:11,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:11,116 INFO L225 Difference]: With dead ends: 1341 [2019-10-13 23:22:11,117 INFO L226 Difference]: Without dead ends: 868 [2019-10-13 23:22:11,119 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:11,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2019-10-13 23:22:11,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 866. [2019-10-13 23:22:11,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2019-10-13 23:22:11,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1365 transitions. [2019-10-13 23:22:11,163 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1365 transitions. Word has length 49 [2019-10-13 23:22:11,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:11,163 INFO L462 AbstractCegarLoop]: Abstraction has 866 states and 1365 transitions. [2019-10-13 23:22:11,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:11,163 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1365 transitions. [2019-10-13 23:22:11,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-13 23:22:11,164 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:11,168 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:11,169 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:11,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:11,169 INFO L82 PathProgramCache]: Analyzing trace with hash -2105773738, now seen corresponding path program 1 times [2019-10-13 23:22:11,169 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:11,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689003379] [2019-10-13 23:22:11,170 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:11,170 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:11,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:11,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:11,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689003379] [2019-10-13 23:22:11,274 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:11,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:11,275 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996131564] [2019-10-13 23:22:11,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:11,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:11,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:11,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:11,276 INFO L87 Difference]: Start difference. First operand 866 states and 1365 transitions. Second operand 3 states. [2019-10-13 23:22:11,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:11,345 INFO L93 Difference]: Finished difference Result 2173 states and 3461 transitions. [2019-10-13 23:22:11,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:11,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-10-13 23:22:11,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:11,354 INFO L225 Difference]: With dead ends: 2173 [2019-10-13 23:22:11,354 INFO L226 Difference]: Without dead ends: 1355 [2019-10-13 23:22:11,356 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:11,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2019-10-13 23:22:11,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1353. [2019-10-13 23:22:11,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1353 states. [2019-10-13 23:22:11,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 2142 transitions. [2019-10-13 23:22:11,422 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 2142 transitions. Word has length 51 [2019-10-13 23:22:11,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:11,423 INFO L462 AbstractCegarLoop]: Abstraction has 1353 states and 2142 transitions. [2019-10-13 23:22:11,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:11,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 2142 transitions. [2019-10-13 23:22:11,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-13 23:22:11,424 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:11,424 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:11,424 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:11,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:11,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1506952457, now seen corresponding path program 1 times [2019-10-13 23:22:11,425 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:11,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133436583] [2019-10-13 23:22:11,426 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:11,426 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:11,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:11,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-10-13 23:22:11,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133436583] [2019-10-13 23:22:11,568 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:11,568 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:11,569 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683757800] [2019-10-13 23:22:11,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:11,570 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:11,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:11,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:11,571 INFO L87 Difference]: Start difference. First operand 1353 states and 2142 transitions. Second operand 5 states. [2019-10-13 23:22:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:11,899 INFO L93 Difference]: Finished difference Result 3441 states and 5469 transitions. [2019-10-13 23:22:11,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 23:22:11,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-10-13 23:22:11,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:11,912 INFO L225 Difference]: With dead ends: 3441 [2019-10-13 23:22:11,912 INFO L226 Difference]: Without dead ends: 2152 [2019-10-13 23:22:11,915 INFO L600 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-13 23:22:11,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2152 states. [2019-10-13 23:22:12,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2152 to 2142. [2019-10-13 23:22:12,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2142 states. [2019-10-13 23:22:12,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 3376 transitions. [2019-10-13 23:22:12,039 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 3376 transitions. Word has length 53 [2019-10-13 23:22:12,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:12,042 INFO L462 AbstractCegarLoop]: Abstraction has 2142 states and 3376 transitions. [2019-10-13 23:22:12,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:12,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 3376 transitions. [2019-10-13 23:22:12,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 23:22:12,043 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:12,043 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:12,043 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:12,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:12,044 INFO L82 PathProgramCache]: Analyzing trace with hash 467503626, now seen corresponding path program 1 times [2019-10-13 23:22:12,044 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:12,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249743825] [2019-10-13 23:22:12,044 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:12,045 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:12,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:12,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:12,186 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249743825] [2019-10-13 23:22:12,186 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:12,186 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:22:12,186 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927862664] [2019-10-13 23:22:12,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:22:12,187 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:12,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:22:12,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:22:12,188 INFO L87 Difference]: Start difference. First operand 2142 states and 3376 transitions. Second operand 6 states. [2019-10-13 23:22:12,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:12,683 INFO L93 Difference]: Finished difference Result 5867 states and 9260 transitions. [2019-10-13 23:22:12,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 23:22:12,684 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-10-13 23:22:12,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:12,737 INFO L225 Difference]: With dead ends: 5867 [2019-10-13 23:22:12,738 INFO L226 Difference]: Without dead ends: 3789 [2019-10-13 23:22:12,741 INFO L600 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-13 23:22:12,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3789 states. [2019-10-13 23:22:12,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3789 to 2571. [2019-10-13 23:22:12,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2571 states. [2019-10-13 23:22:12,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 4020 transitions. [2019-10-13 23:22:12,890 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 4020 transitions. Word has length 54 [2019-10-13 23:22:12,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:12,890 INFO L462 AbstractCegarLoop]: Abstraction has 2571 states and 4020 transitions. [2019-10-13 23:22:12,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:22:12,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 4020 transitions. [2019-10-13 23:22:12,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:22:12,891 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:12,892 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:12,892 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:12,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:12,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1550658078, now seen corresponding path program 1 times [2019-10-13 23:22:12,893 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:12,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352097015] [2019-10-13 23:22:12,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:12,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:12,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:12,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:12,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352097015] [2019-10-13 23:22:12,958 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:12,958 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:12,958 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810849009] [2019-10-13 23:22:12,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:12,959 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:12,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:12,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:12,960 INFO L87 Difference]: Start difference. First operand 2571 states and 4020 transitions. Second operand 4 states. [2019-10-13 23:22:13,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:13,169 INFO L93 Difference]: Finished difference Result 5080 states and 7961 transitions. [2019-10-13 23:22:13,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:13,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-10-13 23:22:13,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:13,183 INFO L225 Difference]: With dead ends: 5080 [2019-10-13 23:22:13,183 INFO L226 Difference]: Without dead ends: 2573 [2019-10-13 23:22:13,189 INFO L600 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-13 23:22:13,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2019-10-13 23:22:13,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 2571. [2019-10-13 23:22:13,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2571 states. [2019-10-13 23:22:13,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 4008 transitions. [2019-10-13 23:22:13,388 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 4008 transitions. Word has length 55 [2019-10-13 23:22:13,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:13,389 INFO L462 AbstractCegarLoop]: Abstraction has 2571 states and 4008 transitions. [2019-10-13 23:22:13,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:13,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 4008 transitions. [2019-10-13 23:22:13,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 23:22:13,390 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:13,390 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:13,394 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:13,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:13,395 INFO L82 PathProgramCache]: Analyzing trace with hash 773265745, now seen corresponding path program 1 times [2019-10-13 23:22:13,395 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:13,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541151925] [2019-10-13 23:22:13,400 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:13,400 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:13,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:13,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:13,512 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541151925] [2019-10-13 23:22:13,513 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:13,513 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:13,514 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49076219] [2019-10-13 23:22:13,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:13,515 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:13,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:13,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:13,515 INFO L87 Difference]: Start difference. First operand 2571 states and 4008 transitions. Second operand 4 states. [2019-10-13 23:22:13,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:13,702 INFO L93 Difference]: Finished difference Result 5080 states and 7937 transitions. [2019-10-13 23:22:13,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:13,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-10-13 23:22:13,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:13,715 INFO L225 Difference]: With dead ends: 5080 [2019-10-13 23:22:13,715 INFO L226 Difference]: Without dead ends: 2573 [2019-10-13 23:22:13,729 INFO L600 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-13 23:22:13,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2019-10-13 23:22:13,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 2571. [2019-10-13 23:22:13,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2571 states. [2019-10-13 23:22:13,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 3996 transitions. [2019-10-13 23:22:13,873 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 3996 transitions. Word has length 56 [2019-10-13 23:22:13,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:13,873 INFO L462 AbstractCegarLoop]: Abstraction has 2571 states and 3996 transitions. [2019-10-13 23:22:13,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:13,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3996 transitions. [2019-10-13 23:22:13,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 23:22:13,874 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:13,874 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:13,875 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:13,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:13,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1410596863, now seen corresponding path program 1 times [2019-10-13 23:22:13,875 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:13,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328713641] [2019-10-13 23:22:13,876 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:13,876 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:13,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:14,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:14,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328713641] [2019-10-13 23:22:14,162 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:14,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:14,163 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803849774] [2019-10-13 23:22:14,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:14,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:14,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:14,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:14,164 INFO L87 Difference]: Start difference. First operand 2571 states and 3996 transitions. Second operand 5 states. [2019-10-13 23:22:14,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:14,400 INFO L93 Difference]: Finished difference Result 5080 states and 7913 transitions. [2019-10-13 23:22:14,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:14,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-10-13 23:22:14,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:14,414 INFO L225 Difference]: With dead ends: 5080 [2019-10-13 23:22:14,414 INFO L226 Difference]: Without dead ends: 2573 [2019-10-13 23:22:14,420 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:22:14,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2019-10-13 23:22:14,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 2571. [2019-10-13 23:22:14,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2571 states. [2019-10-13 23:22:14,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 3988 transitions. [2019-10-13 23:22:14,593 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 3988 transitions. Word has length 58 [2019-10-13 23:22:14,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:14,593 INFO L462 AbstractCegarLoop]: Abstraction has 2571 states and 3988 transitions. [2019-10-13 23:22:14,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:14,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3988 transitions. [2019-10-13 23:22:14,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-13 23:22:14,594 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:14,595 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:14,595 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:14,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:14,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1114339215, now seen corresponding path program 1 times [2019-10-13 23:22:14,595 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:14,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116894505] [2019-10-13 23:22:14,596 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:14,596 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:14,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:14,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:14,767 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116894505] [2019-10-13 23:22:14,768 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:14,768 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:14,768 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776933433] [2019-10-13 23:22:14,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:14,769 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:14,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:14,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:14,769 INFO L87 Difference]: Start difference. First operand 2571 states and 3988 transitions. Second operand 5 states. [2019-10-13 23:22:15,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:15,112 INFO L93 Difference]: Finished difference Result 6291 states and 9761 transitions. [2019-10-13 23:22:15,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:15,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-10-13 23:22:15,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:15,133 INFO L225 Difference]: With dead ends: 6291 [2019-10-13 23:22:15,133 INFO L226 Difference]: Without dead ends: 3784 [2019-10-13 23:22:15,140 INFO L600 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-13 23:22:15,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2019-10-13 23:22:15,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 2571. [2019-10-13 23:22:15,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2571 states. [2019-10-13 23:22:15,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 3987 transitions. [2019-10-13 23:22:15,311 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 3987 transitions. Word has length 61 [2019-10-13 23:22:15,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:15,312 INFO L462 AbstractCegarLoop]: Abstraction has 2571 states and 3987 transitions. [2019-10-13 23:22:15,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:15,312 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3987 transitions. [2019-10-13 23:22:15,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-13 23:22:15,312 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:15,313 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:15,313 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:15,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:15,313 INFO L82 PathProgramCache]: Analyzing trace with hash 195201472, now seen corresponding path program 1 times [2019-10-13 23:22:15,313 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:15,314 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327407443] [2019-10-13 23:22:15,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:15,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:15,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:15,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:15,430 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327407443] [2019-10-13 23:22:15,430 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:15,430 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:22:15,430 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109303910] [2019-10-13 23:22:15,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:22:15,431 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:15,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:22:15,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:22:15,432 INFO L87 Difference]: Start difference. First operand 2571 states and 3987 transitions. Second operand 7 states. [2019-10-13 23:22:16,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:16,048 INFO L93 Difference]: Finished difference Result 7282 states and 11293 transitions. [2019-10-13 23:22:16,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 23:22:16,048 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-10-13 23:22:16,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:16,076 INFO L225 Difference]: With dead ends: 7282 [2019-10-13 23:22:16,076 INFO L226 Difference]: Without dead ends: 5543 [2019-10-13 23:22:16,081 INFO L600 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-13 23:22:16,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5543 states. [2019-10-13 23:22:16,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5543 to 3604. [2019-10-13 23:22:16,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3604 states. [2019-10-13 23:22:16,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3604 states to 3604 states and 5435 transitions. [2019-10-13 23:22:16,339 INFO L78 Accepts]: Start accepts. Automaton has 3604 states and 5435 transitions. Word has length 62 [2019-10-13 23:22:16,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:16,340 INFO L462 AbstractCegarLoop]: Abstraction has 3604 states and 5435 transitions. [2019-10-13 23:22:16,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:22:16,340 INFO L276 IsEmpty]: Start isEmpty. Operand 3604 states and 5435 transitions. [2019-10-13 23:22:16,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-13 23:22:16,341 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:16,341 INFO L380 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-13 23:22:16,342 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:16,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:16,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1719559429, now seen corresponding path program 1 times [2019-10-13 23:22:16,342 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:16,342 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194102499] [2019-10-13 23:22:16,342 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:16,343 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:16,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:16,806 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-10-13 23:22:17,076 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-13 23:22:17,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194102499] [2019-10-13 23:22:17,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74912349] [2019-10-13 23:22:17,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:22:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:17,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-13 23:22:17,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:22:17,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:17,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:17,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:17,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:17,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:17,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:17,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:17,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:17,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:17,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:17,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:17,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:17,962 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-13 23:22:17,962 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:22:17,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:17,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:17,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:17,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:17,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:17,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:17,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:17,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,215 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 28 [2019-10-13 23:22:18,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 23:22:18,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,480 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-10-13 23:22:18,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 23:22:18,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,943 WARN L191 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-10-13 23:22:18,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-13 23:22:18,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 23:22:18,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 23:22:18,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-13 23:22:19,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 23:22:19,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 23:22:19,410 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-10-13 23:22:19,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 23:22:19,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 23:22:19,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 23:22:19,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 23:22:19,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 23:22:19,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:20,091 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-13 23:22:20,091 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2052402350] [2019-10-13 23:22:20,123 INFO L162 IcfgInterpreter]: Started Sifa with 63 locations of interest [2019-10-13 23:22:20,123 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:22:20,129 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:22:20,137 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:22:20,138 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:22:21,184 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 234 [2019-10-13 23:22:21,432 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 234 [2019-10-13 23:22:21,451 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 282 for LOIs [2019-10-13 23:22:21,556 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 282 [2019-10-13 23:22:21,764 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 292 [2019-10-13 23:22:22,012 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 410 [2019-10-13 23:22:22,560 WARN L191 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 455 [2019-10-13 23:22:22,568 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12