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.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:54:01,839 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:54:01,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:54:01,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:54:01,855 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:54:01,856 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:54:01,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:54:01,859 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:54:01,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:54:01,862 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:54:01,863 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:54:01,864 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:54:01,865 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:54:01,866 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:54:01,867 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:54:01,868 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:54:01,869 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:54:01,870 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:54:01,872 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:54:01,874 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:54:01,876 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:54:01,880 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:54:01,881 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:54:01,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:54:01,885 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:54:01,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:54:01,885 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:54:01,887 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:54:01,887 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:54:01,889 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:54:01,889 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:54:01,890 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:54:01,891 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:54:01,891 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:54:01,893 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:54:01,893 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:54:01,894 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:54:01,894 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:54:01,894 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:54:01,895 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:54:01,896 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:54:01,897 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 09:54:01,913 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:54:01,914 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:54:01,915 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:54:01,915 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:54:01,915 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:54:01,916 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:54:01,916 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:54:01,916 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:54:01,916 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:54:01,916 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:54:01,917 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:54:01,917 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:54:01,917 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:54:01,917 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:54:01,917 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:54:01,918 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:54:01,918 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:54:01,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:54:01,918 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:54:01,919 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:54:01,919 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:54:01,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:54:01,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:54:01,919 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:54:01,920 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:54:01,920 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:54:01,920 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:54:01,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:54:01,920 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:54:01,953 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:54:01,967 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:54:01,971 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:54:01,973 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:54:01,973 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:54:01,974 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 09:54:02,045 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9032ee6e0/225f503c0b8b45fcb9f7de446a1516e3/FLAGc9300c6b2 [2019-09-08 09:54:02,735 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:54:02,736 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 09:54:02,778 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9032ee6e0/225f503c0b8b45fcb9f7de446a1516e3/FLAGc9300c6b2 [2019-09-08 09:54:02,870 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9032ee6e0/225f503c0b8b45fcb9f7de446a1516e3 [2019-09-08 09:54:02,885 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:54:02,888 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:54:02,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:54:02,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:54:02,898 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:54:02,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:54:02" (1/1) ... [2019-09-08 09:54:02,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e83ef61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:02, skipping insertion in model container [2019-09-08 09:54:02,903 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:54:02" (1/1) ... [2019-09-08 09:54:02,912 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:54:03,073 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:54:04,380 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:54:04,396 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:54:05,243 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:54:05,283 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:54:05,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:05 WrapperNode [2019-09-08 09:54:05,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:54:05,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:54:05,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:54:05,286 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:54:05,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:05" (1/1) ... [2019-09-08 09:54:05,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:05" (1/1) ... [2019-09-08 09:54:05,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:05" (1/1) ... [2019-09-08 09:54:05,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:05" (1/1) ... [2019-09-08 09:54:05,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:05" (1/1) ... [2019-09-08 09:54:05,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:05" (1/1) ... [2019-09-08 09:54:05,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:05" (1/1) ... [2019-09-08 09:54:05,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:54:05,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:54:05,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:54:05,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:54:05,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54: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 09:54:05,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:54:05,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:54:05,559 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:54:05,559 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:54:05,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:54:05,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 09:54:05,561 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:54:05,561 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:54:05,561 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:54:05,561 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:54:05,561 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:54:05,562 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:54:05,562 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:54:05,562 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:54:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 09:54:05,564 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:54:05,566 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:54:05,566 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:54:05,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:54:05,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:54:08,670 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:54:08,670 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:54:08,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:54:08 BoogieIcfgContainer [2019-09-08 09:54:08,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:54:08,674 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:54:08,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:54:08,677 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:54:08,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:54:02" (1/3) ... [2019-09-08 09:54:08,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9c1a13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:54:08, skipping insertion in model container [2019-09-08 09:54:08,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:05" (2/3) ... [2019-09-08 09:54:08,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9c1a13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:54:08, skipping insertion in model container [2019-09-08 09:54:08,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:54:08" (3/3) ... [2019-09-08 09:54:08,681 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 09:54:08,692 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:54:08,704 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-09-08 09:54:08,730 INFO L252 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-09-08 09:54:08,779 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:54:08,780 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:54:08,780 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:54:08,781 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:54:08,781 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:54:08,781 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:54:08,781 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:54:08,782 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:54:08,782 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:54:08,825 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states. [2019-09-08 09:54:08,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 09:54:08,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:08,859 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] [2019-09-08 09:54:08,862 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:08,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:08,872 INFO L82 PathProgramCache]: Analyzing trace with hash -962998080, now seen corresponding path program 1 times [2019-09-08 09:54:08,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:08,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:08,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:08,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:08,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:10,096 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 09:54:10,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:10,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:10,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:10,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:10,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:10,122 INFO L87 Difference]: Start difference. First operand 934 states. Second operand 3 states. [2019-09-08 09:54:10,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:10,494 INFO L93 Difference]: Finished difference Result 1593 states and 2837 transitions. [2019-09-08 09:54:10,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:10,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-09-08 09:54:10,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:10,536 INFO L225 Difference]: With dead ends: 1593 [2019-09-08 09:54:10,536 INFO L226 Difference]: Without dead ends: 1335 [2019-09-08 09:54:10,545 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 09:54:10,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-09-08 09:54:10,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1333. [2019-09-08 09:54:10,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2019-09-08 09:54:10,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 2029 transitions. [2019-09-08 09:54:10,687 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 2029 transitions. Word has length 308 [2019-09-08 09:54:10,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:10,689 INFO L475 AbstractCegarLoop]: Abstraction has 1333 states and 2029 transitions. [2019-09-08 09:54:10,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:54:10,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 2029 transitions. [2019-09-08 09:54:10,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 09:54:10,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:10,697 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] [2019-09-08 09:54:10,698 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:10,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:10,699 INFO L82 PathProgramCache]: Analyzing trace with hash -366101467, now seen corresponding path program 1 times [2019-09-08 09:54:10,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:10,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:10,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:10,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:10,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:11,604 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 09:54:11,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:11,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:54:11,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:54:11,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:54:11,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:54:11,613 INFO L87 Difference]: Start difference. First operand 1333 states and 2029 transitions. Second operand 4 states. [2019-09-08 09:54:11,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:11,893 INFO L93 Difference]: Finished difference Result 3935 states and 5986 transitions. [2019-09-08 09:54:11,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:54:11,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-09-08 09:54:11,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:11,912 INFO L225 Difference]: With dead ends: 3935 [2019-09-08 09:54:11,912 INFO L226 Difference]: Without dead ends: 2617 [2019-09-08 09:54:11,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:54:11,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2617 states. [2019-09-08 09:54:12,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2617 to 2521. [2019-09-08 09:54:12,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2521 states. [2019-09-08 09:54:12,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 3840 transitions. [2019-09-08 09:54:12,082 INFO L78 Accepts]: Start accepts. Automaton has 2521 states and 3840 transitions. Word has length 308 [2019-09-08 09:54:12,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:12,083 INFO L475 AbstractCegarLoop]: Abstraction has 2521 states and 3840 transitions. [2019-09-08 09:54:12,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:54:12,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 3840 transitions. [2019-09-08 09:54:12,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-08 09:54:12,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:12,096 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] [2019-09-08 09:54:12,097 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:12,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:12,098 INFO L82 PathProgramCache]: Analyzing trace with hash -123441129, now seen corresponding path program 1 times [2019-09-08 09:54:12,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:12,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:12,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:12,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:12,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:12,491 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 09:54:12,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:12,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:12,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:12,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:12,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:12,495 INFO L87 Difference]: Start difference. First operand 2521 states and 3840 transitions. Second operand 3 states. [2019-09-08 09:54:12,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:12,768 INFO L93 Difference]: Finished difference Result 7348 states and 11156 transitions. [2019-09-08 09:54:12,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:12,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-09-08 09:54:12,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:12,796 INFO L225 Difference]: With dead ends: 7348 [2019-09-08 09:54:12,796 INFO L226 Difference]: Without dead ends: 4956 [2019-09-08 09:54:12,803 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 09:54:12,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4956 states. [2019-09-08 09:54:13,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4956 to 4860. [2019-09-08 09:54:13,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4860 states. [2019-09-08 09:54:13,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4860 states to 4860 states and 7389 transitions. [2019-09-08 09:54:13,029 INFO L78 Accepts]: Start accepts. Automaton has 4860 states and 7389 transitions. Word has length 310 [2019-09-08 09:54:13,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:13,031 INFO L475 AbstractCegarLoop]: Abstraction has 4860 states and 7389 transitions. [2019-09-08 09:54:13,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:54:13,032 INFO L276 IsEmpty]: Start isEmpty. Operand 4860 states and 7389 transitions. [2019-09-08 09:54:13,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-08 09:54:13,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:13,050 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] [2019-09-08 09:54:13,051 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:13,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:13,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1576770148, now seen corresponding path program 1 times [2019-09-08 09:54:13,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:13,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:13,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:13,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:13,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:13,256 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 09:54:13,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:13,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:13,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:13,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:13,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:13,258 INFO L87 Difference]: Start difference. First operand 4860 states and 7389 transitions. Second operand 3 states. [2019-09-08 09:54:13,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:13,676 INFO L93 Difference]: Finished difference Result 14505 states and 22043 transitions. [2019-09-08 09:54:13,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:13,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-09-08 09:54:13,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:13,741 INFO L225 Difference]: With dead ends: 14505 [2019-09-08 09:54:13,742 INFO L226 Difference]: Without dead ends: 9687 [2019-09-08 09:54:13,756 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 09:54:13,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9687 states. [2019-09-08 09:54:14,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9687 to 4879. [2019-09-08 09:54:14,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4879 states. [2019-09-08 09:54:14,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4879 states to 4879 states and 7417 transitions. [2019-09-08 09:54:14,180 INFO L78 Accepts]: Start accepts. Automaton has 4879 states and 7417 transitions. Word has length 310 [2019-09-08 09:54:14,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:14,181 INFO L475 AbstractCegarLoop]: Abstraction has 4879 states and 7417 transitions. [2019-09-08 09:54:14,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:54:14,181 INFO L276 IsEmpty]: Start isEmpty. Operand 4879 states and 7417 transitions. [2019-09-08 09:54:14,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-08 09:54:14,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:14,204 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] [2019-09-08 09:54:14,205 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:14,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:14,206 INFO L82 PathProgramCache]: Analyzing trace with hash 518020883, now seen corresponding path program 1 times [2019-09-08 09:54:14,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:14,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:14,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:14,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:14,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:14,476 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 09:54:14,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:14,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:14,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:14,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:14,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:14,479 INFO L87 Difference]: Start difference. First operand 4879 states and 7417 transitions. Second operand 3 states. [2019-09-08 09:54:15,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:15,225 INFO L93 Difference]: Finished difference Result 14524 states and 22064 transitions. [2019-09-08 09:54:15,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:15,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-09-08 09:54:15,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:15,280 INFO L225 Difference]: With dead ends: 14524 [2019-09-08 09:54:15,281 INFO L226 Difference]: Without dead ends: 9705 [2019-09-08 09:54:15,295 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 09:54:15,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9705 states. [2019-09-08 09:54:15,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9705 to 4897. [2019-09-08 09:54:15,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4897 states. [2019-09-08 09:54:15,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4897 states to 4897 states and 7438 transitions. [2019-09-08 09:54:15,684 INFO L78 Accepts]: Start accepts. Automaton has 4897 states and 7438 transitions. Word has length 311 [2019-09-08 09:54:15,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:15,684 INFO L475 AbstractCegarLoop]: Abstraction has 4897 states and 7438 transitions. [2019-09-08 09:54:15,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:54:15,685 INFO L276 IsEmpty]: Start isEmpty. Operand 4897 states and 7438 transitions. [2019-09-08 09:54:15,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-08 09:54:15,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:15,698 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] [2019-09-08 09:54:15,699 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:15,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:15,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1496757711, now seen corresponding path program 1 times [2019-09-08 09:54:15,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:15,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:15,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:15,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:15,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:16,053 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 09:54:16,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:16,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:54:16,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:54:16,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:54:16,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:54:16,055 INFO L87 Difference]: Start difference. First operand 4897 states and 7438 transitions. Second operand 4 states. [2019-09-08 09:54:16,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:16,934 INFO L93 Difference]: Finished difference Result 14200 states and 21469 transitions. [2019-09-08 09:54:16,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:54:16,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 312 [2019-09-08 09:54:16,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:16,960 INFO L225 Difference]: With dead ends: 14200 [2019-09-08 09:54:16,960 INFO L226 Difference]: Without dead ends: 9632 [2019-09-08 09:54:16,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:54:16,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9632 states. [2019-09-08 09:54:17,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9632 to 5104. [2019-09-08 09:54:17,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5104 states. [2019-09-08 09:54:17,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5104 states to 5104 states and 7791 transitions. [2019-09-08 09:54:17,401 INFO L78 Accepts]: Start accepts. Automaton has 5104 states and 7791 transitions. Word has length 312 [2019-09-08 09:54:17,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:17,401 INFO L475 AbstractCegarLoop]: Abstraction has 5104 states and 7791 transitions. [2019-09-08 09:54:17,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:54:17,402 INFO L276 IsEmpty]: Start isEmpty. Operand 5104 states and 7791 transitions. [2019-09-08 09:54:17,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-08 09:54:17,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:17,416 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] [2019-09-08 09:54:17,416 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:17,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:17,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1658475278, now seen corresponding path program 1 times [2019-09-08 09:54:17,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:17,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:17,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:17,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:17,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:17,668 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 09:54:17,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:17,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:17,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:17,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:17,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:17,671 INFO L87 Difference]: Start difference. First operand 5104 states and 7791 transitions. Second operand 3 states. [2019-09-08 09:54:18,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:18,499 INFO L93 Difference]: Finished difference Result 14451 states and 21907 transitions. [2019-09-08 09:54:18,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:18,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-08 09:54:18,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:18,533 INFO L225 Difference]: With dead ends: 14451 [2019-09-08 09:54:18,534 INFO L226 Difference]: Without dead ends: 9767 [2019-09-08 09:54:18,550 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 09:54:18,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2019-09-08 09:54:19,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9671. [2019-09-08 09:54:19,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9671 states. [2019-09-08 09:54:19,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9671 states to 9671 states and 14646 transitions. [2019-09-08 09:54:19,206 INFO L78 Accepts]: Start accepts. Automaton has 9671 states and 14646 transitions. Word has length 312 [2019-09-08 09:54:19,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:19,206 INFO L475 AbstractCegarLoop]: Abstraction has 9671 states and 14646 transitions. [2019-09-08 09:54:19,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:54:19,206 INFO L276 IsEmpty]: Start isEmpty. Operand 9671 states and 14646 transitions. [2019-09-08 09:54:19,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 09:54:19,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:19,229 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] [2019-09-08 09:54:19,230 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:19,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:19,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1390647390, now seen corresponding path program 1 times [2019-09-08 09:54:19,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:19,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:19,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:19,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:19,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:19,381 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 09:54:19,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:19,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:19,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:19,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:19,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:19,383 INFO L87 Difference]: Start difference. First operand 9671 states and 14646 transitions. Second operand 3 states. [2019-09-08 09:54:20,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:20,313 INFO L93 Difference]: Finished difference Result 27443 states and 41219 transitions. [2019-09-08 09:54:20,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:20,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-08 09:54:20,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:20,357 INFO L225 Difference]: With dead ends: 27443 [2019-09-08 09:54:20,357 INFO L226 Difference]: Without dead ends: 18575 [2019-09-08 09:54:20,381 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 09:54:20,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18575 states. [2019-09-08 09:54:21,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18575 to 9775. [2019-09-08 09:54:21,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9775 states. [2019-09-08 09:54:21,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9775 states to 9775 states and 14789 transitions. [2019-09-08 09:54:21,059 INFO L78 Accepts]: Start accepts. Automaton has 9775 states and 14789 transitions. Word has length 314 [2019-09-08 09:54:21,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:21,060 INFO L475 AbstractCegarLoop]: Abstraction has 9775 states and 14789 transitions. [2019-09-08 09:54:21,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:54:21,060 INFO L276 IsEmpty]: Start isEmpty. Operand 9775 states and 14789 transitions. [2019-09-08 09:54:21,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-08 09:54:21,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:21,085 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] [2019-09-08 09:54:21,085 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:21,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:21,086 INFO L82 PathProgramCache]: Analyzing trace with hash -375836875, now seen corresponding path program 1 times [2019-09-08 09:54:21,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:21,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:21,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:21,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:21,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:21,365 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 09:54:21,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:21,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:21,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:21,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:21,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:21,368 INFO L87 Difference]: Start difference. First operand 9775 states and 14789 transitions. Second operand 3 states. [2019-09-08 09:54:22,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:22,285 INFO L93 Difference]: Finished difference Result 27575 states and 41385 transitions. [2019-09-08 09:54:22,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:22,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-09-08 09:54:22,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:22,327 INFO L225 Difference]: With dead ends: 27575 [2019-09-08 09:54:22,327 INFO L226 Difference]: Without dead ends: 18700 [2019-09-08 09:54:22,353 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 09:54:22,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18700 states. [2019-09-08 09:54:23,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18700 to 9900. [2019-09-08 09:54:23,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9900 states. [2019-09-08 09:54:23,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9900 states to 9900 states and 14935 transitions. [2019-09-08 09:54:23,725 INFO L78 Accepts]: Start accepts. Automaton has 9900 states and 14935 transitions. Word has length 315 [2019-09-08 09:54:23,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:23,726 INFO L475 AbstractCegarLoop]: Abstraction has 9900 states and 14935 transitions. [2019-09-08 09:54:23,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:54:23,726 INFO L276 IsEmpty]: Start isEmpty. Operand 9900 states and 14935 transitions. [2019-09-08 09:54:23,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-08 09:54:23,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:23,748 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] [2019-09-08 09:54:23,748 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:23,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:23,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1209893973, now seen corresponding path program 1 times [2019-09-08 09:54:23,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:23,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:23,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:23,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:23,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:24,124 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 09:54:24,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:24,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:54:24,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:54:24,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:54:24,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:54:24,127 INFO L87 Difference]: Start difference. First operand 9900 states and 14935 transitions. Second operand 4 states. [2019-09-08 09:54:24,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:24,598 INFO L93 Difference]: Finished difference Result 17765 states and 26664 transitions. [2019-09-08 09:54:24,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:54:24,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 316 [2019-09-08 09:54:24,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:24,619 INFO L225 Difference]: With dead ends: 17765 [2019-09-08 09:54:24,619 INFO L226 Difference]: Without dead ends: 8728 [2019-09-08 09:54:24,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:54:24,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8728 states. [2019-09-08 09:54:25,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8728 to 8708. [2019-09-08 09:54:25,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8708 states. [2019-09-08 09:54:25,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8708 states to 8708 states and 13146 transitions. [2019-09-08 09:54:25,260 INFO L78 Accepts]: Start accepts. Automaton has 8708 states and 13146 transitions. Word has length 316 [2019-09-08 09:54:25,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:25,261 INFO L475 AbstractCegarLoop]: Abstraction has 8708 states and 13146 transitions. [2019-09-08 09:54:25,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:54:25,261 INFO L276 IsEmpty]: Start isEmpty. Operand 8708 states and 13146 transitions. [2019-09-08 09:54:25,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 09:54:25,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:25,293 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] [2019-09-08 09:54:25,294 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:25,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:25,295 INFO L82 PathProgramCache]: Analyzing trace with hash -85064730, now seen corresponding path program 1 times [2019-09-08 09:54:25,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:25,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:25,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:25,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:25,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:26,009 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 09:54:26,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:26,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:54:26,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:54:26,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:54:26,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:54:26,011 INFO L87 Difference]: Start difference. First operand 8708 states and 13146 transitions. Second operand 4 states. [2019-09-08 09:54:26,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:26,870 INFO L93 Difference]: Finished difference Result 25482 states and 38387 transitions. [2019-09-08 09:54:26,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:54:26,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2019-09-08 09:54:26,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:26,901 INFO L225 Difference]: With dead ends: 25482 [2019-09-08 09:54:26,902 INFO L226 Difference]: Without dead ends: 16846 [2019-09-08 09:54:26,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:54:26,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16846 states. [2019-09-08 09:54:27,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16846 to 16754. [2019-09-08 09:54:27,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16754 states. [2019-09-08 09:54:27,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16754 states to 16754 states and 25082 transitions. [2019-09-08 09:54:27,906 INFO L78 Accepts]: Start accepts. Automaton has 16754 states and 25082 transitions. Word has length 320 [2019-09-08 09:54:27,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:27,906 INFO L475 AbstractCegarLoop]: Abstraction has 16754 states and 25082 transitions. [2019-09-08 09:54:27,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:54:27,907 INFO L276 IsEmpty]: Start isEmpty. Operand 16754 states and 25082 transitions. [2019-09-08 09:54:27,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 09:54:27,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:27,939 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] [2019-09-08 09:54:27,940 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:27,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:27,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1595405675, now seen corresponding path program 1 times [2019-09-08 09:54:27,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:27,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:27,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:27,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:27,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:28,177 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 09:54:28,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:28,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:28,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:28,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:28,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:28,179 INFO L87 Difference]: Start difference. First operand 16754 states and 25082 transitions. Second operand 3 states. [2019-09-08 09:54:29,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:29,666 INFO L93 Difference]: Finished difference Result 47923 states and 71304 transitions. [2019-09-08 09:54:29,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:29,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-09-08 09:54:29,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:29,723 INFO L225 Difference]: With dead ends: 47923 [2019-09-08 09:54:29,723 INFO L226 Difference]: Without dead ends: 32418 [2019-09-08 09:54:29,753 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 09:54:29,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32418 states. [2019-09-08 09:54:32,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32418 to 32328. [2019-09-08 09:54:32,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32328 states. [2019-09-08 09:54:32,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32328 states to 32328 states and 47955 transitions. [2019-09-08 09:54:32,162 INFO L78 Accepts]: Start accepts. Automaton has 32328 states and 47955 transitions. Word has length 322 [2019-09-08 09:54:32,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:32,163 INFO L475 AbstractCegarLoop]: Abstraction has 32328 states and 47955 transitions. [2019-09-08 09:54:32,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:54:32,163 INFO L276 IsEmpty]: Start isEmpty. Operand 32328 states and 47955 transitions. [2019-09-08 09:54:32,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 09:54:32,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:32,233 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] [2019-09-08 09:54:32,234 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:32,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:32,234 INFO L82 PathProgramCache]: Analyzing trace with hash 2112695856, now seen corresponding path program 1 times [2019-09-08 09:54:32,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:32,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:32,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:32,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:32,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:32,524 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 09:54:32,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:32,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:32,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:32,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:32,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:32,526 INFO L87 Difference]: Start difference. First operand 32328 states and 47955 transitions. Second operand 3 states. [2019-09-08 09:54:35,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:35,403 INFO L93 Difference]: Finished difference Result 94198 states and 139279 transitions. [2019-09-08 09:54:35,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:35,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-08 09:54:35,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:35,515 INFO L225 Difference]: With dead ends: 94198 [2019-09-08 09:54:35,515 INFO L226 Difference]: Without dead ends: 63217 [2019-09-08 09:54:35,565 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 09:54:35,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63217 states. [2019-09-08 09:54:39,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63217 to 63129. [2019-09-08 09:54:39,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63129 states. [2019-09-08 09:54:39,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63129 states to 63129 states and 92926 transitions. [2019-09-08 09:54:39,825 INFO L78 Accepts]: Start accepts. Automaton has 63129 states and 92926 transitions. Word has length 324 [2019-09-08 09:54:39,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:39,825 INFO L475 AbstractCegarLoop]: Abstraction has 63129 states and 92926 transitions. [2019-09-08 09:54:39,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:54:39,825 INFO L276 IsEmpty]: Start isEmpty. Operand 63129 states and 92926 transitions. [2019-09-08 09:54:39,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 09:54:39,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:39,882 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] [2019-09-08 09:54:39,883 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:39,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:39,883 INFO L82 PathProgramCache]: Analyzing trace with hash -943552819, now seen corresponding path program 1 times [2019-09-08 09:54:39,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:39,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:39,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:39,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:39,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:40,211 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 09:54:40,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:40,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:54:40,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:54:40,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:54:40,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:54:40,215 INFO L87 Difference]: Start difference. First operand 63129 states and 92926 transitions. Second operand 4 states. [2019-09-08 09:54:44,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:44,687 INFO L93 Difference]: Finished difference Result 164822 states and 241557 transitions. [2019-09-08 09:54:44,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:54:44,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-09-08 09:54:44,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:44,803 INFO L225 Difference]: With dead ends: 164822 [2019-09-08 09:54:44,804 INFO L226 Difference]: Without dead ends: 104985 [2019-09-08 09:54:44,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:54:44,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104985 states. [2019-09-08 09:54:49,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104985 to 61587. [2019-09-08 09:54:49,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61587 states. [2019-09-08 09:54:49,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61587 states to 61587 states and 90690 transitions. [2019-09-08 09:54:49,682 INFO L78 Accepts]: Start accepts. Automaton has 61587 states and 90690 transitions. Word has length 324 [2019-09-08 09:54:49,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:49,683 INFO L475 AbstractCegarLoop]: Abstraction has 61587 states and 90690 transitions. [2019-09-08 09:54:49,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:54:49,683 INFO L276 IsEmpty]: Start isEmpty. Operand 61587 states and 90690 transitions. [2019-09-08 09:54:49,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 09:54:49,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:49,722 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] [2019-09-08 09:54:49,722 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:49,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:49,723 INFO L82 PathProgramCache]: Analyzing trace with hash 2070798285, now seen corresponding path program 1 times [2019-09-08 09:54:49,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:49,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:49,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:49,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:49,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:49,871 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 09:54:49,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:49,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:49,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:49,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:49,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:49,873 INFO L87 Difference]: Start difference. First operand 61587 states and 90690 transitions. Second operand 3 states. [2019-09-08 09:54:54,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:54,843 INFO L93 Difference]: Finished difference Result 162416 states and 238052 transitions. [2019-09-08 09:54:54,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:54,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-09-08 09:54:54,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:54,996 INFO L225 Difference]: With dead ends: 162416 [2019-09-08 09:54:54,997 INFO L226 Difference]: Without dead ends: 107467 [2019-09-08 09:54:55,052 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 09:54:55,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107467 states. [2019-09-08 09:55:00,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107467 to 62068. [2019-09-08 09:55:00,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62068 states. [2019-09-08 09:55:00,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62068 states to 62068 states and 91288 transitions. [2019-09-08 09:55:00,236 INFO L78 Accepts]: Start accepts. Automaton has 62068 states and 91288 transitions. Word has length 327 [2019-09-08 09:55:00,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:55:00,236 INFO L475 AbstractCegarLoop]: Abstraction has 62068 states and 91288 transitions. [2019-09-08 09:55:00,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:55:00,236 INFO L276 IsEmpty]: Start isEmpty. Operand 62068 states and 91288 transitions. [2019-09-08 09:55:00,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 09:55:00,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:55:00,283 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] [2019-09-08 09:55:00,283 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:55:00,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:55:00,284 INFO L82 PathProgramCache]: Analyzing trace with hash 231783440, now seen corresponding path program 1 times [2019-09-08 09:55:00,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:55:00,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:55:00,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:00,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:55:00,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:55:00,672 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 09:55:00,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:55:00,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:55:00,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:55:00,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:55:00,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:55:00,676 INFO L87 Difference]: Start difference. First operand 62068 states and 91288 transitions. Second operand 4 states. [2019-09-08 09:55:03,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:55:03,542 INFO L93 Difference]: Finished difference Result 112468 states and 164777 transitions. [2019-09-08 09:55:03,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:55:03,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2019-09-08 09:55:03,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:55:03,610 INFO L225 Difference]: With dead ends: 112468 [2019-09-08 09:55:03,610 INFO L226 Difference]: Without dead ends: 55712 [2019-09-08 09:55:03,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:55:03,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55712 states. [2019-09-08 09:55:06,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55712 to 55385. [2019-09-08 09:55:06,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55385 states. [2019-09-08 09:55:06,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55385 states to 55385 states and 81428 transitions. [2019-09-08 09:55:06,647 INFO L78 Accepts]: Start accepts. Automaton has 55385 states and 81428 transitions. Word has length 328 [2019-09-08 09:55:06,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:55:06,648 INFO L475 AbstractCegarLoop]: Abstraction has 55385 states and 81428 transitions. [2019-09-08 09:55:06,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:55:06,648 INFO L276 IsEmpty]: Start isEmpty. Operand 55385 states and 81428 transitions. [2019-09-08 09:55:06,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 09:55:06,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:55:06,687 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] [2019-09-08 09:55:06,688 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:55:06,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:55:06,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1702036538, now seen corresponding path program 1 times [2019-09-08 09:55:06,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:55:06,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:55:06,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:06,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:55:06,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:55:06,962 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 09:55:06,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:55:06,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:55:06,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:55:06,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:55:06,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:55:06,964 INFO L87 Difference]: Start difference. First operand 55385 states and 81428 transitions. Second operand 3 states. [2019-09-08 09:55:13,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:55:13,343 INFO L93 Difference]: Finished difference Result 141457 states and 207384 transitions. [2019-09-08 09:55:13,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:55:13,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-08 09:55:13,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:55:13,461 INFO L225 Difference]: With dead ends: 141457 [2019-09-08 09:55:13,461 INFO L226 Difference]: Without dead ends: 98008 [2019-09-08 09:55:13,516 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 09:55:13,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98008 states. [2019-09-08 09:55:18,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98008 to 97886. [2019-09-08 09:55:18,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97886 states. [2019-09-08 09:55:18,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97886 states to 97886 states and 142859 transitions. [2019-09-08 09:55:18,989 INFO L78 Accepts]: Start accepts. Automaton has 97886 states and 142859 transitions. Word has length 332 [2019-09-08 09:55:18,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:55:18,990 INFO L475 AbstractCegarLoop]: Abstraction has 97886 states and 142859 transitions. [2019-09-08 09:55:18,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:55:18,990 INFO L276 IsEmpty]: Start isEmpty. Operand 97886 states and 142859 transitions. [2019-09-08 09:55:19,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 09:55:19,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:55:19,051 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] [2019-09-08 09:55:19,051 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:55:19,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:55:19,052 INFO L82 PathProgramCache]: Analyzing trace with hash -651767541, now seen corresponding path program 1 times [2019-09-08 09:55:19,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:55:19,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:55:19,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:19,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:55:19,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:55:19,523 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 09:55:19,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:55:19,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:55:19,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:55:19,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:55:19,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:55:19,525 INFO L87 Difference]: Start difference. First operand 97886 states and 142859 transitions. Second operand 4 states. [2019-09-08 09:55:30,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:55:30,278 INFO L93 Difference]: Finished difference Result 192002 states and 284916 transitions. [2019-09-08 09:55:30,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:55:30,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 332 [2019-09-08 09:55:30,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:55:30,447 INFO L225 Difference]: With dead ends: 192002 [2019-09-08 09:55:30,447 INFO L226 Difference]: Without dead ends: 166846 [2019-09-08 09:55:30,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:55:30,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166846 states. [2019-09-08 09:55:43,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166846 to 166844. [2019-09-08 09:55:43,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166844 states. [2019-09-08 09:55:43,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166844 states to 166844 states and 243465 transitions. [2019-09-08 09:55:43,586 INFO L78 Accepts]: Start accepts. Automaton has 166844 states and 243465 transitions. Word has length 332 [2019-09-08 09:55:43,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:55:43,587 INFO L475 AbstractCegarLoop]: Abstraction has 166844 states and 243465 transitions. [2019-09-08 09:55:43,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:55:43,587 INFO L276 IsEmpty]: Start isEmpty. Operand 166844 states and 243465 transitions. [2019-09-08 09:55:43,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 09:55:43,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:55:43,716 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] [2019-09-08 09:55:43,716 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:55:43,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:55:43,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1277621020, now seen corresponding path program 1 times [2019-09-08 09:55:43,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:55:43,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:55:43,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:43,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:55:43,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:55:44,268 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 09:55:44,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:55:44,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:55:44,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:55:44,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:55:44,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:55:44,270 INFO L87 Difference]: Start difference. First operand 166844 states and 243465 transitions. Second operand 4 states. [2019-09-08 09:56:04,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:56:04,949 INFO L93 Difference]: Finished difference Result 474336 states and 691636 transitions. [2019-09-08 09:56:04,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:56:04,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 332 [2019-09-08 09:56:04,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:56:05,374 INFO L225 Difference]: With dead ends: 474336 [2019-09-08 09:56:05,374 INFO L226 Difference]: Without dead ends: 307710 [2019-09-08 09:56:05,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:56:05,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307710 states. [2019-09-08 09:56:29,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307710 to 307640. [2019-09-08 09:56:29,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307640 states. [2019-09-08 09:56:30,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307640 states to 307640 states and 445576 transitions. [2019-09-08 09:56:30,040 INFO L78 Accepts]: Start accepts. Automaton has 307640 states and 445576 transitions. Word has length 332 [2019-09-08 09:56:30,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:56:30,041 INFO L475 AbstractCegarLoop]: Abstraction has 307640 states and 445576 transitions. [2019-09-08 09:56:30,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:56:30,041 INFO L276 IsEmpty]: Start isEmpty. Operand 307640 states and 445576 transitions. [2019-09-08 09:56:30,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-08 09:56:30,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:56:30,271 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] [2019-09-08 09:56:30,271 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:56:30,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:56:30,272 INFO L82 PathProgramCache]: Analyzing trace with hash 66956752, now seen corresponding path program 1 times [2019-09-08 09:56:30,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:56:30,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:56:30,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:30,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:56:30,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:56:30,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:56:30,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:56:30,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:56:30,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:56:30,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:56:30,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:56:30,514 INFO L87 Difference]: Start difference. First operand 307640 states and 445576 transitions. Second operand 3 states. [2019-09-08 09:57:15,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:57:15,556 INFO L93 Difference]: Finished difference Result 904956 states and 1307637 transitions. [2019-09-08 09:57:15,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:57:15,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 334 [2019-09-08 09:57:15,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:57:16,469 INFO L225 Difference]: With dead ends: 904956 [2019-09-08 09:57:16,469 INFO L226 Difference]: Without dead ends: 601993 [2019-09-08 09:57:16,743 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 09:57:17,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601993 states. [2019-09-08 09:58:10,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601993 to 601679. [2019-09-08 09:58:10,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601679 states. [2019-09-08 09:58:12,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601679 states to 601679 states and 863915 transitions. [2019-09-08 09:58:12,395 INFO L78 Accepts]: Start accepts. Automaton has 601679 states and 863915 transitions. Word has length 334 [2019-09-08 09:58:12,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:58:12,395 INFO L475 AbstractCegarLoop]: Abstraction has 601679 states and 863915 transitions. [2019-09-08 09:58:12,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:58:12,395 INFO L276 IsEmpty]: Start isEmpty. Operand 601679 states and 863915 transitions. [2019-09-08 09:58:12,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-08 09:58:12,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:58:12,919 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] [2019-09-08 09:58:12,920 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:58:12,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:58:12,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1767446664, now seen corresponding path program 1 times [2019-09-08 09:58:12,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:58:12,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:58:12,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:58:12,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:58:12,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:58:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:58:13,262 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 09:58:13,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:58:13,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:58:13,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:58:13,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:58:13,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:58:13,265 INFO L87 Difference]: Start difference. First operand 601679 states and 863915 transitions. Second operand 4 states. [2019-09-08 09:59:33,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:59:33,526 INFO L93 Difference]: Finished difference Result 1543044 states and 2211265 transitions. [2019-09-08 09:59:33,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:59:33,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 336 [2019-09-08 09:59:33,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:59:35,667 INFO L225 Difference]: With dead ends: 1543044 [2019-09-08 09:59:35,668 INFO L226 Difference]: Without dead ends: 978238 [2019-09-08 09:59:36,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:59:36,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978238 states. [2019-09-08 10:00:34,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978238 to 581140. [2019-09-08 10:00:34,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 581140 states. [2019-09-08 10:00:35,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581140 states to 581140 states and 834309 transitions. [2019-09-08 10:00:35,553 INFO L78 Accepts]: Start accepts. Automaton has 581140 states and 834309 transitions. Word has length 336 [2019-09-08 10:00:35,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:00:35,553 INFO L475 AbstractCegarLoop]: Abstraction has 581140 states and 834309 transitions. [2019-09-08 10:00:35,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:00:35,553 INFO L276 IsEmpty]: Start isEmpty. Operand 581140 states and 834309 transitions. [2019-09-08 10:00:35,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-08 10:00:35,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:00:35,966 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] [2019-09-08 10:00:35,966 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:00:35,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:00:35,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1206902741, now seen corresponding path program 1 times [2019-09-08 10:00:35,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:00:35,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:00:35,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:00:35,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:00:35,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:00:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:00:36,200 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:00:36,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:00:36,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:00:36,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:00:36,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:00:36,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:00:36,202 INFO L87 Difference]: Start difference. First operand 581140 states and 834309 transitions. Second operand 3 states. [2019-09-08 10:02:11,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:11,657 INFO L93 Difference]: Finished difference Result 1675509 states and 2398792 transitions. [2019-09-08 10:02:11,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:02:11,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-09-08 10:02:11,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:13,977 INFO L225 Difference]: With dead ends: 1675509 [2019-09-08 10:02:13,978 INFO L226 Difference]: Without dead ends: 1109897 [2019-09-08 10:02:14,455 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:02:15,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109897 states. [2019-09-08 10:04:16,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109897 to 1109843. [2019-09-08 10:04:16,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1109843 states. [2019-09-08 10:04:18,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109843 states to 1109843 states and 1578416 transitions. [2019-09-08 10:04:18,141 INFO L78 Accepts]: Start accepts. Automaton has 1109843 states and 1578416 transitions. Word has length 336 [2019-09-08 10:04:18,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:04:18,142 INFO L475 AbstractCegarLoop]: Abstraction has 1109843 states and 1578416 transitions. [2019-09-08 10:04:18,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:04:18,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1109843 states and 1578416 transitions. [2019-09-08 10:04:19,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-09-08 10:04:19,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:04:19,118 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] [2019-09-08 10:04:19,119 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:04:19,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:04:19,119 INFO L82 PathProgramCache]: Analyzing trace with hash 585987644, now seen corresponding path program 1 times [2019-09-08 10:04:19,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:04:19,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:04:19,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:19,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:04:19,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:04:20,709 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:04:20,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:04:20,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:04:20,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:04:20,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:04:20,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:04:20,711 INFO L87 Difference]: Start difference. First operand 1109843 states and 1578416 transitions. Second operand 3 states.