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 -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:25:06,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:25:06,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:25:06,961 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:25:06,961 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:25:06,962 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:25:06,964 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:25:06,966 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:25:06,967 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:25:06,968 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:25:06,969 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:25:06,970 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:25:06,971 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:25:06,972 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:25:06,973 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:25:06,974 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:25:06,975 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:25:06,976 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:25:06,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:25:06,981 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:25:06,984 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:25:06,987 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:25:06,989 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:25:06,990 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:25:06,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:25:06,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:25:06,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:25:06,999 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:25:06,999 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:25:07,000 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:25:07,000 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:25:07,001 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:25:07,002 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:25:07,003 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:25:07,004 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:25:07,004 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:25:07,005 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:25:07,005 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:25:07,005 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:25:07,006 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:25:07,007 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:25:07,007 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-09-08 11:25:07,029 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:25:07,029 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:25:07,033 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:25:07,034 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:25:07,034 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:25:07,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:25:07,034 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:25:07,035 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:25:07,035 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:25:07,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:25:07,036 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:25:07,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:25:07,037 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:25:07,037 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:25:07,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:25:07,037 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:25:07,038 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:25:07,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:25:07,038 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:25:07,038 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:25:07,039 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:25:07,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:25:07,039 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:25:07,040 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:25:07,040 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:25:07,040 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:25:07,040 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:25:07,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:25:07,041 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:25:07,082 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:25:07,097 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:25:07,107 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:25:07,108 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:25:07,109 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:25:07,109 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2019-09-08 11:25:07,187 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3c059335/074b63fdcdcb48f6b22e59d8c403e6ec/FLAGeefa686ba [2019-09-08 11:25:07,739 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:25:07,743 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2019-09-08 11:25:07,759 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3c059335/074b63fdcdcb48f6b22e59d8c403e6ec/FLAGeefa686ba [2019-09-08 11:25:08,040 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3c059335/074b63fdcdcb48f6b22e59d8c403e6ec [2019-09-08 11:25:08,054 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:25:08,056 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:25:08,057 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:25:08,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:25:08,061 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:25:08,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:25:08" (1/1) ... [2019-09-08 11:25:08,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa5746d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:08, skipping insertion in model container [2019-09-08 11:25:08,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:25:08" (1/1) ... [2019-09-08 11:25:08,075 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:25:08,143 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:25:08,627 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:25:08,656 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:25:08,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:25:08,818 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:25:08,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:08 WrapperNode [2019-09-08 11:25:08,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:25:08,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:25:08,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:25:08,820 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:25:08,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:08" (1/1) ... [2019-09-08 11:25:08,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:08" (1/1) ... [2019-09-08 11:25:08,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:08" (1/1) ... [2019-09-08 11:25:08,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:08" (1/1) ... [2019-09-08 11:25:08,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:08" (1/1) ... [2019-09-08 11:25:08,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:08" (1/1) ... [2019-09-08 11:25:08,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:08" (1/1) ... [2019-09-08 11:25:08,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:25:08,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:25:08,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:25:08,912 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:25:08,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:08" (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-09-08 11:25:08,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:25:08,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:25:08,983 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:25:08,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:25:08,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:25:08,984 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:25:08,984 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:25:08,984 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:25:08,984 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:25:08,984 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:25:08,984 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:25:08,985 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:25:08,985 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:25:08,985 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:25:08,985 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:25:08,985 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 11:25:08,986 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:25:08,986 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:25:08,986 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:25:08,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:25:08,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:25:09,818 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:25:09,819 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:25:09,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:25:09 BoogieIcfgContainer [2019-09-08 11:25:09,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:25:09,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:25:09,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:25:09,825 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:25:09,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:25:08" (1/3) ... [2019-09-08 11:25:09,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e2069c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:25:09, skipping insertion in model container [2019-09-08 11:25:09,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:08" (2/3) ... [2019-09-08 11:25:09,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e2069c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:25:09, skipping insertion in model container [2019-09-08 11:25:09,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:25:09" (3/3) ... [2019-09-08 11:25:09,830 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2019-09-08 11:25:09,840 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:25:09,850 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 11:25:09,868 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 11:25:09,903 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:25:09,903 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:25:09,904 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:25:09,904 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:25:09,904 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:25:09,905 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:25:09,905 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:25:09,905 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:25:09,905 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:25:09,929 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states. [2019-09-08 11:25:09,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 11:25:09,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:09,943 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:25:09,946 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:09,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:09,952 INFO L82 PathProgramCache]: Analyzing trace with hash -474732239, now seen corresponding path program 1 times [2019-09-08 11:25:09,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:09,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:10,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:10,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:10,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:10,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:25:10,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:10,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:25:10,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:25:10,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:25:10,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:25:10,510 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 3 states. [2019-09-08 11:25:10,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:10,615 INFO L93 Difference]: Finished difference Result 392 states and 634 transitions. [2019-09-08 11:25:10,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:25:10,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-08 11:25:10,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:10,633 INFO L225 Difference]: With dead ends: 392 [2019-09-08 11:25:10,634 INFO L226 Difference]: Without dead ends: 264 [2019-09-08 11:25:10,638 INFO L628 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-09-08 11:25:10,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-08 11:25:10,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-09-08 11:25:10,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-08 11:25:10,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 390 transitions. [2019-09-08 11:25:10,722 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 390 transitions. Word has length 77 [2019-09-08 11:25:10,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:25:10,723 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 390 transitions. [2019-09-08 11:25:10,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:25:10,723 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 390 transitions. [2019-09-08 11:25:10,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 11:25:10,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:10,732 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:25:10,734 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:10,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:10,735 INFO L82 PathProgramCache]: Analyzing trace with hash -992316925, now seen corresponding path program 1 times [2019-09-08 11:25:10,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:10,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:10,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:10,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:10,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:10,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:25:10,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:10,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:25:10,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:25:10,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:25:10,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:25:10,999 INFO L87 Difference]: Start difference. First operand 262 states and 390 transitions. Second operand 3 states. [2019-09-08 11:25:11,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:11,066 INFO L93 Difference]: Finished difference Result 658 states and 1022 transitions. [2019-09-08 11:25:11,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:25:11,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-08 11:25:11,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:11,071 INFO L225 Difference]: With dead ends: 658 [2019-09-08 11:25:11,072 INFO L226 Difference]: Without dead ends: 444 [2019-09-08 11:25:11,075 INFO L628 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-09-08 11:25:11,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-09-08 11:25:11,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 442. [2019-09-08 11:25:11,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-08 11:25:11,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 677 transitions. [2019-09-08 11:25:11,150 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 677 transitions. Word has length 78 [2019-09-08 11:25:11,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:25:11,150 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 677 transitions. [2019-09-08 11:25:11,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:25:11,151 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 677 transitions. [2019-09-08 11:25:11,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 11:25:11,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:11,155 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:25:11,156 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:11,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:11,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1011193650, now seen corresponding path program 1 times [2019-09-08 11:25:11,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:11,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:11,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:11,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:11,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:11,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:25:11,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:11,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:25:11,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:25:11,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:25:11,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:25:11,287 INFO L87 Difference]: Start difference. First operand 442 states and 677 transitions. Second operand 3 states. [2019-09-08 11:25:11,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:11,353 INFO L93 Difference]: Finished difference Result 1166 states and 1831 transitions. [2019-09-08 11:25:11,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:25:11,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-08 11:25:11,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:11,359 INFO L225 Difference]: With dead ends: 1166 [2019-09-08 11:25:11,359 INFO L226 Difference]: Without dead ends: 772 [2019-09-08 11:25:11,362 INFO L628 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-09-08 11:25:11,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-09-08 11:25:11,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 770. [2019-09-08 11:25:11,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2019-09-08 11:25:11,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1197 transitions. [2019-09-08 11:25:11,409 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1197 transitions. Word has length 79 [2019-09-08 11:25:11,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:25:11,410 INFO L475 AbstractCegarLoop]: Abstraction has 770 states and 1197 transitions. [2019-09-08 11:25:11,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:25:11,410 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1197 transitions. [2019-09-08 11:25:11,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 11:25:11,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:11,413 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:25:11,413 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:11,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:11,413 INFO L82 PathProgramCache]: Analyzing trace with hash 373615374, now seen corresponding path program 1 times [2019-09-08 11:25:11,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:11,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:11,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:11,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:11,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:11,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:25:11,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:11,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:25:11,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:25:11,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:25:11,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:25:11,536 INFO L87 Difference]: Start difference. First operand 770 states and 1197 transitions. Second operand 3 states. [2019-09-08 11:25:11,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:11,604 INFO L93 Difference]: Finished difference Result 2086 states and 3287 transitions. [2019-09-08 11:25:11,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:25:11,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-08 11:25:11,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:11,613 INFO L225 Difference]: With dead ends: 2086 [2019-09-08 11:25:11,613 INFO L226 Difference]: Without dead ends: 1364 [2019-09-08 11:25:11,616 INFO L628 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-09-08 11:25:11,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2019-09-08 11:25:11,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1362. [2019-09-08 11:25:11,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2019-09-08 11:25:11,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 2129 transitions. [2019-09-08 11:25:11,681 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 2129 transitions. Word has length 80 [2019-09-08 11:25:11,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:25:11,682 INFO L475 AbstractCegarLoop]: Abstraction has 1362 states and 2129 transitions. [2019-09-08 11:25:11,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:25:11,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 2129 transitions. [2019-09-08 11:25:11,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 11:25:11,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:11,684 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:25:11,684 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:11,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:11,685 INFO L82 PathProgramCache]: Analyzing trace with hash 779333447, now seen corresponding path program 1 times [2019-09-08 11:25:11,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:11,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:11,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:11,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:11,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:11,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:25:11,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:11,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:25:11,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:25:11,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:25:11,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:25:11,763 INFO L87 Difference]: Start difference. First operand 1362 states and 2129 transitions. Second operand 3 states. [2019-09-08 11:25:11,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:11,886 INFO L93 Difference]: Finished difference Result 3734 states and 5875 transitions. [2019-09-08 11:25:11,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:25:11,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-08 11:25:11,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:11,904 INFO L225 Difference]: With dead ends: 3734 [2019-09-08 11:25:11,904 INFO L226 Difference]: Without dead ends: 2420 [2019-09-08 11:25:11,909 INFO L628 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-09-08 11:25:11,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2019-09-08 11:25:12,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 2418. [2019-09-08 11:25:12,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2418 states. [2019-09-08 11:25:12,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 3777 transitions. [2019-09-08 11:25:12,056 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 3777 transitions. Word has length 81 [2019-09-08 11:25:12,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:25:12,056 INFO L475 AbstractCegarLoop]: Abstraction has 2418 states and 3777 transitions. [2019-09-08 11:25:12,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:25:12,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 3777 transitions. [2019-09-08 11:25:12,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 11:25:12,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:12,058 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:25:12,059 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:12,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:12,059 INFO L82 PathProgramCache]: Analyzing trace with hash -148987347, now seen corresponding path program 1 times [2019-09-08 11:25:12,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:12,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:12,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:12,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:12,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:12,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:12,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:25:12,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:12,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:25:12,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:25:12,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:25:12,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:25:12,211 INFO L87 Difference]: Start difference. First operand 2418 states and 3777 transitions. Second operand 3 states. [2019-09-08 11:25:12,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:12,414 INFO L93 Difference]: Finished difference Result 6646 states and 10403 transitions. [2019-09-08 11:25:12,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:25:12,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-08 11:25:12,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:12,438 INFO L225 Difference]: With dead ends: 6646 [2019-09-08 11:25:12,439 INFO L226 Difference]: Without dead ends: 4276 [2019-09-08 11:25:12,446 INFO L628 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-09-08 11:25:12,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2019-09-08 11:25:12,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4274. [2019-09-08 11:25:12,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4274 states. [2019-09-08 11:25:12,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4274 states to 4274 states and 6641 transitions. [2019-09-08 11:25:12,691 INFO L78 Accepts]: Start accepts. Automaton has 4274 states and 6641 transitions. Word has length 82 [2019-09-08 11:25:12,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:25:12,692 INFO L475 AbstractCegarLoop]: Abstraction has 4274 states and 6641 transitions. [2019-09-08 11:25:12,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:25:12,692 INFO L276 IsEmpty]: Start isEmpty. Operand 4274 states and 6641 transitions. [2019-09-08 11:25:12,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:25:12,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:12,694 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:25:12,695 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:12,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:12,695 INFO L82 PathProgramCache]: Analyzing trace with hash 328210800, now seen corresponding path program 1 times [2019-09-08 11:25:12,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:12,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:12,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:12,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:12,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:13,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:25:13,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:13,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 11:25:13,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 11:25:13,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 11:25:13,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:25:13,061 INFO L87 Difference]: Start difference. First operand 4274 states and 6641 transitions. Second operand 8 states. [2019-09-08 11:25:14,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:14,547 INFO L93 Difference]: Finished difference Result 25790 states and 39863 transitions. [2019-09-08 11:25:14,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 11:25:14,548 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2019-09-08 11:25:14,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:14,677 INFO L225 Difference]: With dead ends: 25790 [2019-09-08 11:25:14,677 INFO L226 Difference]: Without dead ends: 21564 [2019-09-08 11:25:14,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:25:14,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21564 states. [2019-09-08 11:25:15,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21564 to 21554. [2019-09-08 11:25:15,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21554 states. [2019-09-08 11:25:16,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21554 states to 21554 states and 33201 transitions. [2019-09-08 11:25:16,058 INFO L78 Accepts]: Start accepts. Automaton has 21554 states and 33201 transitions. Word has length 83 [2019-09-08 11:25:16,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:25:16,059 INFO L475 AbstractCegarLoop]: Abstraction has 21554 states and 33201 transitions. [2019-09-08 11:25:16,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 11:25:16,060 INFO L276 IsEmpty]: Start isEmpty. Operand 21554 states and 33201 transitions. [2019-09-08 11:25:16,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:25:16,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:16,061 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:25:16,062 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:16,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:16,062 INFO L82 PathProgramCache]: Analyzing trace with hash -513165031, now seen corresponding path program 1 times [2019-09-08 11:25:16,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:16,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:16,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:16,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:16,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:16,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:25:16,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:16,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:25:16,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:25:16,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:25:16,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:25:16,169 INFO L87 Difference]: Start difference. First operand 21554 states and 33201 transitions. Second operand 5 states. [2019-09-08 11:25:19,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:19,435 INFO L93 Difference]: Finished difference Result 61462 states and 94771 transitions. [2019-09-08 11:25:19,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:25:19,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-08 11:25:19,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:19,543 INFO L225 Difference]: With dead ends: 61462 [2019-09-08 11:25:19,544 INFO L226 Difference]: Without dead ends: 39956 [2019-09-08 11:25:19,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:25:19,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39956 states. [2019-09-08 11:25:21,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39956 to 39954. [2019-09-08 11:25:21,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39954 states. [2019-09-08 11:25:21,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39954 states to 39954 states and 61265 transitions. [2019-09-08 11:25:21,710 INFO L78 Accepts]: Start accepts. Automaton has 39954 states and 61265 transitions. Word has length 85 [2019-09-08 11:25:21,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:25:21,710 INFO L475 AbstractCegarLoop]: Abstraction has 39954 states and 61265 transitions. [2019-09-08 11:25:21,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:25:21,710 INFO L276 IsEmpty]: Start isEmpty. Operand 39954 states and 61265 transitions. [2019-09-08 11:25:21,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:25:21,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:21,712 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:25:21,712 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:21,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:21,713 INFO L82 PathProgramCache]: Analyzing trace with hash -670112898, now seen corresponding path program 1 times [2019-09-08 11:25:21,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:21,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:21,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:21,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:21,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:21,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:25:21,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:21,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 11:25:21,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 11:25:21,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 11:25:21,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:25:21,957 INFO L87 Difference]: Start difference. First operand 39954 states and 61265 transitions. Second operand 8 states. [2019-09-08 11:25:28,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:28,969 INFO L93 Difference]: Finished difference Result 234016 states and 359384 transitions. [2019-09-08 11:25:28,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 11:25:28,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-09-08 11:25:28,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:29,630 INFO L225 Difference]: With dead ends: 234016 [2019-09-08 11:25:29,631 INFO L226 Difference]: Without dead ends: 194110 [2019-09-08 11:25:29,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:25:30,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194110 states. [2019-09-08 11:25:36,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194110 to 79858. [2019-09-08 11:25:36,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79858 states. [2019-09-08 11:25:36,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79858 states to 79858 states and 121073 transitions. [2019-09-08 11:25:36,365 INFO L78 Accepts]: Start accepts. Automaton has 79858 states and 121073 transitions. Word has length 85 [2019-09-08 11:25:36,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:25:36,365 INFO L475 AbstractCegarLoop]: Abstraction has 79858 states and 121073 transitions. [2019-09-08 11:25:36,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 11:25:36,365 INFO L276 IsEmpty]: Start isEmpty. Operand 79858 states and 121073 transitions. [2019-09-08 11:25:36,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:25:36,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:36,367 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:25:36,367 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:36,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:36,368 INFO L82 PathProgramCache]: Analyzing trace with hash 682803964, now seen corresponding path program 1 times [2019-09-08 11:25:36,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:36,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:36,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:36,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:36,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:36,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:25:36,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:36,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:25:36,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:25:36,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:25:36,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:25:36,467 INFO L87 Difference]: Start difference. First operand 79858 states and 121073 transitions. Second operand 5 states. [2019-09-08 11:25:45,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:45,599 INFO L93 Difference]: Finished difference Result 162484 states and 244914 transitions. [2019-09-08 11:25:45,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:25:45,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-08 11:25:45,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:46,095 INFO L225 Difference]: With dead ends: 162484 [2019-09-08 11:25:46,098 INFO L226 Difference]: Without dead ends: 162482 [2019-09-08 11:25:46,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:25:46,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162482 states. [2019-09-08 11:25:51,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162482 to 82674. [2019-09-08 11:25:51,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82674 states. [2019-09-08 11:25:51,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82674 states to 82674 states and 123889 transitions. [2019-09-08 11:25:51,532 INFO L78 Accepts]: Start accepts. Automaton has 82674 states and 123889 transitions. Word has length 86 [2019-09-08 11:25:51,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:25:51,532 INFO L475 AbstractCegarLoop]: Abstraction has 82674 states and 123889 transitions. [2019-09-08 11:25:51,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:25:51,532 INFO L276 IsEmpty]: Start isEmpty. Operand 82674 states and 123889 transitions. [2019-09-08 11:25:51,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:25:51,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:51,534 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:25:51,534 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:51,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:51,535 INFO L82 PathProgramCache]: Analyzing trace with hash -298293779, now seen corresponding path program 1 times [2019-09-08 11:25:51,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:51,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:51,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:51,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:51,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:51,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:25:51,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:51,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:25:51,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:25:51,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:25:51,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:25:51,609 INFO L87 Difference]: Start difference. First operand 82674 states and 123889 transitions. Second operand 3 states. [2019-09-08 11:25:57,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:57,863 INFO L93 Difference]: Finished difference Result 186200 states and 278533 transitions. [2019-09-08 11:25:57,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:25:57,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-09-08 11:25:57,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:58,076 INFO L225 Difference]: With dead ends: 186200 [2019-09-08 11:25:58,077 INFO L226 Difference]: Without dead ends: 103574 [2019-09-08 11:25:58,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:25:58,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103574 states. [2019-09-08 11:26:05,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103574 to 103572. [2019-09-08 11:26:05,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103572 states. [2019-09-08 11:26:05,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103572 states to 103572 states and 154339 transitions. [2019-09-08 11:26:05,891 INFO L78 Accepts]: Start accepts. Automaton has 103572 states and 154339 transitions. Word has length 87 [2019-09-08 11:26:05,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:26:05,892 INFO L475 AbstractCegarLoop]: Abstraction has 103572 states and 154339 transitions. [2019-09-08 11:26:05,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:26:05,892 INFO L276 IsEmpty]: Start isEmpty. Operand 103572 states and 154339 transitions. [2019-09-08 11:26:05,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 11:26:05,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:26:05,934 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 11:26:05,934 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:26:05,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:26:05,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1662270977, now seen corresponding path program 1 times [2019-09-08 11:26:05,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:26:05,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:26:05,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:05,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:26:05,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:26:06,216 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:26:06,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:26:06,217 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 11:26:06,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:26:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:26:06,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 11:26:06,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:26:06,557 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 11:26:06,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:26:06,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2019-09-08 11:26:06,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 11:26:06,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 11:26:06,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-09-08 11:26:06,569 INFO L87 Difference]: Start difference. First operand 103572 states and 154339 transitions. Second operand 13 states. [2019-09-08 11:27:51,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:51,029 INFO L93 Difference]: Finished difference Result 1456282 states and 2147703 transitions. [2019-09-08 11:27:51,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-08 11:27:51,029 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 116 [2019-09-08 11:27:51,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:53,900 INFO L225 Difference]: With dead ends: 1456282 [2019-09-08 11:27:53,900 INFO L226 Difference]: Without dead ends: 1352760 [2019-09-08 11:27:54,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5577 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2587, Invalid=10523, Unknown=0, NotChecked=0, Total=13110 [2019-09-08 11:27:55,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352760 states. [2019-09-08 11:28:45,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352760 to 312676. [2019-09-08 11:28:45,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312676 states. [2019-09-08 11:28:45,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312676 states to 312676 states and 459459 transitions. [2019-09-08 11:28:45,701 INFO L78 Accepts]: Start accepts. Automaton has 312676 states and 459459 transitions. Word has length 116 [2019-09-08 11:28:45,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:28:45,702 INFO L475 AbstractCegarLoop]: Abstraction has 312676 states and 459459 transitions. [2019-09-08 11:28:45,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 11:28:45,702 INFO L276 IsEmpty]: Start isEmpty. Operand 312676 states and 459459 transitions. [2019-09-08 11:28:45,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 11:28:45,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:28:45,760 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 11:28:45,761 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:28:45,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:28:45,761 INFO L82 PathProgramCache]: Analyzing trace with hash 482487770, now seen corresponding path program 1 times [2019-09-08 11:28:45,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:28:45,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:28:45,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:45,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:28:45,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:28:45,844 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:28:45,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:28:45,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:28:45,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:28:45,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:28:45,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:28:45,846 INFO L87 Difference]: Start difference. First operand 312676 states and 459459 transitions. Second operand 3 states. [2019-09-08 11:29:32,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:29:32,377 INFO L93 Difference]: Finished difference Result 819654 states and 1202743 transitions. [2019-09-08 11:29:32,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:29:32,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-08 11:29:32,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:29:33,378 INFO L225 Difference]: With dead ends: 819654 [2019-09-08 11:29:33,378 INFO L226 Difference]: Without dead ends: 536292 [2019-09-08 11:29:33,676 INFO L628 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-09-08 11:29:34,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536292 states. [2019-09-08 11:30:31,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536292 to 525954. [2019-09-08 11:30:31,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525954 states. [2019-09-08 11:30:32,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525954 states to 525954 states and 766749 transitions. [2019-09-08 11:30:32,583 INFO L78 Accepts]: Start accepts. Automaton has 525954 states and 766749 transitions. Word has length 117 [2019-09-08 11:30:32,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:30:32,584 INFO L475 AbstractCegarLoop]: Abstraction has 525954 states and 766749 transitions. [2019-09-08 11:30:32,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:30:32,584 INFO L276 IsEmpty]: Start isEmpty. Operand 525954 states and 766749 transitions. [2019-09-08 11:30:32,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 11:30:32,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:30:32,642 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 11:30:32,643 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:30:32,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:30:32,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1877792189, now seen corresponding path program 1 times [2019-09-08 11:30:32,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:30:32,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:30:32,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:30:32,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:30:32,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:30:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:30:32,724 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:30:32,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:30:32,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:30:32,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:30:32,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:30:32,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:30:32,726 INFO L87 Difference]: Start difference. First operand 525954 states and 766749 transitions. Second operand 3 states. [2019-09-08 11:31:53,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:31:53,681 INFO L93 Difference]: Finished difference Result 1253158 states and 1830047 transitions. [2019-09-08 11:31:53,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:31:53,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-08 11:31:53,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:31:55,007 INFO L225 Difference]: With dead ends: 1253158 [2019-09-08 11:31:55,007 INFO L226 Difference]: Without dead ends: 759108 [2019-09-08 11:31:55,421 INFO L628 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-09-08 11:31:56,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759108 states. [2019-09-08 11:33:15,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759108 to 663202. [2019-09-08 11:33:15,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663202 states. [2019-09-08 11:33:16,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663202 states to 663202 states and 963317 transitions. [2019-09-08 11:33:16,450 INFO L78 Accepts]: Start accepts. Automaton has 663202 states and 963317 transitions. Word has length 117 [2019-09-08 11:33:16,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:33:16,451 INFO L475 AbstractCegarLoop]: Abstraction has 663202 states and 963317 transitions. [2019-09-08 11:33:16,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:33:16,451 INFO L276 IsEmpty]: Start isEmpty. Operand 663202 states and 963317 transitions. [2019-09-08 11:33:16,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 11:33:16,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:33:16,539 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 11:33:16,539 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:33:16,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:33:16,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1892887198, now seen corresponding path program 1 times [2019-09-08 11:33:16,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:33:16,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:33:16,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:33:16,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:33:16,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:33:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:33:16,659 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:33:16,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:33:16,659 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:33:16,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:33:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:33:16,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 933 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 11:33:16,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:33:16,991 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:33:17,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:33:17,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 11:33:17,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:33:17,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:33:17,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:33:17,012 INFO L87 Difference]: Start difference. First operand 663202 states and 963317 transitions. Second operand 11 states. [2019-09-08 11:35:50,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:35:50,494 INFO L93 Difference]: Finished difference Result 1892988 states and 2745789 transitions. [2019-09-08 11:35:50,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:35:50,495 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 117 [2019-09-08 11:35:50,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:35:53,255 INFO L225 Difference]: With dead ends: 1892988 [2019-09-08 11:35:53,256 INFO L226 Difference]: Without dead ends: 1377050 [2019-09-08 11:35:53,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:35:54,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377050 states.