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_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:21:20,802 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:21:20,805 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:21:20,818 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:21:20,818 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:21:20,819 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:21:20,821 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:21:20,823 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:21:20,832 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:21:20,833 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:21:20,837 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:21:20,839 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:21:20,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:21:20,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:21:20,841 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:21:20,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:21:20,845 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:21:20,847 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:21:20,851 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:21:20,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:21:20,857 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:21:20,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:21:20,862 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:21:20,863 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:21:20,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:21:20,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:21:20,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:21:20,868 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:21:20,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:21:20,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:21:20,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:21:20,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:21:20,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:21:20,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:21:20,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:21:20,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:21:20,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:21:20,880 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:21:20,881 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:21:20,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:21:20,883 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:21:20,884 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 13:21:20,908 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:21:20,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:21:20,911 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:21:20,911 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:21:20,911 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:21:20,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:21:20,912 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:21:20,912 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:21:20,912 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:21:20,912 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:21:20,913 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:21:20,913 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:21:20,914 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:21:20,914 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:21:20,914 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:21:20,914 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:21:20,914 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:21:20,915 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:21:20,915 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:21:20,915 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:21:20,915 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:21:20,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:21:20,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:21:20,916 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:21:20,916 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:21:20,916 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:21:20,917 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:21:20,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:21:20,917 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:21:20,969 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:21:20,988 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:21:20,993 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:21:20,994 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:21:20,995 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:21:20,995 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 13:21:21,068 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f05993e3/d6e63d90dede4d7db995a249fe06b63a/FLAG84bda160f [2019-09-08 13:21:21,703 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:21:21,704 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 13:21:21,733 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f05993e3/d6e63d90dede4d7db995a249fe06b63a/FLAG84bda160f [2019-09-08 13:21:22,022 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f05993e3/d6e63d90dede4d7db995a249fe06b63a [2019-09-08 13:21:22,035 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:21:22,037 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:21:22,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:21:22,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:21:22,042 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:21:22,043 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:21:22" (1/1) ... [2019-09-08 13:21:22,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57698221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:21:22, skipping insertion in model container [2019-09-08 13:21:22,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:21:22" (1/1) ... [2019-09-08 13:21:22,055 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:21:22,229 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:21:23,615 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:21:23,630 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:21:24,740 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:21:24,781 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:21:24,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:21:24 WrapperNode [2019-09-08 13:21:24,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:21:24,784 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:21:24,784 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:21:24,784 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:21:24,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:21:24" (1/1) ... [2019-09-08 13:21:24,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:21:24" (1/1) ... [2019-09-08 13:21:24,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:21:24" (1/1) ... [2019-09-08 13:21:24,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:21:24" (1/1) ... [2019-09-08 13:21:24,898 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:21:24" (1/1) ... [2019-09-08 13:21:24,941 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:21:24" (1/1) ... [2019-09-08 13:21:24,960 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:21:24" (1/1) ... [2019-09-08 13:21:24,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:21:24,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:21:24,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:21:24,983 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:21:24,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:21:24" (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 13:21:25,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:21:25,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:21:25,061 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:21:25,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:21:25,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:21:25,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:21:25,063 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:21:25,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:21:25,064 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:21:25,064 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:21:25,065 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:21:25,065 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:21:25,066 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:21:25,066 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:21:25,067 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:21:25,067 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:21:25,069 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:21:25,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:21:25,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:21:28,339 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:21:28,339 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:21:28,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:21:28 BoogieIcfgContainer [2019-09-08 13:21:28,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:21:28,342 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:21:28,342 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:21:28,345 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:21:28,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:21:22" (1/3) ... [2019-09-08 13:21:28,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14081947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:21:28, skipping insertion in model container [2019-09-08 13:21:28,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:21:24" (2/3) ... [2019-09-08 13:21:28,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14081947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:21:28, skipping insertion in model container [2019-09-08 13:21:28,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:21:28" (3/3) ... [2019-09-08 13:21:28,348 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 13:21:28,358 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:21:28,368 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-09-08 13:21:28,387 INFO L252 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-09-08 13:21:28,432 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:21:28,433 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:21:28,433 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:21:28,433 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:21:28,433 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:21:28,433 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:21:28,433 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:21:28,433 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:21:28,434 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:21:28,466 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states. [2019-09-08 13:21:28,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 13:21:28,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:28,501 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 13:21:28,503 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:28,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:28,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1793510694, now seen corresponding path program 1 times [2019-09-08 13:21:28,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:28,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:28,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:28,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:28,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:29,529 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 13:21:29,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:29,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:21:29,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:21:29,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:21:29,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:21:29,554 INFO L87 Difference]: Start difference. First operand 973 states. Second operand 3 states. [2019-09-08 13:21:29,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:29,961 INFO L93 Difference]: Finished difference Result 1689 states and 2999 transitions. [2019-09-08 13:21:29,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:21:29,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-08 13:21:29,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:30,001 INFO L225 Difference]: With dead ends: 1689 [2019-09-08 13:21:30,002 INFO L226 Difference]: Without dead ends: 1407 [2019-09-08 13:21:30,014 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 13:21:30,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2019-09-08 13:21:30,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1405. [2019-09-08 13:21:30,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1405 states. [2019-09-08 13:21:30,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 2160 transitions. [2019-09-08 13:21:30,171 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 2160 transitions. Word has length 314 [2019-09-08 13:21:30,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:30,181 INFO L475 AbstractCegarLoop]: Abstraction has 1405 states and 2160 transitions. [2019-09-08 13:21:30,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:21:30,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 2160 transitions. [2019-09-08 13:21:30,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 13:21:30,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:30,198 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 13:21:30,199 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:30,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:30,200 INFO L82 PathProgramCache]: Analyzing trace with hash -529611659, now seen corresponding path program 1 times [2019-09-08 13:21:30,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:30,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:30,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:30,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:30,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:30,736 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 13:21:30,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:30,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:21:30,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:21:30,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:21:30,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:21:30,740 INFO L87 Difference]: Start difference. First operand 1405 states and 2160 transitions. Second operand 3 states. [2019-09-08 13:21:31,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:31,127 INFO L93 Difference]: Finished difference Result 2696 states and 4195 transitions. [2019-09-08 13:21:31,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:21:31,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-08 13:21:31,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:31,143 INFO L225 Difference]: With dead ends: 2696 [2019-09-08 13:21:31,143 INFO L226 Difference]: Without dead ends: 2301 [2019-09-08 13:21:31,147 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 13:21:31,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2301 states. [2019-09-08 13:21:31,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2301 to 2299. [2019-09-08 13:21:31,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2299 states. [2019-09-08 13:21:31,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 3555 transitions. [2019-09-08 13:21:31,228 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 3555 transitions. Word has length 314 [2019-09-08 13:21:31,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:31,229 INFO L475 AbstractCegarLoop]: Abstraction has 2299 states and 3555 transitions. [2019-09-08 13:21:31,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:21:31,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 3555 transitions. [2019-09-08 13:21:31,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 13:21:31,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:31,239 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 13:21:31,240 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:31,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:31,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1390220078, now seen corresponding path program 1 times [2019-09-08 13:21:31,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:31,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:31,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:31,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:31,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:31,550 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 13:21:31,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:31,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:21:31,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:21:31,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:21:31,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:21:31,552 INFO L87 Difference]: Start difference. First operand 2299 states and 3555 transitions. Second operand 3 states. [2019-09-08 13:21:31,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:31,916 INFO L93 Difference]: Finished difference Result 4778 states and 7484 transitions. [2019-09-08 13:21:31,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:21:31,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-08 13:21:31,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:31,943 INFO L225 Difference]: With dead ends: 4778 [2019-09-08 13:21:31,944 INFO L226 Difference]: Without dead ends: 4133 [2019-09-08 13:21:31,948 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 13:21:31,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4133 states. [2019-09-08 13:21:32,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4133 to 4131. [2019-09-08 13:21:32,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2019-09-08 13:21:32,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 6415 transitions. [2019-09-08 13:21:32,202 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 6415 transitions. Word has length 314 [2019-09-08 13:21:32,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:32,203 INFO L475 AbstractCegarLoop]: Abstraction has 4131 states and 6415 transitions. [2019-09-08 13:21:32,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:21:32,203 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 6415 transitions. [2019-09-08 13:21:32,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 13:21:32,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:32,215 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 13:21:32,215 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:32,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:32,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1390558702, now seen corresponding path program 1 times [2019-09-08 13:21:32,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:32,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:32,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:32,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:32,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:33,126 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 13:21:33,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:33,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:21:33,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:21:33,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:21:33,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:21:33,128 INFO L87 Difference]: Start difference. First operand 4131 states and 6415 transitions. Second operand 4 states. [2019-09-08 13:21:33,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:33,525 INFO L93 Difference]: Finished difference Result 12245 states and 18996 transitions. [2019-09-08 13:21:33,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:21:33,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2019-09-08 13:21:33,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:33,563 INFO L225 Difference]: With dead ends: 12245 [2019-09-08 13:21:33,563 INFO L226 Difference]: Without dead ends: 8129 [2019-09-08 13:21:33,575 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 13:21:33,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8129 states. [2019-09-08 13:21:33,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8129 to 7930. [2019-09-08 13:21:33,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7930 states. [2019-09-08 13:21:33,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7930 states to 7930 states and 12283 transitions. [2019-09-08 13:21:33,962 INFO L78 Accepts]: Start accepts. Automaton has 7930 states and 12283 transitions. Word has length 314 [2019-09-08 13:21:33,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:33,963 INFO L475 AbstractCegarLoop]: Abstraction has 7930 states and 12283 transitions. [2019-09-08 13:21:33,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:21:33,963 INFO L276 IsEmpty]: Start isEmpty. Operand 7930 states and 12283 transitions. [2019-09-08 13:21:33,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-08 13:21:33,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:33,982 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 13:21:33,982 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:33,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:33,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1931658382, now seen corresponding path program 1 times [2019-09-08 13:21:33,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:33,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:33,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:33,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:33,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:34,278 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 13:21:34,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:34,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:21:34,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:21:34,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:21:34,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:21:34,280 INFO L87 Difference]: Start difference. First operand 7930 states and 12283 transitions. Second operand 3 states. [2019-09-08 13:21:34,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:34,870 INFO L93 Difference]: Finished difference Result 23328 states and 36063 transitions. [2019-09-08 13:21:34,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:21:34,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-09-08 13:21:34,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:34,955 INFO L225 Difference]: With dead ends: 23328 [2019-09-08 13:21:34,956 INFO L226 Difference]: Without dead ends: 15527 [2019-09-08 13:21:34,979 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 13:21:35,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15527 states. [2019-09-08 13:21:35,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15527 to 15328. [2019-09-08 13:21:35,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15328 states. [2019-09-08 13:21:35,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15328 states to 15328 states and 23620 transitions. [2019-09-08 13:21:35,602 INFO L78 Accepts]: Start accepts. Automaton has 15328 states and 23620 transitions. Word has length 316 [2019-09-08 13:21:35,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:35,603 INFO L475 AbstractCegarLoop]: Abstraction has 15328 states and 23620 transitions. [2019-09-08 13:21:35,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:21:35,603 INFO L276 IsEmpty]: Start isEmpty. Operand 15328 states and 23620 transitions. [2019-09-08 13:21:35,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-08 13:21:35,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:35,643 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 13:21:35,644 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:35,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:35,645 INFO L82 PathProgramCache]: Analyzing trace with hash 731103827, now seen corresponding path program 1 times [2019-09-08 13:21:35,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:35,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:35,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:35,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:35,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:35,841 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 13:21:35,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:35,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:21:35,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:21:35,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:21:35,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:21:35,843 INFO L87 Difference]: Start difference. First operand 15328 states and 23620 transitions. Second operand 3 states. [2019-09-08 13:21:37,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:37,146 INFO L93 Difference]: Finished difference Result 45909 states and 70736 transitions. [2019-09-08 13:21:37,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:21:37,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-09-08 13:21:37,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:37,218 INFO L225 Difference]: With dead ends: 45909 [2019-09-08 13:21:37,218 INFO L226 Difference]: Without dead ends: 30623 [2019-09-08 13:21:37,251 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 13:21:37,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30623 states. [2019-09-08 13:21:37,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30623 to 15347. [2019-09-08 13:21:37,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15347 states. [2019-09-08 13:21:37,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15347 states to 15347 states and 23648 transitions. [2019-09-08 13:21:37,971 INFO L78 Accepts]: Start accepts. Automaton has 15347 states and 23648 transitions. Word has length 316 [2019-09-08 13:21:37,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:37,972 INFO L475 AbstractCegarLoop]: Abstraction has 15347 states and 23648 transitions. [2019-09-08 13:21:37,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:21:37,973 INFO L276 IsEmpty]: Start isEmpty. Operand 15347 states and 23648 transitions. [2019-09-08 13:21:38,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-08 13:21:38,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:38,007 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] [2019-09-08 13:21:38,008 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:38,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:38,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1542759636, now seen corresponding path program 1 times [2019-09-08 13:21:38,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:38,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:38,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:38,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:38,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:38,222 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 13:21:38,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:38,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:21:38,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:21:38,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:21:38,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:21:38,225 INFO L87 Difference]: Start difference. First operand 15347 states and 23648 transitions. Second operand 3 states. [2019-09-08 13:21:39,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:39,098 INFO L93 Difference]: Finished difference Result 45928 states and 70757 transitions. [2019-09-08 13:21:39,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:21:39,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2019-09-08 13:21:39,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:39,186 INFO L225 Difference]: With dead ends: 45928 [2019-09-08 13:21:39,186 INFO L226 Difference]: Without dead ends: 30641 [2019-09-08 13:21:39,229 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 13:21:39,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30641 states. [2019-09-08 13:21:40,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30641 to 15365. [2019-09-08 13:21:40,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15365 states. [2019-09-08 13:21:40,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15365 states to 15365 states and 23669 transitions. [2019-09-08 13:21:40,167 INFO L78 Accepts]: Start accepts. Automaton has 15365 states and 23669 transitions. Word has length 317 [2019-09-08 13:21:40,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:40,167 INFO L475 AbstractCegarLoop]: Abstraction has 15365 states and 23669 transitions. [2019-09-08 13:21:40,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:21:40,167 INFO L276 IsEmpty]: Start isEmpty. Operand 15365 states and 23669 transitions. [2019-09-08 13:21:40,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 13:21:40,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:40,197 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] [2019-09-08 13:21:40,197 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:40,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:40,198 INFO L82 PathProgramCache]: Analyzing trace with hash -799652503, now seen corresponding path program 1 times [2019-09-08 13:21:40,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:40,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:40,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:40,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:40,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:40,465 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 13:21:40,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:40,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:21:40,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:21:40,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:21:40,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:21:40,470 INFO L87 Difference]: Start difference. First operand 15365 states and 23669 transitions. Second operand 3 states. [2019-09-08 13:21:41,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:41,270 INFO L93 Difference]: Finished difference Result 43435 states and 66751 transitions. [2019-09-08 13:21:41,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:21:41,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-08 13:21:41,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:41,335 INFO L225 Difference]: With dead ends: 43435 [2019-09-08 13:21:41,335 INFO L226 Difference]: Without dead ends: 28315 [2019-09-08 13:21:41,383 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 13:21:41,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28315 states. [2019-09-08 13:21:43,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28315 to 28116. [2019-09-08 13:21:43,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28116 states. [2019-09-08 13:21:43,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28116 states to 28116 states and 42990 transitions. [2019-09-08 13:21:43,150 INFO L78 Accepts]: Start accepts. Automaton has 28116 states and 42990 transitions. Word has length 318 [2019-09-08 13:21:43,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:43,151 INFO L475 AbstractCegarLoop]: Abstraction has 28116 states and 42990 transitions. [2019-09-08 13:21:43,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:21:43,151 INFO L276 IsEmpty]: Start isEmpty. Operand 28116 states and 42990 transitions. [2019-09-08 13:21:43,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 13:21:43,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:43,201 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] [2019-09-08 13:21:43,201 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:43,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:43,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1480750214, now seen corresponding path program 1 times [2019-09-08 13:21:43,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:43,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:43,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:43,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:43,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:43,551 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 13:21:43,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:43,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:21:43,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:21:43,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:21:43,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:21:43,553 INFO L87 Difference]: Start difference. First operand 28116 states and 42990 transitions. Second operand 4 states. [2019-09-08 13:21:44,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:44,905 INFO L93 Difference]: Finished difference Result 81684 states and 124697 transitions. [2019-09-08 13:21:44,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:21:44,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 318 [2019-09-08 13:21:44,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:44,988 INFO L225 Difference]: With dead ends: 81684 [2019-09-08 13:21:44,988 INFO L226 Difference]: Without dead ends: 54108 [2019-09-08 13:21:45,034 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 13:21:45,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54108 states. [2019-09-08 13:21:47,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54108 to 28351. [2019-09-08 13:21:47,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28351 states. [2019-09-08 13:21:47,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28351 states to 28351 states and 43378 transitions. [2019-09-08 13:21:47,370 INFO L78 Accepts]: Start accepts. Automaton has 28351 states and 43378 transitions. Word has length 318 [2019-09-08 13:21:47,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:47,371 INFO L475 AbstractCegarLoop]: Abstraction has 28351 states and 43378 transitions. [2019-09-08 13:21:47,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:21:47,371 INFO L276 IsEmpty]: Start isEmpty. Operand 28351 states and 43378 transitions. [2019-09-08 13:21:47,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-09-08 13:21:47,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:47,390 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] [2019-09-08 13:21:47,390 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:47,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:47,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1111256138, now seen corresponding path program 1 times [2019-09-08 13:21:47,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:47,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:47,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:47,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:47,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:47,559 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 13:21:47,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:47,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:21:47,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:21:47,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:21:47,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:21:47,561 INFO L87 Difference]: Start difference. First operand 28351 states and 43378 transitions. Second operand 3 states. [2019-09-08 13:21:48,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:48,966 INFO L93 Difference]: Finished difference Result 67353 states and 103950 transitions. [2019-09-08 13:21:48,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:21:48,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 319 [2019-09-08 13:21:48,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:49,027 INFO L225 Difference]: With dead ends: 67353 [2019-09-08 13:21:49,028 INFO L226 Difference]: Without dead ends: 40765 [2019-09-08 13:21:49,059 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 13:21:49,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40765 states. [2019-09-08 13:21:50,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40765 to 35523. [2019-09-08 13:21:50,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35523 states. [2019-09-08 13:21:50,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35523 states to 35523 states and 55186 transitions. [2019-09-08 13:21:50,795 INFO L78 Accepts]: Start accepts. Automaton has 35523 states and 55186 transitions. Word has length 319 [2019-09-08 13:21:50,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:50,795 INFO L475 AbstractCegarLoop]: Abstraction has 35523 states and 55186 transitions. [2019-09-08 13:21:50,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:21:50,795 INFO L276 IsEmpty]: Start isEmpty. Operand 35523 states and 55186 transitions. [2019-09-08 13:21:50,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 13:21:50,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:50,813 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 13:21:50,814 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:50,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:50,814 INFO L82 PathProgramCache]: Analyzing trace with hash -498443357, now seen corresponding path program 1 times [2019-09-08 13:21:50,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:50,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:50,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:50,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:50,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:50,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 13:21:50,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:50,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:21:50,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:21:50,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:21:50,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:21:50,964 INFO L87 Difference]: Start difference. First operand 35523 states and 55186 transitions. Second operand 3 states. [2019-09-08 13:21:54,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:54,045 INFO L93 Difference]: Finished difference Result 104999 states and 162839 transitions. [2019-09-08 13:21:54,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:21:54,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-08 13:21:54,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:54,147 INFO L225 Difference]: With dead ends: 104999 [2019-09-08 13:21:54,148 INFO L226 Difference]: Without dead ends: 70279 [2019-09-08 13:21:54,192 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 13:21:54,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70279 states. [2019-09-08 13:21:55,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70279 to 35627. [2019-09-08 13:21:55,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35627 states. [2019-09-08 13:21:56,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35627 states to 35627 states and 55329 transitions. [2019-09-08 13:21:56,009 INFO L78 Accepts]: Start accepts. Automaton has 35627 states and 55329 transitions. Word has length 320 [2019-09-08 13:21:56,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:56,009 INFO L475 AbstractCegarLoop]: Abstraction has 35627 states and 55329 transitions. [2019-09-08 13:21:56,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:21:56,009 INFO L276 IsEmpty]: Start isEmpty. Operand 35627 states and 55329 transitions. [2019-09-08 13:21:56,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-08 13:21:56,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:56,034 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] [2019-09-08 13:21:56,034 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:56,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:56,035 INFO L82 PathProgramCache]: Analyzing trace with hash -623768252, now seen corresponding path program 1 times [2019-09-08 13:21:56,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:56,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:56,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:56,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:56,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:56,189 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 13:21:56,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:56,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:21:56,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:21:56,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:21:56,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:21:56,193 INFO L87 Difference]: Start difference. First operand 35627 states and 55329 transitions. Second operand 3 states. [2019-09-08 13:21:58,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:58,685 INFO L93 Difference]: Finished difference Result 105131 states and 163005 transitions. [2019-09-08 13:21:58,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:21:58,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-09-08 13:21:58,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:58,774 INFO L225 Difference]: With dead ends: 105131 [2019-09-08 13:21:58,774 INFO L226 Difference]: Without dead ends: 70404 [2019-09-08 13:21:58,819 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 13:21:58,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70404 states. [2019-09-08 13:22:00,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70404 to 35752. [2019-09-08 13:22:00,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35752 states. [2019-09-08 13:22:00,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35752 states to 35752 states and 55475 transitions. [2019-09-08 13:22:00,433 INFO L78 Accepts]: Start accepts. Automaton has 35752 states and 55475 transitions. Word has length 321 [2019-09-08 13:22:00,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:22:00,434 INFO L475 AbstractCegarLoop]: Abstraction has 35752 states and 55475 transitions. [2019-09-08 13:22:00,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:22:00,434 INFO L276 IsEmpty]: Start isEmpty. Operand 35752 states and 55475 transitions. [2019-09-08 13:22:00,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 13:22:00,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:22:00,452 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 13:22:00,452 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:22:00,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:22:00,452 INFO L82 PathProgramCache]: Analyzing trace with hash 917262259, now seen corresponding path program 1 times [2019-09-08 13:22:00,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:22:00,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:22:00,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:00,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:22:00,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:22:01,060 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 13:22:01,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:22:01,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:22:01,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:22:01,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:22:01,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:22:01,062 INFO L87 Difference]: Start difference. First operand 35752 states and 55475 transitions. Second operand 5 states. [2019-09-08 13:22:05,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:22:05,828 INFO L93 Difference]: Finished difference Result 99746 states and 154947 transitions. [2019-09-08 13:22:05,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:22:05,828 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 322 [2019-09-08 13:22:05,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:22:05,893 INFO L225 Difference]: With dead ends: 99746 [2019-09-08 13:22:05,893 INFO L226 Difference]: Without dead ends: 65970 [2019-09-08 13:22:05,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:22:05,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65970 states. [2019-09-08 13:22:08,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65970 to 65968. [2019-09-08 13:22:08,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65968 states. [2019-09-08 13:22:08,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65968 states to 65968 states and 102059 transitions. [2019-09-08 13:22:08,977 INFO L78 Accepts]: Start accepts. Automaton has 65968 states and 102059 transitions. Word has length 322 [2019-09-08 13:22:08,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:22:08,978 INFO L475 AbstractCegarLoop]: Abstraction has 65968 states and 102059 transitions. [2019-09-08 13:22:08,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:22:08,978 INFO L276 IsEmpty]: Start isEmpty. Operand 65968 states and 102059 transitions. [2019-09-08 13:22:09,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 13:22:09,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:22:09,007 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 13:22:09,007 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:22:09,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:22:09,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1932771416, now seen corresponding path program 1 times [2019-09-08 13:22:09,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:22:09,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:22:09,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:09,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:22:09,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:22:09,659 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 13:22:09,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:22:09,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:22:09,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:22:09,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:22:09,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:22:09,661 INFO L87 Difference]: Start difference. First operand 65968 states and 102059 transitions. Second operand 4 states. [2019-09-08 13:22:17,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:22:17,394 INFO L93 Difference]: Finished difference Result 195435 states and 302251 transitions. [2019-09-08 13:22:17,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:22:17,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2019-09-08 13:22:17,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:22:17,538 INFO L225 Difference]: With dead ends: 195435 [2019-09-08 13:22:17,538 INFO L226 Difference]: Without dead ends: 129539 [2019-09-08 13:22:17,588 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 13:22:17,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129539 states. [2019-09-08 13:22:23,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129539 to 129364. [2019-09-08 13:22:23,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129364 states. [2019-09-08 13:22:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129364 states to 129364 states and 199110 transitions. [2019-09-08 13:22:23,923 INFO L78 Accepts]: Start accepts. Automaton has 129364 states and 199110 transitions. Word has length 322 [2019-09-08 13:22:23,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:22:23,924 INFO L475 AbstractCegarLoop]: Abstraction has 129364 states and 199110 transitions. [2019-09-08 13:22:23,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:22:23,924 INFO L276 IsEmpty]: Start isEmpty. Operand 129364 states and 199110 transitions. [2019-09-08 13:22:23,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 13:22:23,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:22:23,991 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 13:22:23,992 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:22:23,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:22:23,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1561766959, now seen corresponding path program 1 times [2019-09-08 13:22:23,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:22:23,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:22:23,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:23,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:22:23,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:22:24,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:22:24,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:22:24,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:22:24,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:22:24,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:22:24,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:22:24,355 INFO L87 Difference]: Start difference. First operand 129364 states and 199110 transitions. Second operand 3 states. [2019-09-08 13:22:38,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:22:38,386 INFO L93 Difference]: Finished difference Result 380102 states and 583938 transitions. [2019-09-08 13:22:38,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:22:38,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-08 13:22:38,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:22:38,680 INFO L225 Difference]: With dead ends: 380102 [2019-09-08 13:22:38,681 INFO L226 Difference]: Without dead ends: 252227 [2019-09-08 13:22:38,777 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 13:22:38,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252227 states. [2019-09-08 13:22:58,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252227 to 252060. [2019-09-08 13:22:58,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252060 states. [2019-09-08 13:22:58,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252060 states to 252060 states and 385081 transitions. [2019-09-08 13:22:58,671 INFO L78 Accepts]: Start accepts. Automaton has 252060 states and 385081 transitions. Word has length 324 [2019-09-08 13:22:58,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:22:58,671 INFO L475 AbstractCegarLoop]: Abstraction has 252060 states and 385081 transitions. [2019-09-08 13:22:58,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:22:58,672 INFO L276 IsEmpty]: Start isEmpty. Operand 252060 states and 385081 transitions. [2019-09-08 13:22:58,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 13:22:58,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:22:58,799 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 13:22:58,799 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:22:58,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:22:58,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1252289030, now seen corresponding path program 1 times [2019-09-08 13:22:58,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:22:58,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:22:58,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:58,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:22:58,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:22:59,051 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 13:22:59,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:22:59,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:22:59,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:22:59,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:22:59,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:22:59,055 INFO L87 Difference]: Start difference. First operand 252060 states and 385081 transitions. Second operand 3 states. [2019-09-08 13:23:26,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:23:26,343 INFO L93 Difference]: Finished difference Result 713952 states and 1088486 transitions. [2019-09-08 13:23:26,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:23:26,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-08 13:23:26,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:23:27,000 INFO L225 Difference]: With dead ends: 713952 [2019-09-08 13:23:27,000 INFO L226 Difference]: Without dead ends: 463387 [2019-09-08 13:23:27,173 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 13:23:27,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463387 states. [2019-09-08 13:24:05,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463387 to 463228. [2019-09-08 13:24:05,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463228 states. [2019-09-08 13:24:06,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463228 states to 463228 states and 701598 transitions. [2019-09-08 13:24:06,720 INFO L78 Accepts]: Start accepts. Automaton has 463228 states and 701598 transitions. Word has length 324 [2019-09-08 13:24:06,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:24:06,720 INFO L475 AbstractCegarLoop]: Abstraction has 463228 states and 701598 transitions. [2019-09-08 13:24:06,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:24:06,720 INFO L276 IsEmpty]: Start isEmpty. Operand 463228 states and 701598 transitions. [2019-09-08 13:24:06,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 13:24:06,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:24:06,975 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 13:24:06,975 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:24:06,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:24:06,976 INFO L82 PathProgramCache]: Analyzing trace with hash -2008988189, now seen corresponding path program 1 times [2019-09-08 13:24:06,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:24:06,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:24:06,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:24:06,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:24:06,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:24:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:24:07,330 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 13:24:07,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:24:07,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:24:07,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:24:07,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:24:07,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:24:07,331 INFO L87 Difference]: Start difference. First operand 463228 states and 701598 transitions. Second operand 4 states. [2019-09-08 13:25:10,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:25:10,740 INFO L93 Difference]: Finished difference Result 1326476 states and 2007825 transitions. [2019-09-08 13:25:10,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:25:10,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-09-08 13:25:10,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:25:11,960 INFO L225 Difference]: With dead ends: 1326476 [2019-09-08 13:25:11,960 INFO L226 Difference]: Without dead ends: 867087 [2019-09-08 13:25:12,285 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 13:25:12,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867087 states. [2019-09-08 13:26:03,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867087 to 463850. [2019-09-08 13:26:03,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463850 states. [2019-09-08 13:26:03,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463850 states to 463850 states and 702588 transitions. [2019-09-08 13:26:03,819 INFO L78 Accepts]: Start accepts. Automaton has 463850 states and 702588 transitions. Word has length 324 [2019-09-08 13:26:03,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:03,819 INFO L475 AbstractCegarLoop]: Abstraction has 463850 states and 702588 transitions. [2019-09-08 13:26:03,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:26:03,820 INFO L276 IsEmpty]: Start isEmpty. Operand 463850 states and 702588 transitions. [2019-09-08 13:26:04,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 13:26:04,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:04,071 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] [2019-09-08 13:26:04,072 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:04,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:04,072 INFO L82 PathProgramCache]: Analyzing trace with hash 238219988, now seen corresponding path program 1 times [2019-09-08 13:26:04,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:04,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:04,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:04,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:04,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:04,478 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 13:26:04,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:04,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:26:04,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:26:04,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:26:04,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:26:04,480 INFO L87 Difference]: Start difference. First operand 463850 states and 702588 transitions. Second operand 4 states. [2019-09-08 13:26:42,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:42,584 INFO L93 Difference]: Finished difference Result 881689 states and 1334741 transitions. [2019-09-08 13:26:42,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:26:42,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2019-09-08 13:26:42,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:43,153 INFO L225 Difference]: With dead ends: 881689 [2019-09-08 13:26:43,153 INFO L226 Difference]: Without dead ends: 423553 [2019-09-08 13:26:43,996 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 13:26:44,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423553 states. [2019-09-08 13:27:20,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423553 to 422945. [2019-09-08 13:27:20,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422945 states. [2019-09-08 13:27:20,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422945 states to 422945 states and 640268 transitions. [2019-09-08 13:27:20,883 INFO L78 Accepts]: Start accepts. Automaton has 422945 states and 640268 transitions. Word has length 326 [2019-09-08 13:27:20,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:27:20,883 INFO L475 AbstractCegarLoop]: Abstraction has 422945 states and 640268 transitions. [2019-09-08 13:27:20,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:27:20,883 INFO L276 IsEmpty]: Start isEmpty. Operand 422945 states and 640268 transitions. [2019-09-08 13:27:21,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 13:27:21,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:27:21,134 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] [2019-09-08 13:27:21,134 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:27:21,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:27:21,135 INFO L82 PathProgramCache]: Analyzing trace with hash 361274255, now seen corresponding path program 1 times [2019-09-08 13:27:21,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:27:21,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:27:21,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:21,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:27:21,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:27:21,634 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 13:27:21,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:27:21,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:27:21,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:27:21,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:27:21,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:27:21,636 INFO L87 Difference]: Start difference. First operand 422945 states and 640268 transitions. Second operand 8 states. [2019-09-08 13:28:45,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:28:45,494 INFO L93 Difference]: Finished difference Result 1370690 states and 2109831 transitions. [2019-09-08 13:28:45,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 13:28:45,495 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 330 [2019-09-08 13:28:45,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:28:47,127 INFO L225 Difference]: With dead ends: 1370690 [2019-09-08 13:28:47,128 INFO L226 Difference]: Without dead ends: 960878 [2019-09-08 13:28:47,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-08 13:28:48,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960878 states. [2019-09-08 13:29:56,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960878 to 578469. [2019-09-08 13:29:56,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578469 states. [2019-09-08 13:29:57,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578469 states to 578469 states and 867113 transitions. [2019-09-08 13:29:57,353 INFO L78 Accepts]: Start accepts. Automaton has 578469 states and 867113 transitions. Word has length 330 [2019-09-08 13:29:57,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:57,354 INFO L475 AbstractCegarLoop]: Abstraction has 578469 states and 867113 transitions. [2019-09-08 13:29:57,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 13:29:57,354 INFO L276 IsEmpty]: Start isEmpty. Operand 578469 states and 867113 transitions. [2019-09-08 13:29:57,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 13:29:57,635 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:57,635 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] [2019-09-08 13:29:57,636 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:57,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:57,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1161533927, now seen corresponding path program 1 times [2019-09-08 13:29:57,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:57,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:57,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:57,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:57,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:58,226 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 13:29:58,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:58,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:29:58,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:29:58,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:29:58,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:29:58,229 INFO L87 Difference]: Start difference. First operand 578469 states and 867113 transitions. Second operand 4 states. [2019-09-08 13:31:42,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:42,218 INFO L93 Difference]: Finished difference Result 1685296 states and 2524012 transitions. [2019-09-08 13:31:42,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:31:42,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 330 [2019-09-08 13:31:42,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:44,482 INFO L225 Difference]: With dead ends: 1685296 [2019-09-08 13:31:44,483 INFO L226 Difference]: Without dead ends: 1107045 [2019-09-08 13:31:44,877 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 13:31:45,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107045 states.