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_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:05:02,840 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:05:02,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:05:02,855 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:05:02,855 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:05:02,856 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:05:02,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:05:02,859 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:05:02,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:05:02,862 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:05:02,863 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:05:02,864 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:05:02,864 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:05:02,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:05:02,866 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:05:02,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:05:02,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:05:02,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:05:02,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:05:02,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:05:02,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:05:02,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:05:02,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:05:02,876 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:05:02,878 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:05:02,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:05:02,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:05:02,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:05:02,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:05:02,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:05:02,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:05:02,881 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:05:02,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:05:02,883 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:05:02,884 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:05:02,884 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:05:02,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:05:02,885 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:05:02,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:05:02,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:05:02,886 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:05:02,887 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 10:05:02,901 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:05:02,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:05:02,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:05:02,903 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:05:02,903 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:05:02,903 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:05:02,904 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:05:02,904 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:05:02,904 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:05:02,904 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:05:02,904 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:05:02,904 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:05:02,905 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:05:02,905 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:05:02,905 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:05:02,905 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:05:02,905 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:05:02,906 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:05:02,906 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:05:02,906 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:05:02,906 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:05:02,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:05:02,907 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:05:02,907 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:05:02,907 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:05:02,907 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:05:02,908 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:05:02,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:05:02,908 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:05:02,936 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:05:02,949 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:05:02,953 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:05:02,954 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:05:02,954 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:05:02,955 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 10:05:03,014 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a2585d1f/d2ab063c868a4a56bff11f79fcd56bd4/FLAG0dbf53c74 [2019-09-08 10:05:03,757 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:05:03,758 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 10:05:03,787 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a2585d1f/d2ab063c868a4a56bff11f79fcd56bd4/FLAG0dbf53c74 [2019-09-08 10:05:03,869 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a2585d1f/d2ab063c868a4a56bff11f79fcd56bd4 [2019-09-08 10:05:03,880 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:05:03,881 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:05:03,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:05:03,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:05:03,885 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:05:03,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:05:03" (1/1) ... [2019-09-08 10:05:03,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51fb4ae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:05:03, skipping insertion in model container [2019-09-08 10:05:03,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:05:03" (1/1) ... [2019-09-08 10:05:03,895 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:05:04,058 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:05:05,312 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:05:05,332 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:05:05,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:05:05,937 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:05:05,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:05:05 WrapperNode [2019-09-08 10:05:05,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:05:05,939 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:05:05,940 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:05:05,940 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:05:05,961 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:05:05" (1/1) ... [2019-09-08 10:05:05,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:05:05" (1/1) ... [2019-09-08 10:05:06,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:05:05" (1/1) ... [2019-09-08 10:05:06,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:05:05" (1/1) ... [2019-09-08 10:05:06,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:05:05" (1/1) ... [2019-09-08 10:05:06,161 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:05:05" (1/1) ... [2019-09-08 10:05:06,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:05:05" (1/1) ... [2019-09-08 10:05:06,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:05:06,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:05:06,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:05:06,198 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:05:06,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:05:05" (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 10:05:06,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:05:06,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:05:06,292 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:05:06,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:05:06,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:05:06,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:05:06,295 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:05:06,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:05:06,297 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:05:06,297 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:05:06,297 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:05:06,298 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:05:06,299 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:05:06,299 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:05:06,301 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 10:05:06,301 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:05:06,304 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:05:06,305 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:05:06,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:05:06,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:05:10,589 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:05:10,589 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:05:10,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:05:10 BoogieIcfgContainer [2019-09-08 10:05:10,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:05:10,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:05:10,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:05:10,596 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:05:10,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:05:03" (1/3) ... [2019-09-08 10:05:10,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66943c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:05:10, skipping insertion in model container [2019-09-08 10:05:10,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:05:05" (2/3) ... [2019-09-08 10:05:10,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66943c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:05:10, skipping insertion in model container [2019-09-08 10:05:10,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:05:10" (3/3) ... [2019-09-08 10:05:10,599 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 10:05:10,610 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:05:10,620 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 10:05:10,638 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 10:05:10,689 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:05:10,689 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:05:10,690 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:05:10,690 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:05:10,690 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:05:10,690 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:05:10,690 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:05:10,690 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:05:10,690 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:05:10,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states. [2019-09-08 10:05:10,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-08 10:05:10,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:05:10,788 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:05:10,790 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:05:10,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:05:10,797 INFO L82 PathProgramCache]: Analyzing trace with hash 910299498, now seen corresponding path program 1 times [2019-09-08 10:05:10,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:05:10,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:05:10,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:10,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:05:10,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:05:11,713 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 10:05:11,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:05:11,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:05:11,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:05:11,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:05:11,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:05:11,743 INFO L87 Difference]: Start difference. First operand 1419 states. Second operand 3 states. [2019-09-08 10:05:12,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:05:12,024 INFO L93 Difference]: Finished difference Result 2865 states and 5010 transitions. [2019-09-08 10:05:12,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:05:12,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 340 [2019-09-08 10:05:12,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:05:12,086 INFO L225 Difference]: With dead ends: 2865 [2019-09-08 10:05:12,087 INFO L226 Difference]: Without dead ends: 1989 [2019-09-08 10:05:12,106 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 10:05:12,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2019-09-08 10:05:12,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1987. [2019-09-08 10:05:12,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1987 states. [2019-09-08 10:05:12,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 3333 transitions. [2019-09-08 10:05:12,302 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 3333 transitions. Word has length 340 [2019-09-08 10:05:12,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:05:12,304 INFO L475 AbstractCegarLoop]: Abstraction has 1987 states and 3333 transitions. [2019-09-08 10:05:12,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:05:12,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 3333 transitions. [2019-09-08 10:05:12,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-09-08 10:05:12,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:05:12,315 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:05:12,316 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:05:12,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:05:12,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1129027018, now seen corresponding path program 1 times [2019-09-08 10:05:12,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:05:12,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:05:12,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:12,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:05:12,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:05:12,721 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 10:05:12,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:05:12,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:05:12,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:05:12,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:05:12,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:05:12,728 INFO L87 Difference]: Start difference. First operand 1987 states and 3333 transitions. Second operand 3 states. [2019-09-08 10:05:12,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:05:12,925 INFO L93 Difference]: Finished difference Result 4394 states and 7270 transitions. [2019-09-08 10:05:12,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:05:12,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 342 [2019-09-08 10:05:12,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:05:12,948 INFO L225 Difference]: With dead ends: 4394 [2019-09-08 10:05:12,948 INFO L226 Difference]: Without dead ends: 2981 [2019-09-08 10:05:12,959 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 10:05:12,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2019-09-08 10:05:13,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 2979. [2019-09-08 10:05:13,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2979 states. [2019-09-08 10:05:13,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2979 states to 2979 states and 4948 transitions. [2019-09-08 10:05:13,157 INFO L78 Accepts]: Start accepts. Automaton has 2979 states and 4948 transitions. Word has length 342 [2019-09-08 10:05:13,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:05:13,158 INFO L475 AbstractCegarLoop]: Abstraction has 2979 states and 4948 transitions. [2019-09-08 10:05:13,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:05:13,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2979 states and 4948 transitions. [2019-09-08 10:05:13,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-09-08 10:05:13,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:05:13,171 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:05:13,171 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:05:13,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:05:13,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1293172548, now seen corresponding path program 1 times [2019-09-08 10:05:13,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:05:13,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:05:13,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:13,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:05:13,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:05:13,451 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 10:05:13,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:05:13,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:05:13,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:05:13,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:05:13,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:05:13,454 INFO L87 Difference]: Start difference. First operand 2979 states and 4948 transitions. Second operand 3 states. [2019-09-08 10:05:13,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:05:13,719 INFO L93 Difference]: Finished difference Result 7034 states and 11562 transitions. [2019-09-08 10:05:13,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:05:13,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 344 [2019-09-08 10:05:13,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:05:13,754 INFO L225 Difference]: With dead ends: 7034 [2019-09-08 10:05:13,756 INFO L226 Difference]: Without dead ends: 4652 [2019-09-08 10:05:13,775 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 10:05:13,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4652 states. [2019-09-08 10:05:14,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4652 to 4650. [2019-09-08 10:05:14,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4650 states. [2019-09-08 10:05:14,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4650 states to 4650 states and 7654 transitions. [2019-09-08 10:05:14,064 INFO L78 Accepts]: Start accepts. Automaton has 4650 states and 7654 transitions. Word has length 344 [2019-09-08 10:05:14,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:05:14,064 INFO L475 AbstractCegarLoop]: Abstraction has 4650 states and 7654 transitions. [2019-09-08 10:05:14,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:05:14,065 INFO L276 IsEmpty]: Start isEmpty. Operand 4650 states and 7654 transitions. [2019-09-08 10:05:14,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-09-08 10:05:14,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:05:14,080 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:05:14,081 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:05:14,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:05:14,081 INFO L82 PathProgramCache]: Analyzing trace with hash 946430954, now seen corresponding path program 1 times [2019-09-08 10:05:14,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:05:14,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:05:14,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:14,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:05:14,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:05:14,353 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 10:05:14,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:05:14,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:05:14,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:05:14,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:05:14,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:05:14,356 INFO L87 Difference]: Start difference. First operand 4650 states and 7654 transitions. Second operand 3 states. [2019-09-08 10:05:14,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:05:14,683 INFO L93 Difference]: Finished difference Result 11389 states and 18591 transitions. [2019-09-08 10:05:14,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:05:14,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 346 [2019-09-08 10:05:14,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:05:14,725 INFO L225 Difference]: With dead ends: 11389 [2019-09-08 10:05:14,725 INFO L226 Difference]: Without dead ends: 7359 [2019-09-08 10:05:14,739 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 10:05:14,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7359 states. [2019-09-08 10:05:15,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7359 to 7357. [2019-09-08 10:05:15,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7357 states. [2019-09-08 10:05:15,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7357 states to 7357 states and 12000 transitions. [2019-09-08 10:05:15,276 INFO L78 Accepts]: Start accepts. Automaton has 7357 states and 12000 transitions. Word has length 346 [2019-09-08 10:05:15,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:05:15,277 INFO L475 AbstractCegarLoop]: Abstraction has 7357 states and 12000 transitions. [2019-09-08 10:05:15,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:05:15,277 INFO L276 IsEmpty]: Start isEmpty. Operand 7357 states and 12000 transitions. [2019-09-08 10:05:15,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-09-08 10:05:15,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:05:15,303 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:05:15,304 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:05:15,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:05:15,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1572024206, now seen corresponding path program 1 times [2019-09-08 10:05:15,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:05:15,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:05:15,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:15,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:05:15,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:05:15,722 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 10:05:15,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:05:15,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:05:15,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:05:15,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:05:15,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:05:15,725 INFO L87 Difference]: Start difference. First operand 7357 states and 12000 transitions. Second operand 3 states. [2019-09-08 10:05:16,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:05:16,209 INFO L93 Difference]: Finished difference Result 18208 states and 29468 transitions. [2019-09-08 10:05:16,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:05:16,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2019-09-08 10:05:16,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:05:16,261 INFO L225 Difference]: With dead ends: 18208 [2019-09-08 10:05:16,261 INFO L226 Difference]: Without dead ends: 11494 [2019-09-08 10:05:16,278 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 10:05:16,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11494 states. [2019-09-08 10:05:16,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11494 to 11492. [2019-09-08 10:05:16,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11492 states. [2019-09-08 10:05:16,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11492 states to 11492 states and 18542 transitions. [2019-09-08 10:05:16,857 INFO L78 Accepts]: Start accepts. Automaton has 11492 states and 18542 transitions. Word has length 348 [2019-09-08 10:05:16,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:05:16,858 INFO L475 AbstractCegarLoop]: Abstraction has 11492 states and 18542 transitions. [2019-09-08 10:05:16,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:05:16,858 INFO L276 IsEmpty]: Start isEmpty. Operand 11492 states and 18542 transitions. [2019-09-08 10:05:16,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-09-08 10:05:16,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:05:16,886 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:05:16,886 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:05:16,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:05:16,887 INFO L82 PathProgramCache]: Analyzing trace with hash -154699139, now seen corresponding path program 1 times [2019-09-08 10:05:16,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:05:16,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:05:16,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:16,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:05:16,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:05:17,230 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 10:05:17,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:05:17,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:05:17,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:05:17,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:05:17,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:05:17,232 INFO L87 Difference]: Start difference. First operand 11492 states and 18542 transitions. Second operand 3 states. [2019-09-08 10:05:18,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:05:18,361 INFO L93 Difference]: Finished difference Result 19673 states and 32232 transitions. [2019-09-08 10:05:18,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:05:18,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 350 [2019-09-08 10:05:18,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:05:18,407 INFO L225 Difference]: With dead ends: 19673 [2019-09-08 10:05:18,407 INFO L226 Difference]: Without dead ends: 16263 [2019-09-08 10:05:18,419 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 10:05:18,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16263 states. [2019-09-08 10:05:19,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16263 to 16261. [2019-09-08 10:05:19,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16261 states. [2019-09-08 10:05:19,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16261 states to 16261 states and 26390 transitions. [2019-09-08 10:05:19,297 INFO L78 Accepts]: Start accepts. Automaton has 16261 states and 26390 transitions. Word has length 350 [2019-09-08 10:05:19,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:05:19,298 INFO L475 AbstractCegarLoop]: Abstraction has 16261 states and 26390 transitions. [2019-09-08 10:05:19,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:05:19,298 INFO L276 IsEmpty]: Start isEmpty. Operand 16261 states and 26390 transitions. [2019-09-08 10:05:19,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-09-08 10:05:19,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:05:19,332 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:05:19,332 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:05:19,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:05:19,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1237260265, now seen corresponding path program 1 times [2019-09-08 10:05:19,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:05:19,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:05:19,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:19,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:05:19,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:05:19,886 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 10:05:19,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:05:19,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:05:19,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:05:19,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:05:19,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:05:19,889 INFO L87 Difference]: Start difference. First operand 16261 states and 26390 transitions. Second operand 5 states. [2019-09-08 10:05:21,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:05:21,412 INFO L93 Difference]: Finished difference Result 43871 states and 72538 transitions. [2019-09-08 10:05:21,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:05:21,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 351 [2019-09-08 10:05:21,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:05:21,492 INFO L225 Difference]: With dead ends: 43871 [2019-09-08 10:05:21,492 INFO L226 Difference]: Without dead ends: 37469 [2019-09-08 10:05:21,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:05:21,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37469 states. [2019-09-08 10:05:22,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37469 to 29270. [2019-09-08 10:05:22,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29270 states. [2019-09-08 10:05:23,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29270 states to 29270 states and 48014 transitions. [2019-09-08 10:05:23,900 INFO L78 Accepts]: Start accepts. Automaton has 29270 states and 48014 transitions. Word has length 351 [2019-09-08 10:05:23,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:05:23,901 INFO L475 AbstractCegarLoop]: Abstraction has 29270 states and 48014 transitions. [2019-09-08 10:05:23,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:05:23,901 INFO L276 IsEmpty]: Start isEmpty. Operand 29270 states and 48014 transitions. [2019-09-08 10:05:23,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-09-08 10:05:23,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:05:23,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:05:23,935 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:05:23,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:05:23,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1483359712, now seen corresponding path program 1 times [2019-09-08 10:05:23,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:05:23,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:05:23,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:23,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:05:23,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:05:24,648 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 10:05:24,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:05:24,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:05:24,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:05:24,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:05:24,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:05:24,651 INFO L87 Difference]: Start difference. First operand 29270 states and 48014 transitions. Second operand 7 states. [2019-09-08 10:05:26,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:05:26,819 INFO L93 Difference]: Finished difference Result 68304 states and 113268 transitions. [2019-09-08 10:05:26,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 10:05:26,820 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 351 [2019-09-08 10:05:26,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:05:26,951 INFO L225 Difference]: With dead ends: 68304 [2019-09-08 10:05:26,952 INFO L226 Difference]: Without dead ends: 49518 [2019-09-08 10:05:27,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:05:27,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49518 states. [2019-09-08 10:05:28,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49518 to 32674. [2019-09-08 10:05:28,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32674 states. [2019-09-08 10:05:28,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32674 states to 32674 states and 53754 transitions. [2019-09-08 10:05:28,604 INFO L78 Accepts]: Start accepts. Automaton has 32674 states and 53754 transitions. Word has length 351 [2019-09-08 10:05:28,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:05:28,604 INFO L475 AbstractCegarLoop]: Abstraction has 32674 states and 53754 transitions. [2019-09-08 10:05:28,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:05:28,605 INFO L276 IsEmpty]: Start isEmpty. Operand 32674 states and 53754 transitions. [2019-09-08 10:05:28,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-08 10:05:28,635 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:05:28,636 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:05:28,636 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:05:28,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:05:28,637 INFO L82 PathProgramCache]: Analyzing trace with hash 844380814, now seen corresponding path program 1 times [2019-09-08 10:05:28,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:05:28,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:05:28,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:28,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:05:28,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:05:29,267 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 10:05:29,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:05:29,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:05:29,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:05:29,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:05:29,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:05:29,271 INFO L87 Difference]: Start difference. First operand 32674 states and 53754 transitions. Second operand 7 states. [2019-09-08 10:05:33,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:05:33,941 INFO L93 Difference]: Finished difference Result 113924 states and 189280 transitions. [2019-09-08 10:05:33,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 10:05:33,942 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 352 [2019-09-08 10:05:33,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:05:34,126 INFO L225 Difference]: With dead ends: 113924 [2019-09-08 10:05:34,127 INFO L226 Difference]: Without dead ends: 101538 [2019-09-08 10:05:34,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:05:34,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101538 states. [2019-09-08 10:05:37,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101538 to 43155. [2019-09-08 10:05:37,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43155 states. [2019-09-08 10:05:37,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43155 states to 43155 states and 71266 transitions. [2019-09-08 10:05:37,205 INFO L78 Accepts]: Start accepts. Automaton has 43155 states and 71266 transitions. Word has length 352 [2019-09-08 10:05:37,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:05:37,206 INFO L475 AbstractCegarLoop]: Abstraction has 43155 states and 71266 transitions. [2019-09-08 10:05:37,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:05:37,207 INFO L276 IsEmpty]: Start isEmpty. Operand 43155 states and 71266 transitions. [2019-09-08 10:05:37,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-08 10:05:37,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:05:37,224 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:05:37,225 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:05:37,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:05:37,225 INFO L82 PathProgramCache]: Analyzing trace with hash 264007579, now seen corresponding path program 1 times [2019-09-08 10:05:37,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:05:37,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:05:37,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:37,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:05:37,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:05:37,863 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 10:05:37,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:05:37,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:05:37,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:05:37,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:05:37,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:05:37,866 INFO L87 Difference]: Start difference. First operand 43155 states and 71266 transitions. Second operand 7 states. [2019-09-08 10:05:43,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:05:43,593 INFO L93 Difference]: Finished difference Result 116787 states and 194126 transitions. [2019-09-08 10:05:43,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 10:05:43,594 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 352 [2019-09-08 10:05:43,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:05:43,755 INFO L225 Difference]: With dead ends: 116787 [2019-09-08 10:05:43,755 INFO L226 Difference]: Without dead ends: 98001 [2019-09-08 10:05:43,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:05:43,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98001 states. [2019-09-08 10:05:46,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98001 to 46941. [2019-09-08 10:05:46,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46941 states. [2019-09-08 10:05:46,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46941 states to 46941 states and 77618 transitions. [2019-09-08 10:05:46,758 INFO L78 Accepts]: Start accepts. Automaton has 46941 states and 77618 transitions. Word has length 352 [2019-09-08 10:05:46,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:05:46,759 INFO L475 AbstractCegarLoop]: Abstraction has 46941 states and 77618 transitions. [2019-09-08 10:05:46,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:05:46,759 INFO L276 IsEmpty]: Start isEmpty. Operand 46941 states and 77618 transitions. [2019-09-08 10:05:46,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-08 10:05:46,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:05:46,773 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:05:46,773 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:05:46,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:05:46,774 INFO L82 PathProgramCache]: Analyzing trace with hash 360693608, now seen corresponding path program 1 times [2019-09-08 10:05:46,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:05:46,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:05:46,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:46,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:05:46,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:05:47,656 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 10:05:47,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:05:47,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:05:47,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:05:47,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:05:47,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:05:47,658 INFO L87 Difference]: Start difference. First operand 46941 states and 77618 transitions. Second operand 7 states. [2019-09-08 10:05:54,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:05:54,391 INFO L93 Difference]: Finished difference Result 120289 states and 200002 transitions. [2019-09-08 10:05:54,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 10:05:54,392 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 352 [2019-09-08 10:05:54,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:05:54,549 INFO L225 Difference]: With dead ends: 120289 [2019-09-08 10:05:54,549 INFO L226 Difference]: Without dead ends: 101503 [2019-09-08 10:05:54,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:05:54,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101503 states. [2019-09-08 10:05:57,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101503 to 50727. [2019-09-08 10:05:57,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50727 states. [2019-09-08 10:05:57,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50727 states to 50727 states and 83970 transitions. [2019-09-08 10:05:57,894 INFO L78 Accepts]: Start accepts. Automaton has 50727 states and 83970 transitions. Word has length 352 [2019-09-08 10:05:57,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:05:57,895 INFO L475 AbstractCegarLoop]: Abstraction has 50727 states and 83970 transitions. [2019-09-08 10:05:57,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:05:57,895 INFO L276 IsEmpty]: Start isEmpty. Operand 50727 states and 83970 transitions. [2019-09-08 10:05:57,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-08 10:05:57,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:05:57,911 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:05:57,911 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:05:57,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:05:57,912 INFO L82 PathProgramCache]: Analyzing trace with hash -432358780, now seen corresponding path program 1 times [2019-09-08 10:05:57,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:05:57,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:05:57,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:57,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:05:57,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:05:58,305 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 10:05:58,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:05:58,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:05:58,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:05:58,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:05:58,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:05:58,307 INFO L87 Difference]: Start difference. First operand 50727 states and 83970 transitions. Second operand 5 states. [2019-09-08 10:06:05,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:06:05,861 INFO L93 Difference]: Finished difference Result 167205 states and 278414 transitions. [2019-09-08 10:06:05,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:06:05,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 352 [2019-09-08 10:06:05,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:06:06,074 INFO L225 Difference]: With dead ends: 167205 [2019-09-08 10:06:06,074 INFO L226 Difference]: Without dead ends: 128371 [2019-09-08 10:06:06,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:06:06,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128371 states. [2019-09-08 10:06:13,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128371 to 90884. [2019-09-08 10:06:13,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90884 states. [2019-09-08 10:06:14,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90884 states to 90884 states and 150366 transitions. [2019-09-08 10:06:14,069 INFO L78 Accepts]: Start accepts. Automaton has 90884 states and 150366 transitions. Word has length 352 [2019-09-08 10:06:14,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:06:14,070 INFO L475 AbstractCegarLoop]: Abstraction has 90884 states and 150366 transitions. [2019-09-08 10:06:14,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:06:14,070 INFO L276 IsEmpty]: Start isEmpty. Operand 90884 states and 150366 transitions. [2019-09-08 10:06:14,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-08 10:06:14,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:06:14,087 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:06:14,087 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:06:14,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:06:14,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1028061685, now seen corresponding path program 1 times [2019-09-08 10:06:14,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:06:14,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:06:14,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:06:14,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:06:14,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:06:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:06:14,562 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 10:06:14,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:06:14,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:06:14,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:06:14,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:06:14,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:06:14,563 INFO L87 Difference]: Start difference. First operand 90884 states and 150366 transitions. Second operand 7 states. [2019-09-08 10:06:30,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:06:30,889 INFO L93 Difference]: Finished difference Result 279460 states and 463716 transitions. [2019-09-08 10:06:30,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 10:06:30,889 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 352 [2019-09-08 10:06:30,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:06:31,193 INFO L225 Difference]: With dead ends: 279460 [2019-09-08 10:06:31,193 INFO L226 Difference]: Without dead ends: 223906 [2019-09-08 10:06:31,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:06:31,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223906 states. [2019-09-08 10:06:38,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223906 to 94456. [2019-09-08 10:06:38,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94456 states. [2019-09-08 10:06:39,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94456 states to 94456 states and 156334 transitions. [2019-09-08 10:06:39,409 INFO L78 Accepts]: Start accepts. Automaton has 94456 states and 156334 transitions. Word has length 352 [2019-09-08 10:06:39,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:06:39,410 INFO L475 AbstractCegarLoop]: Abstraction has 94456 states and 156334 transitions. [2019-09-08 10:06:39,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:06:39,410 INFO L276 IsEmpty]: Start isEmpty. Operand 94456 states and 156334 transitions. [2019-09-08 10:06:39,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-09-08 10:06:39,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:06:39,431 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:06:39,431 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:06:39,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:06:39,431 INFO L82 PathProgramCache]: Analyzing trace with hash -330552794, now seen corresponding path program 1 times [2019-09-08 10:06:39,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:06:39,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:06:39,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:06:39,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:06:39,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:06:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:06:39,948 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 10:06:39,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:06:39,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:06:39,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:06:39,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:06:39,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:06:39,950 INFO L87 Difference]: Start difference. First operand 94456 states and 156334 transitions. Second operand 7 states. [2019-09-08 10:07:03,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:03,887 INFO L93 Difference]: Finished difference Result 380112 states and 632208 transitions. [2019-09-08 10:07:03,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 10:07:03,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 353 [2019-09-08 10:07:03,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:04,369 INFO L225 Difference]: With dead ends: 380112 [2019-09-08 10:07:04,369 INFO L226 Difference]: Without dead ends: 298062 [2019-09-08 10:07:04,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-09-08 10:07:04,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298062 states. [2019-09-08 10:07:33,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298062 to 296751. [2019-09-08 10:07:33,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296751 states. [2019-09-08 10:07:34,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296751 states to 296751 states and 492584 transitions. [2019-09-08 10:07:34,441 INFO L78 Accepts]: Start accepts. Automaton has 296751 states and 492584 transitions. Word has length 353 [2019-09-08 10:07:34,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:34,441 INFO L475 AbstractCegarLoop]: Abstraction has 296751 states and 492584 transitions. [2019-09-08 10:07:34,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:07:34,442 INFO L276 IsEmpty]: Start isEmpty. Operand 296751 states and 492584 transitions. [2019-09-08 10:07:34,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-09-08 10:07:34,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:34,458 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:07:34,458 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:34,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:34,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1245658498, now seen corresponding path program 1 times [2019-09-08 10:07:34,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:34,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:34,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:34,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:34,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:34,789 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 10:07:34,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:34,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:07:34,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:07:34,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:07:34,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:07:34,791 INFO L87 Difference]: Start difference. First operand 296751 states and 492584 transitions. Second operand 5 states. [2019-09-08 10:08:58,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:08:58,471 INFO L93 Difference]: Finished difference Result 1193356 states and 1980410 transitions. [2019-09-08 10:08:58,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:08:58,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 353 [2019-09-08 10:08:58,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:09:00,196 INFO L225 Difference]: With dead ends: 1193356 [2019-09-08 10:09:00,196 INFO L226 Difference]: Without dead ends: 911326 [2019-09-08 10:09:00,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:09:01,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911326 states. [2019-09-08 10:10:18,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911326 to 646948. [2019-09-08 10:10:18,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646948 states. [2019-09-08 10:10:20,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646948 states to 646948 states and 1069420 transitions. [2019-09-08 10:10:20,145 INFO L78 Accepts]: Start accepts. Automaton has 646948 states and 1069420 transitions. Word has length 353 [2019-09-08 10:10:20,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:10:20,146 INFO L475 AbstractCegarLoop]: Abstraction has 646948 states and 1069420 transitions. [2019-09-08 10:10:20,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:10:20,146 INFO L276 IsEmpty]: Start isEmpty. Operand 646948 states and 1069420 transitions. [2019-09-08 10:10:20,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-09-08 10:10:20,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:10:20,164 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:10:20,164 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:10:20,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:10:20,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1081301039, now seen corresponding path program 1 times [2019-09-08 10:10:20,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:10:20,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:10:20,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:10:20,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:10:20,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:10:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:10:21,137 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 10:10:21,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:10:21,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:10:21,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:10:21,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:10:21,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:10:21,140 INFO L87 Difference]: Start difference. First operand 646948 states and 1069420 transitions. Second operand 7 states. [2019-09-08 10:14:16,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:16,047 INFO L93 Difference]: Finished difference Result 2765840 states and 4570807 transitions. [2019-09-08 10:14:16,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:14:16,048 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 353 [2019-09-08 10:14:16,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:20,094 INFO L225 Difference]: With dead ends: 2765840 [2019-09-08 10:14:20,095 INFO L226 Difference]: Without dead ends: 2133574 [2019-09-08 10:14:20,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:14:22,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2133574 states.