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.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:29:30,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:29:30,190 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:29:30,202 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:29:30,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:29:30,204 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:29:30,205 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:29:30,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:29:30,209 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:29:30,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:29:30,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:29:30,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:29:30,212 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:29:30,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:29:30,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:29:30,216 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:29:30,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:29:30,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:29:30,219 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:29:30,221 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:29:30,223 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:29:30,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:29:30,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:29:30,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:29:30,230 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:29:30,231 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:29:30,231 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:29:30,232 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:29:30,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:29:30,233 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:29:30,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:29:30,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:29:30,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:29:30,236 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:29:30,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:29:30,237 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:29:30,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:29:30,238 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:29:30,238 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:29:30,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:29:30,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:29:30,241 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:29:30,261 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:29:30,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:29:30,264 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:29:30,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:29:30,264 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:29:30,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:29:30,265 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:29:30,266 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:29:30,266 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:29:30,266 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:29:30,267 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:29:30,267 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:29:30,267 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:29:30,267 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:29:30,267 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:29:30,268 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:29:30,268 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:29:30,269 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:29:30,269 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:29:30,270 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:29:30,270 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:29:30,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:29:30,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:29:30,271 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:29:30,271 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:29:30,271 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:29:30,272 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:29:30,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:29:30,272 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:29:30,326 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:29:30,344 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:29:30,348 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:29:30,350 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:29:30,350 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:29:30,351 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.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 13:29:30,426 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e72af186/3083a3cf910347039521a79bc3a5e0dc/FLAGb52078708 [2019-09-08 13:29:31,046 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:29:31,049 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 13:29:31,077 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e72af186/3083a3cf910347039521a79bc3a5e0dc/FLAGb52078708 [2019-09-08 13:29:31,244 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e72af186/3083a3cf910347039521a79bc3a5e0dc [2019-09-08 13:29:31,255 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:29:31,256 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:29:31,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:29:31,257 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:29:31,260 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:29:31,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:29:31" (1/1) ... [2019-09-08 13:29:31,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@300edefc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:31, skipping insertion in model container [2019-09-08 13:29:31,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:29:31" (1/1) ... [2019-09-08 13:29:31,271 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:29:31,459 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:29:32,885 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:29:32,904 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:29:33,938 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:29:33,990 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:29:33,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:33 WrapperNode [2019-09-08 13:29:33,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:29:33,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:29:33,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:29:33,994 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:29:34,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:33" (1/1) ... [2019-09-08 13:29:34,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:33" (1/1) ... [2019-09-08 13:29:34,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:33" (1/1) ... [2019-09-08 13:29:34,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:33" (1/1) ... [2019-09-08 13:29:34,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:33" (1/1) ... [2019-09-08 13:29:34,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:33" (1/1) ... [2019-09-08 13:29:34,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:33" (1/1) ... [2019-09-08 13:29:34,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:29:34,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:29:34,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:29:34,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:29:34,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:33" (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:29:34,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:29:34,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:29:34,303 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:29:34,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:29:34,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:29:34,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 13:29:34,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:29:34,305 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:29:34,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:29:34,306 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:29:34,306 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:29:34,306 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:29:34,307 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:29:34,307 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:29:34,308 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:29:34,308 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:29:34,311 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:29:34,311 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:29:34,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:29:34,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:29:37,782 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:29:37,782 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:29:37,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:29:37 BoogieIcfgContainer [2019-09-08 13:29:37,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:29:37,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:29:37,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:29:37,790 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:29:37,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:29:31" (1/3) ... [2019-09-08 13:29:37,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b2b003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:29:37, skipping insertion in model container [2019-09-08 13:29:37,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:33" (2/3) ... [2019-09-08 13:29:37,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b2b003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:29:37, skipping insertion in model container [2019-09-08 13:29:37,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:29:37" (3/3) ... [2019-09-08 13:29:37,797 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 13:29:37,808 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:29:37,836 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-09-08 13:29:37,860 INFO L252 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-09-08 13:29:37,913 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:29:37,913 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:29:37,914 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:29:37,914 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:29:37,914 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:29:37,914 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:29:37,914 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:29:37,914 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:29:37,915 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:29:37,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states. [2019-09-08 13:29:38,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 13:29:38,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:38,008 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:29:38,012 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:38,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:38,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1892590216, now seen corresponding path program 1 times [2019-09-08 13:29:38,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:38,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:38,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:38,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:38,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:39,002 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:39,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:39,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:39,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:39,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:39,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:39,026 INFO L87 Difference]: Start difference. First operand 1027 states. Second operand 3 states. [2019-09-08 13:29:39,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:39,491 INFO L93 Difference]: Finished difference Result 1795 states and 3185 transitions. [2019-09-08 13:29:39,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:39,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-09-08 13:29:39,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:39,533 INFO L225 Difference]: With dead ends: 1795 [2019-09-08 13:29:39,533 INFO L226 Difference]: Without dead ends: 1495 [2019-09-08 13:29:39,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:39,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2019-09-08 13:29:39,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1493. [2019-09-08 13:29:39,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1493 states. [2019-09-08 13:29:39,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 2282 transitions. [2019-09-08 13:29:39,706 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 2282 transitions. Word has length 327 [2019-09-08 13:29:39,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:39,708 INFO L475 AbstractCegarLoop]: Abstraction has 1493 states and 2282 transitions. [2019-09-08 13:29:39,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:39,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 2282 transitions. [2019-09-08 13:29:39,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 13:29:39,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:39,717 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:29:39,717 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:39,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:39,718 INFO L82 PathProgramCache]: Analyzing trace with hash 254890306, now seen corresponding path program 1 times [2019-09-08 13:29:39,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:39,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:39,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:39,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:39,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:40,069 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:40,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:40,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:40,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:40,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:40,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:40,076 INFO L87 Difference]: Start difference. First operand 1493 states and 2282 transitions. Second operand 3 states. [2019-09-08 13:29:40,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:40,476 INFO L93 Difference]: Finished difference Result 2878 states and 4455 transitions. [2019-09-08 13:29:40,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:40,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-09-08 13:29:40,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:40,494 INFO L225 Difference]: With dead ends: 2878 [2019-09-08 13:29:40,494 INFO L226 Difference]: Without dead ends: 2459 [2019-09-08 13:29:40,497 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:29:40,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2459 states. [2019-09-08 13:29:40,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2459 to 2457. [2019-09-08 13:29:40,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-09-08 13:29:40,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3781 transitions. [2019-09-08 13:29:40,594 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3781 transitions. Word has length 327 [2019-09-08 13:29:40,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:40,596 INFO L475 AbstractCegarLoop]: Abstraction has 2457 states and 3781 transitions. [2019-09-08 13:29:40,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:40,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3781 transitions. [2019-09-08 13:29:40,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 13:29:40,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:40,606 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:29:40,606 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:40,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:40,607 INFO L82 PathProgramCache]: Analyzing trace with hash -629035401, now seen corresponding path program 1 times [2019-09-08 13:29:40,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:40,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:40,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:40,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:40,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:41,459 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:41,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:41,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:29:41,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:29:41,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:29:41,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:29:41,461 INFO L87 Difference]: Start difference. First operand 2457 states and 3781 transitions. Second operand 4 states. [2019-09-08 13:29:41,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:41,830 INFO L93 Difference]: Finished difference Result 7259 states and 11158 transitions. [2019-09-08 13:29:41,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:29:41,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 327 [2019-09-08 13:29:41,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:41,863 INFO L225 Difference]: With dead ends: 7259 [2019-09-08 13:29:41,863 INFO L226 Difference]: Without dead ends: 4817 [2019-09-08 13:29:41,872 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:29:41,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4817 states. [2019-09-08 13:29:42,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4817 to 4689. [2019-09-08 13:29:42,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4689 states. [2019-09-08 13:29:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4689 states to 4689 states and 7207 transitions. [2019-09-08 13:29:42,099 INFO L78 Accepts]: Start accepts. Automaton has 4689 states and 7207 transitions. Word has length 327 [2019-09-08 13:29:42,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:42,100 INFO L475 AbstractCegarLoop]: Abstraction has 4689 states and 7207 transitions. [2019-09-08 13:29:42,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:29:42,100 INFO L276 IsEmpty]: Start isEmpty. Operand 4689 states and 7207 transitions. [2019-09-08 13:29:42,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-08 13:29:42,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:42,115 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] [2019-09-08 13:29:42,115 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:42,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:42,116 INFO L82 PathProgramCache]: Analyzing trace with hash 488411244, now seen corresponding path program 1 times [2019-09-08 13:29:42,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:42,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:42,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:42,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:42,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:42,290 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:42,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:42,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:42,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:42,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:42,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:42,292 INFO L87 Difference]: Start difference. First operand 4689 states and 7207 transitions. Second operand 3 states. [2019-09-08 13:29:42,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:42,750 INFO L93 Difference]: Finished difference Result 14022 states and 21550 transitions. [2019-09-08 13:29:42,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:42,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2019-09-08 13:29:42,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:42,804 INFO L225 Difference]: With dead ends: 14022 [2019-09-08 13:29:42,805 INFO L226 Difference]: Without dead ends: 9358 [2019-09-08 13:29:42,817 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:29:42,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9358 states. [2019-09-08 13:29:43,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9358 to 4702. [2019-09-08 13:29:43,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4702 states. [2019-09-08 13:29:43,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4702 states to 4702 states and 7226 transitions. [2019-09-08 13:29:43,198 INFO L78 Accepts]: Start accepts. Automaton has 4702 states and 7226 transitions. Word has length 329 [2019-09-08 13:29:43,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:43,198 INFO L475 AbstractCegarLoop]: Abstraction has 4702 states and 7226 transitions. [2019-09-08 13:29:43,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:43,199 INFO L276 IsEmpty]: Start isEmpty. Operand 4702 states and 7226 transitions. [2019-09-08 13:29:43,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-08 13:29:43,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:43,214 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] [2019-09-08 13:29:43,215 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:43,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:43,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1617017327, now seen corresponding path program 1 times [2019-09-08 13:29:43,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:43,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:43,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:43,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:43,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:43,480 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:43,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:43,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:43,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:43,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:43,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:43,483 INFO L87 Difference]: Start difference. First operand 4702 states and 7226 transitions. Second operand 3 states. [2019-09-08 13:29:43,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:43,994 INFO L93 Difference]: Finished difference Result 13776 states and 21119 transitions. [2019-09-08 13:29:43,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:43,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2019-09-08 13:29:43,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:44,042 INFO L225 Difference]: With dead ends: 13776 [2019-09-08 13:29:44,042 INFO L226 Difference]: Without dead ends: 9216 [2019-09-08 13:29:44,054 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:29:44,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9216 states. [2019-09-08 13:29:44,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 9088. [2019-09-08 13:29:44,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9088 states. [2019-09-08 13:29:44,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9088 states to 9088 states and 13916 transitions. [2019-09-08 13:29:44,471 INFO L78 Accepts]: Start accepts. Automaton has 9088 states and 13916 transitions. Word has length 329 [2019-09-08 13:29:44,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:44,472 INFO L475 AbstractCegarLoop]: Abstraction has 9088 states and 13916 transitions. [2019-09-08 13:29:44,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:44,472 INFO L276 IsEmpty]: Start isEmpty. Operand 9088 states and 13916 transitions. [2019-09-08 13:29:44,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 13:29:44,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:44,498 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:44,499 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:44,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:44,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1430036047, now seen corresponding path program 1 times [2019-09-08 13:29:44,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:44,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:44,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:44,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:44,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:44,665 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:44,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:44,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:44,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:44,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:44,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:44,668 INFO L87 Difference]: Start difference. First operand 9088 states and 13916 transitions. Second operand 3 states. [2019-09-08 13:29:45,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:45,429 INFO L93 Difference]: Finished difference Result 27151 states and 41561 transitions. [2019-09-08 13:29:45,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:45,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-08 13:29:45,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:45,498 INFO L225 Difference]: With dead ends: 27151 [2019-09-08 13:29:45,499 INFO L226 Difference]: Without dead ends: 18123 [2019-09-08 13:29:45,526 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:29:45,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18123 states. [2019-09-08 13:29:46,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18123 to 9106. [2019-09-08 13:29:46,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9106 states. [2019-09-08 13:29:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9106 states to 9106 states and 13937 transitions. [2019-09-08 13:29:46,067 INFO L78 Accepts]: Start accepts. Automaton has 9106 states and 13937 transitions. Word has length 330 [2019-09-08 13:29:46,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:46,068 INFO L475 AbstractCegarLoop]: Abstraction has 9106 states and 13937 transitions. [2019-09-08 13:29:46,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:46,069 INFO L276 IsEmpty]: Start isEmpty. Operand 9106 states and 13937 transitions. [2019-09-08 13:29:46,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-08 13:29:46,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:46,103 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:29:46,103 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:46,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:46,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1413058346, now seen corresponding path program 1 times [2019-09-08 13:29:46,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:46,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:46,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:46,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:46,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:46,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:46,558 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:46,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:46,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:46,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:46,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:46,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:46,561 INFO L87 Difference]: Start difference. First operand 9106 states and 13937 transitions. Second operand 3 states. [2019-09-08 13:29:47,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:47,220 INFO L93 Difference]: Finished difference Result 25688 states and 39204 transitions. [2019-09-08 13:29:47,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:47,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-09-08 13:29:47,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:47,271 INFO L225 Difference]: With dead ends: 25688 [2019-09-08 13:29:47,272 INFO L226 Difference]: Without dead ends: 16827 [2019-09-08 13:29:47,302 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:29:47,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16827 states. [2019-09-08 13:29:48,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16827 to 16699. [2019-09-08 13:29:48,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16699 states. [2019-09-08 13:29:48,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16699 states to 16699 states and 25395 transitions. [2019-09-08 13:29:48,266 INFO L78 Accepts]: Start accepts. Automaton has 16699 states and 25395 transitions. Word has length 331 [2019-09-08 13:29:48,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:48,266 INFO L475 AbstractCegarLoop]: Abstraction has 16699 states and 25395 transitions. [2019-09-08 13:29:48,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:48,266 INFO L276 IsEmpty]: Start isEmpty. Operand 16699 states and 25395 transitions. [2019-09-08 13:29:48,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-08 13:29:48,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:48,300 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:29:48,300 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:48,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:48,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1317111591, now seen corresponding path program 1 times [2019-09-08 13:29:48,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:48,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:48,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:48,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:48,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:48,676 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:48,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:48,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:29:48,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:29:48,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:29:48,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:29:48,679 INFO L87 Difference]: Start difference. First operand 16699 states and 25395 transitions. Second operand 4 states. [2019-09-08 13:29:50,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:50,342 INFO L93 Difference]: Finished difference Result 48122 states and 72981 transitions. [2019-09-08 13:29:50,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:29:50,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 331 [2019-09-08 13:29:50,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:50,435 INFO L225 Difference]: With dead ends: 48122 [2019-09-08 13:29:50,436 INFO L226 Difference]: Without dead ends: 31963 [2019-09-08 13:29:50,475 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:29:50,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31963 states. [2019-09-08 13:29:51,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31963 to 16934. [2019-09-08 13:29:51,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16934 states. [2019-09-08 13:29:51,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16934 states to 16934 states and 25783 transitions. [2019-09-08 13:29:51,538 INFO L78 Accepts]: Start accepts. Automaton has 16934 states and 25783 transitions. Word has length 331 [2019-09-08 13:29:51,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:51,539 INFO L475 AbstractCegarLoop]: Abstraction has 16934 states and 25783 transitions. [2019-09-08 13:29:51,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:29:51,539 INFO L276 IsEmpty]: Start isEmpty. Operand 16934 states and 25783 transitions. [2019-09-08 13:29:51,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-08 13:29:51,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:51,574 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:29:51,575 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:51,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:51,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1336108137, now seen corresponding path program 1 times [2019-09-08 13:29:51,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:51,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:51,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:51,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:51,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:51,862 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:51,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:51,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:51,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:51,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:51,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:51,864 INFO L87 Difference]: Start difference. First operand 16934 states and 25783 transitions. Second operand 3 states. [2019-09-08 13:29:52,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:52,620 INFO L93 Difference]: Finished difference Result 41063 states and 62931 transitions. [2019-09-08 13:29:52,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:52,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2019-09-08 13:29:52,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:52,696 INFO L225 Difference]: With dead ends: 41063 [2019-09-08 13:29:52,860 INFO L226 Difference]: Without dead ends: 25884 [2019-09-08 13:29:52,891 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:29:52,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25884 states. [2019-09-08 13:29:53,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25884 to 20792. [2019-09-08 13:29:53,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20792 states. [2019-09-08 13:29:53,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20792 states to 20792 states and 32130 transitions. [2019-09-08 13:29:53,675 INFO L78 Accepts]: Start accepts. Automaton has 20792 states and 32130 transitions. Word has length 333 [2019-09-08 13:29:53,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:53,675 INFO L475 AbstractCegarLoop]: Abstraction has 20792 states and 32130 transitions. [2019-09-08 13:29:53,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:53,675 INFO L276 IsEmpty]: Start isEmpty. Operand 20792 states and 32130 transitions. [2019-09-08 13:29:53,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-08 13:29:53,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:53,719 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:29:53,720 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:53,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:53,720 INFO L82 PathProgramCache]: Analyzing trace with hash -593945102, now seen corresponding path program 1 times [2019-09-08 13:29:53,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:53,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:53,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:53,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:53,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:53,868 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:53,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:53,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:53,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:53,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:53,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:53,870 INFO L87 Difference]: Start difference. First operand 20792 states and 32130 transitions. Second operand 3 states. [2019-09-08 13:29:55,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:55,177 INFO L93 Difference]: Finished difference Result 60806 states and 93671 transitions. [2019-09-08 13:29:55,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:55,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2019-09-08 13:29:55,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:55,270 INFO L225 Difference]: With dead ends: 60806 [2019-09-08 13:29:55,276 INFO L226 Difference]: Without dead ends: 40817 [2019-09-08 13:29:55,318 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:29:55,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40817 states. [2019-09-08 13:29:57,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40817 to 20896. [2019-09-08 13:29:57,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20896 states. [2019-09-08 13:29:57,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20896 states to 20896 states and 32273 transitions. [2019-09-08 13:29:57,094 INFO L78 Accepts]: Start accepts. Automaton has 20896 states and 32273 transitions. Word has length 333 [2019-09-08 13:29:57,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:57,094 INFO L475 AbstractCegarLoop]: Abstraction has 20896 states and 32273 transitions. [2019-09-08 13:29:57,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:57,094 INFO L276 IsEmpty]: Start isEmpty. Operand 20896 states and 32273 transitions. [2019-09-08 13:29:57,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-08 13:29:57,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:57,137 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:29:57,137 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:57,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:57,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1494978179, now seen corresponding path program 1 times [2019-09-08 13:29:57,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:57,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:57,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:57,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:57,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:57,295 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:57,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:57,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:57,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:57,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:57,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:57,298 INFO L87 Difference]: Start difference. First operand 20896 states and 32273 transitions. Second operand 3 states. [2019-09-08 13:29:58,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:58,875 INFO L93 Difference]: Finished difference Result 60938 states and 93837 transitions. [2019-09-08 13:29:58,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:58,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 334 [2019-09-08 13:29:58,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:58,939 INFO L225 Difference]: With dead ends: 60938 [2019-09-08 13:29:58,940 INFO L226 Difference]: Without dead ends: 40942 [2019-09-08 13:29:58,973 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:29:59,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40942 states. [2019-09-08 13:30:00,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40942 to 21021. [2019-09-08 13:30:00,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21021 states. [2019-09-08 13:30:00,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21021 states to 21021 states and 32419 transitions. [2019-09-08 13:30:00,183 INFO L78 Accepts]: Start accepts. Automaton has 21021 states and 32419 transitions. Word has length 334 [2019-09-08 13:30:00,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:00,184 INFO L475 AbstractCegarLoop]: Abstraction has 21021 states and 32419 transitions. [2019-09-08 13:30:00,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:30:00,184 INFO L276 IsEmpty]: Start isEmpty. Operand 21021 states and 32419 transitions. [2019-09-08 13:30:00,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-09-08 13:30:00,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:00,200 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:30:00,200 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:00,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:00,201 INFO L82 PathProgramCache]: Analyzing trace with hash -639845697, now seen corresponding path program 1 times [2019-09-08 13:30:00,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:00,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:00,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:00,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:00,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:00,382 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:30:00,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:00,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:30:00,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:30:00,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:30:00,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:00,384 INFO L87 Difference]: Start difference. First operand 21021 states and 32419 transitions. Second operand 3 states. [2019-09-08 13:30:01,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:30:01,666 INFO L93 Difference]: Finished difference Result 51177 states and 79618 transitions. [2019-09-08 13:30:01,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:30:01,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-09-08 13:30:01,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:30:01,718 INFO L225 Difference]: With dead ends: 51177 [2019-09-08 13:30:01,718 INFO L226 Difference]: Without dead ends: 32452 [2019-09-08 13:30:01,751 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:30:01,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32452 states. [2019-09-08 13:30:03,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32452 to 27917. [2019-09-08 13:30:03,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27917 states. [2019-09-08 13:30:03,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27917 states to 27917 states and 43749 transitions. [2019-09-08 13:30:03,865 INFO L78 Accepts]: Start accepts. Automaton has 27917 states and 43749 transitions. Word has length 335 [2019-09-08 13:30:03,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:03,865 INFO L475 AbstractCegarLoop]: Abstraction has 27917 states and 43749 transitions. [2019-09-08 13:30:03,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:30:03,866 INFO L276 IsEmpty]: Start isEmpty. Operand 27917 states and 43749 transitions. [2019-09-08 13:30:03,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-09-08 13:30:03,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:03,879 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:30:03,879 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:03,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:03,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1059276511, now seen corresponding path program 1 times [2019-09-08 13:30:03,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:03,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:03,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:03,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:03,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:04,216 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:30:04,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:04,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:30:04,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:30:04,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:30:04,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:30:04,218 INFO L87 Difference]: Start difference. First operand 27917 states and 43749 transitions. Second operand 4 states. [2019-09-08 13:30:05,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:30:05,415 INFO L93 Difference]: Finished difference Result 53115 states and 83139 transitions. [2019-09-08 13:30:05,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:30:05,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 335 [2019-09-08 13:30:05,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:30:05,444 INFO L225 Difference]: With dead ends: 53115 [2019-09-08 13:30:05,445 INFO L226 Difference]: Without dead ends: 26061 [2019-09-08 13:30:05,469 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:30:05,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26061 states. [2019-09-08 13:30:06,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26061 to 26041. [2019-09-08 13:30:06,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26041 states. [2019-09-08 13:30:06,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26041 states to 26041 states and 40807 transitions. [2019-09-08 13:30:06,526 INFO L78 Accepts]: Start accepts. Automaton has 26041 states and 40807 transitions. Word has length 335 [2019-09-08 13:30:06,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:06,526 INFO L475 AbstractCegarLoop]: Abstraction has 26041 states and 40807 transitions. [2019-09-08 13:30:06,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:30:06,527 INFO L276 IsEmpty]: Start isEmpty. Operand 26041 states and 40807 transitions. [2019-09-08 13:30:06,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-08 13:30:06,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:06,541 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:30:06,542 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:06,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:06,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1893973212, now seen corresponding path program 1 times [2019-09-08 13:30:06,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:06,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:06,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:06,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:06,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:06,853 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:30:06,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:06,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:30:06,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:30:06,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:30:06,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:06,857 INFO L87 Difference]: Start difference. First operand 26041 states and 40807 transitions. Second operand 3 states. [2019-09-08 13:30:09,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:30:09,238 INFO L93 Difference]: Finished difference Result 62934 states and 100060 transitions. [2019-09-08 13:30:09,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:30:09,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-09-08 13:30:09,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:30:09,320 INFO L225 Difference]: With dead ends: 62934 [2019-09-08 13:30:09,320 INFO L226 Difference]: Without dead ends: 48811 [2019-09-08 13:30:09,356 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:30:09,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48811 states. [2019-09-08 13:30:12,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48811 to 48755. [2019-09-08 13:30:12,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48755 states. [2019-09-08 13:30:12,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48755 states to 48755 states and 76591 transitions. [2019-09-08 13:30:12,512 INFO L78 Accepts]: Start accepts. Automaton has 48755 states and 76591 transitions. Word has length 336 [2019-09-08 13:30:12,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:12,513 INFO L475 AbstractCegarLoop]: Abstraction has 48755 states and 76591 transitions. [2019-09-08 13:30:12,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:30:12,513 INFO L276 IsEmpty]: Start isEmpty. Operand 48755 states and 76591 transitions. [2019-09-08 13:30:12,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-08 13:30:12,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:12,536 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:30:12,536 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:12,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:12,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1894311836, now seen corresponding path program 1 times [2019-09-08 13:30:12,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:12,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:12,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:12,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:12,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:12,991 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:30:12,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:12,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:30:12,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:30:12,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:30:12,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:30:12,996 INFO L87 Difference]: Start difference. First operand 48755 states and 76591 transitions. Second operand 9 states. [2019-09-08 13:30:37,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:30:37,783 INFO L93 Difference]: Finished difference Result 366678 states and 582451 transitions. [2019-09-08 13:30:37,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 13:30:37,784 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 336 [2019-09-08 13:30:37,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:30:38,297 INFO L225 Difference]: With dead ends: 366678 [2019-09-08 13:30:38,297 INFO L226 Difference]: Without dead ends: 346851 [2019-09-08 13:30:38,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=352, Invalid=1054, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 13:30:38,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346851 states. [2019-09-08 13:30:50,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346851 to 149025. [2019-09-08 13:30:50,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149025 states. [2019-09-08 13:30:51,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149025 states to 149025 states and 234492 transitions. [2019-09-08 13:30:51,260 INFO L78 Accepts]: Start accepts. Automaton has 149025 states and 234492 transitions. Word has length 336 [2019-09-08 13:30:51,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:51,260 INFO L475 AbstractCegarLoop]: Abstraction has 149025 states and 234492 transitions. [2019-09-08 13:30:51,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:30:51,260 INFO L276 IsEmpty]: Start isEmpty. Operand 149025 states and 234492 transitions. [2019-09-08 13:30:51,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-08 13:30:51,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:51,322 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:30:51,322 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:51,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:51,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1418806943, now seen corresponding path program 1 times [2019-09-08 13:30:51,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:51,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:51,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:51,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:51,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:51,880 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:30:51,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:51,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:30:51,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:30:51,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:30:51,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:30:51,885 INFO L87 Difference]: Start difference. First operand 149025 states and 234492 transitions. Second operand 9 states. [2019-09-08 13:31:09,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:09,615 INFO L93 Difference]: Finished difference Result 287802 states and 456632 transitions. [2019-09-08 13:31:09,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 13:31:09,615 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 336 [2019-09-08 13:31:09,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:09,964 INFO L225 Difference]: With dead ends: 287802 [2019-09-08 13:31:09,964 INFO L226 Difference]: Without dead ends: 201073 [2019-09-08 13:31:10,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-09-08 13:31:10,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201073 states. [2019-09-08 13:31:16,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201073 to 65846. [2019-09-08 13:31:16,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65846 states. [2019-09-08 13:31:16,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65846 states to 65846 states and 101389 transitions. [2019-09-08 13:31:16,239 INFO L78 Accepts]: Start accepts. Automaton has 65846 states and 101389 transitions. Word has length 336 [2019-09-08 13:31:16,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:16,239 INFO L475 AbstractCegarLoop]: Abstraction has 65846 states and 101389 transitions. [2019-09-08 13:31:16,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:31:16,240 INFO L276 IsEmpty]: Start isEmpty. Operand 65846 states and 101389 transitions. [2019-09-08 13:31:16,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-08 13:31:16,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:16,263 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:31:16,264 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:16,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:16,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1191835422, now seen corresponding path program 1 times [2019-09-08 13:31:16,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:16,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:16,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:16,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:16,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:16,809 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:31:16,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:16,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:31:16,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:31:16,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:31:16,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:31:16,811 INFO L87 Difference]: Start difference. First operand 65846 states and 101389 transitions. Second operand 4 states. [2019-09-08 13:31:27,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:27,448 INFO L93 Difference]: Finished difference Result 194311 states and 299117 transitions. [2019-09-08 13:31:27,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:31:27,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 336 [2019-09-08 13:31:27,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:27,614 INFO L225 Difference]: With dead ends: 194311 [2019-09-08 13:31:27,615 INFO L226 Difference]: Without dead ends: 128537 [2019-09-08 13:31:27,671 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:27,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128537 states. [2019-09-08 13:31:39,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128537 to 128346. [2019-09-08 13:31:39,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128346 states. [2019-09-08 13:31:39,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128346 states to 128346 states and 196773 transitions. [2019-09-08 13:31:39,848 INFO L78 Accepts]: Start accepts. Automaton has 128346 states and 196773 transitions. Word has length 336 [2019-09-08 13:31:39,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:39,848 INFO L475 AbstractCegarLoop]: Abstraction has 128346 states and 196773 transitions. [2019-09-08 13:31:39,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:31:39,849 INFO L276 IsEmpty]: Start isEmpty. Operand 128346 states and 196773 transitions. [2019-09-08 13:31:39,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-08 13:31:39,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:39,898 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:31:39,899 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:39,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:39,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1214005887, now seen corresponding path program 1 times [2019-09-08 13:31:39,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:39,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:39,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:39,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:39,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:40,150 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:31:40,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:40,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:31:40,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:31:40,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:31:40,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:31:40,152 INFO L87 Difference]: Start difference. First operand 128346 states and 196773 transitions. Second operand 3 states. [2019-09-08 13:32:00,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:32:00,439 INFO L93 Difference]: Finished difference Result 377866 states and 579341 transitions. [2019-09-08 13:32:00,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:32:00,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 338 [2019-09-08 13:32:00,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:32:00,821 INFO L225 Difference]: With dead ends: 377866 [2019-09-08 13:32:00,822 INFO L226 Difference]: Without dead ends: 250769 [2019-09-08 13:32:00,955 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:32:01,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250769 states. [2019-09-08 13:32:24,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250769 to 250586. [2019-09-08 13:32:24,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250586 states. [2019-09-08 13:32:24,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250586 states to 250586 states and 382846 transitions. [2019-09-08 13:32:24,569 INFO L78 Accepts]: Start accepts. Automaton has 250586 states and 382846 transitions. Word has length 338 [2019-09-08 13:32:24,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:32:24,569 INFO L475 AbstractCegarLoop]: Abstraction has 250586 states and 382846 transitions. [2019-09-08 13:32:24,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:32:24,569 INFO L276 IsEmpty]: Start isEmpty. Operand 250586 states and 382846 transitions. [2019-09-08 13:32:24,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-09-08 13:32:24,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:32:24,670 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:32:24,670 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:32:24,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:32:24,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1178320272, now seen corresponding path program 1 times [2019-09-08 13:32:24,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:32:24,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:32:24,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:24,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:32:24,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:32:24,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:32:24,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:32:24,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:32:24,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:32:24,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:32:24,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:32:24,868 INFO L87 Difference]: Start difference. First operand 250586 states and 382846 transitions. Second operand 3 states. [2019-09-08 13:33:05,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:33:05,486 INFO L93 Difference]: Finished difference Result 661488 states and 1017903 transitions. [2019-09-08 13:33:05,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:33:05,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 339 [2019-09-08 13:33:05,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:33:06,166 INFO L225 Difference]: With dead ends: 661488 [2019-09-08 13:33:06,166 INFO L226 Difference]: Without dead ends: 418063 [2019-09-08 13:33:06,401 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:33:06,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418063 states. [2019-09-08 13:33:43,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418063 to 372826. [2019-09-08 13:33:43,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372826 states. [2019-09-08 13:33:44,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372826 states to 372826 states and 575094 transitions. [2019-09-08 13:33:44,352 INFO L78 Accepts]: Start accepts. Automaton has 372826 states and 575094 transitions. Word has length 339 [2019-09-08 13:33:44,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:33:44,352 INFO L475 AbstractCegarLoop]: Abstraction has 372826 states and 575094 transitions. [2019-09-08 13:33:44,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:33:44,352 INFO L276 IsEmpty]: Start isEmpty. Operand 372826 states and 575094 transitions. [2019-09-08 13:33:44,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-08 13:33:44,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:33:44,460 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:33:44,460 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:33:44,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:33:44,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1095505820, now seen corresponding path program 1 times [2019-09-08 13:33:44,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:33:44,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:33:44,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:33:44,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:33:44,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:33:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:33:44,689 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:33:44,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:33:44,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:33:44,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:33:44,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:33:44,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:33:44,691 INFO L87 Difference]: Start difference. First operand 372826 states and 575094 transitions. Second operand 3 states. [2019-09-08 13:34:56,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:34:56,114 INFO L93 Difference]: Finished difference Result 1061588 states and 1636212 transitions. [2019-09-08 13:34:56,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:34:56,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 340 [2019-09-08 13:34:56,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:34:57,322 INFO L225 Difference]: With dead ends: 1061588 [2019-09-08 13:34:57,323 INFO L226 Difference]: Without dead ends: 690109 [2019-09-08 13:34:57,656 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:34:58,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690109 states. [2019-09-08 13:36:16,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690109 to 689934. [2019-09-08 13:36:16,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689934 states. [2019-09-08 13:36:17,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689934 states to 689934 states and 1057503 transitions. [2019-09-08 13:36:17,985 INFO L78 Accepts]: Start accepts. Automaton has 689934 states and 1057503 transitions. Word has length 340 [2019-09-08 13:36:17,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:36:17,985 INFO L475 AbstractCegarLoop]: Abstraction has 689934 states and 1057503 transitions. [2019-09-08 13:36:17,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:36:17,985 INFO L276 IsEmpty]: Start isEmpty. Operand 689934 states and 1057503 transitions. [2019-09-08 13:36:19,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-08 13:36:19,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:36:19,396 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:36:19,396 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:36:19,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:36:19,397 INFO L82 PathProgramCache]: Analyzing trace with hash 496932409, now seen corresponding path program 1 times [2019-09-08 13:36:19,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:36:19,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:36:19,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:36:19,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:36:19,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:36:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:36:19,698 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:36:19,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:36:19,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:36:19,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:36:19,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:36:19,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:36:19,700 INFO L87 Difference]: Start difference. First operand 689934 states and 1057503 transitions. Second operand 4 states. [2019-09-08 13:38:35,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:38:35,618 INFO L93 Difference]: Finished difference Result 1923688 states and 2945024 transitions. [2019-09-08 13:38:35,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:38:35,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 340 [2019-09-08 13:38:35,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:38:38,087 INFO L225 Difference]: With dead ends: 1923688 [2019-09-08 13:38:38,087 INFO L226 Difference]: Without dead ends: 1237046 [2019-09-08 13:38:38,679 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:38:39,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237046 states. [2019-09-08 13:40:18,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237046 to 676947. [2019-09-08 13:40:18,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676947 states. [2019-09-08 13:40:20,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676947 states to 676947 states and 1037189 transitions. [2019-09-08 13:40:20,047 INFO L78 Accepts]: Start accepts. Automaton has 676947 states and 1037189 transitions. Word has length 340 [2019-09-08 13:40:20,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:20,047 INFO L475 AbstractCegarLoop]: Abstraction has 676947 states and 1037189 transitions. [2019-09-08 13:40:20,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:40:20,047 INFO L276 IsEmpty]: Start isEmpty. Operand 676947 states and 1037189 transitions. [2019-09-08 13:40:20,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-09-08 13:40:20,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:20,230 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:40:20,231 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:20,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:20,231 INFO L82 PathProgramCache]: Analyzing trace with hash 518077033, now seen corresponding path program 1 times [2019-09-08 13:40:20,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:20,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:20,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:20,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:20,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:20,395 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:40:20,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:20,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:40:20,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:40:20,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:40:20,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:40:20,397 INFO L87 Difference]: Start difference. First operand 676947 states and 1037189 transitions. Second operand 3 states.