./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d9beabfbef08942bed8546006d030b50d9687cbf ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 00:46:54,164 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:46:54,167 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:46:54,239 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:46:54,240 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:46:54,250 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:46:54,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:46:54,257 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:46:54,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:46:54,268 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:46:54,269 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:46:54,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:46:54,272 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:46:54,278 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:46:54,280 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:46:54,282 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:46:54,284 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:46:54,288 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:46:54,292 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:46:54,301 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:46:54,304 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:46:54,306 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:46:54,308 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:46:54,310 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:46:54,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:46:54,321 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:46:54,322 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:46:54,324 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:46:54,325 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:46:54,327 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:46:54,327 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:46:54,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:46:54,332 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:46:54,333 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:46:54,334 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:46:54,335 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:46:54,336 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:46:54,337 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:46:54,337 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:46:54,338 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:46:54,339 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:46:54,342 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-30 00:46:54,387 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:46:54,387 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:46:54,390 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:46:54,390 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:46:54,390 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:46:54,391 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:46:54,391 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 00:46:54,391 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:46:54,392 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 00:46:54,392 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:46:54,393 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 00:46:54,394 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 00:46:54,394 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 00:46:54,394 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 00:46:54,394 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 00:46:54,395 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:46:54,395 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 00:46:54,395 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:46:54,396 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:46:54,396 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 00:46:54,396 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 00:46:54,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:46:54,397 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:46:54,397 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 00:46:54,397 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 00:46:54,398 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:46:54,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 00:46:54,398 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 00:46:54,398 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:46:54,399 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d9beabfbef08942bed8546006d030b50d9687cbf [2020-11-30 00:46:54,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:46:54,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:46:54,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:46:54,800 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:46:54,803 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:46:54,806 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2020-11-30 00:46:54,916 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/data/6049d2270/405af5784bb749209b4b494da3797040/FLAG0a85188d8 [2020-11-30 00:46:55,475 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:46:55,476 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2020-11-30 00:46:55,502 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/data/6049d2270/405af5784bb749209b4b494da3797040/FLAG0a85188d8 [2020-11-30 00:46:55,784 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/data/6049d2270/405af5784bb749209b4b494da3797040 [2020-11-30 00:46:55,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:46:55,788 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 00:46:55,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:46:55,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:46:55,794 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:46:55,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:46:55" (1/1) ... [2020-11-30 00:46:55,798 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@342a6528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:55, skipping insertion in model container [2020-11-30 00:46:55,798 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:46:55" (1/1) ... [2020-11-30 00:46:55,806 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:46:55,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:46:56,173 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:46:56,185 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:46:56,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:46:56,305 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:46:56,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:56 WrapperNode [2020-11-30 00:46:56,306 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:46:56,307 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 00:46:56,308 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 00:46:56,308 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 00:46:56,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:56" (1/1) ... [2020-11-30 00:46:56,333 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:56" (1/1) ... [2020-11-30 00:46:56,435 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 00:46:56,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:46:56,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:46:56,438 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:46:56,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:56" (1/1) ... [2020-11-30 00:46:56,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:56" (1/1) ... [2020-11-30 00:46:56,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:56" (1/1) ... [2020-11-30 00:46:56,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:56" (1/1) ... [2020-11-30 00:46:56,494 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:56" (1/1) ... [2020-11-30 00:46:56,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:56" (1/1) ... [2020-11-30 00:46:56,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:56" (1/1) ... [2020-11-30 00:46:56,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:46:56,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:46:56,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:46:56,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:46:56,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/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 [2020-11-30 00:46:56,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:46:56,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 00:46:56,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:46:56,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:46:58,893 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:46:58,894 INFO L298 CfgBuilder]: Removed 257 assume(true) statements. [2020-11-30 00:46:58,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:46:58 BoogieIcfgContainer [2020-11-30 00:46:58,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:46:58,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 00:46:58,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 00:46:58,906 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 00:46:58,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 12:46:55" (1/3) ... [2020-11-30 00:46:58,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e7f27f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:46:58, skipping insertion in model container [2020-11-30 00:46:58,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:46:56" (2/3) ... [2020-11-30 00:46:58,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e7f27f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:46:58, skipping insertion in model container [2020-11-30 00:46:58,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:46:58" (3/3) ... [2020-11-30 00:46:58,911 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2020-11-30 00:46:58,928 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 00:46:58,934 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2020-11-30 00:46:58,949 INFO L253 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2020-11-30 00:46:59,001 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 00:46:59,001 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 00:46:59,001 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 00:46:59,002 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:46:59,002 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:46:59,002 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 00:46:59,002 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:46:59,002 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 00:46:59,053 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states. [2020-11-30 00:46:59,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 00:46:59,060 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:46:59,061 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:46:59,062 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:46:59,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:59,069 INFO L82 PathProgramCache]: Analyzing trace with hash 595705480, now seen corresponding path program 1 times [2020-11-30 00:46:59,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:59,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026137867] [2020-11-30 00:46:59,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:46:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:46:59,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:46:59,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026137867] [2020-11-30 00:46:59,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:46:59,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:46:59,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701110791] [2020-11-30 00:46:59,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:46:59,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:46:59,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:46:59,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:46:59,370 INFO L87 Difference]: Start difference. First operand 557 states. Second operand 3 states. [2020-11-30 00:46:59,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:46:59,787 INFO L93 Difference]: Finished difference Result 1279 states and 2091 transitions. [2020-11-30 00:46:59,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:46:59,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-30 00:46:59,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:46:59,814 INFO L225 Difference]: With dead ends: 1279 [2020-11-30 00:46:59,814 INFO L226 Difference]: Without dead ends: 724 [2020-11-30 00:46:59,822 INFO L677 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 [2020-11-30 00:46:59,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2020-11-30 00:46:59,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 456. [2020-11-30 00:46:59,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2020-11-30 00:46:59,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 710 transitions. [2020-11-30 00:46:59,959 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 710 transitions. Word has length 9 [2020-11-30 00:46:59,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:46:59,959 INFO L481 AbstractCegarLoop]: Abstraction has 456 states and 710 transitions. [2020-11-30 00:46:59,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:46:59,961 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 710 transitions. [2020-11-30 00:46:59,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 00:46:59,964 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:46:59,964 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:46:59,964 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 00:46:59,965 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:46:59,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:46:59,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1330220136, now seen corresponding path program 1 times [2020-11-30 00:46:59,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:46:59,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849572611] [2020-11-30 00:46:59,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:00,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:47:00,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849572611] [2020-11-30 00:47:00,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:00,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:47:00,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716614901] [2020-11-30 00:47:00,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:47:00,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:00,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:47:00,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:47:00,115 INFO L87 Difference]: Start difference. First operand 456 states and 710 transitions. Second operand 3 states. [2020-11-30 00:47:00,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:00,211 INFO L93 Difference]: Finished difference Result 1128 states and 1740 transitions. [2020-11-30 00:47:00,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:47:00,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-30 00:47:00,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:00,224 INFO L225 Difference]: With dead ends: 1128 [2020-11-30 00:47:00,224 INFO L226 Difference]: Without dead ends: 674 [2020-11-30 00:47:00,232 INFO L677 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 [2020-11-30 00:47:00,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2020-11-30 00:47:00,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 423. [2020-11-30 00:47:00,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2020-11-30 00:47:00,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 652 transitions. [2020-11-30 00:47:00,260 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 652 transitions. Word has length 10 [2020-11-30 00:47:00,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:00,261 INFO L481 AbstractCegarLoop]: Abstraction has 423 states and 652 transitions. [2020-11-30 00:47:00,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:47:00,261 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 652 transitions. [2020-11-30 00:47:00,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 00:47:00,263 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:00,263 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:00,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 00:47:00,264 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:00,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:00,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1243418079, now seen corresponding path program 1 times [2020-11-30 00:47:00,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:00,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484343306] [2020-11-30 00:47:00,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:00,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:47:00,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484343306] [2020-11-30 00:47:00,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:00,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:47:00,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351672248] [2020-11-30 00:47:00,367 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:47:00,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:00,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:47:00,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:47:00,369 INFO L87 Difference]: Start difference. First operand 423 states and 652 transitions. Second operand 3 states. [2020-11-30 00:47:00,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:00,469 INFO L93 Difference]: Finished difference Result 1247 states and 1927 transitions. [2020-11-30 00:47:00,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:47:00,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-11-30 00:47:00,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:00,477 INFO L225 Difference]: With dead ends: 1247 [2020-11-30 00:47:00,477 INFO L226 Difference]: Without dead ends: 834 [2020-11-30 00:47:00,479 INFO L677 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 [2020-11-30 00:47:00,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2020-11-30 00:47:00,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 427. [2020-11-30 00:47:00,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-11-30 00:47:00,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 656 transitions. [2020-11-30 00:47:00,516 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 656 transitions. Word has length 14 [2020-11-30 00:47:00,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:00,516 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 656 transitions. [2020-11-30 00:47:00,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:47:00,517 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 656 transitions. [2020-11-30 00:47:00,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 00:47:00,518 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:00,519 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:00,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 00:47:00,520 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:00,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:00,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1419090732, now seen corresponding path program 1 times [2020-11-30 00:47:00,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:00,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034224097] [2020-11-30 00:47:00,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:00,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:47:00,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034224097] [2020-11-30 00:47:00,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:00,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:47:00,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087078890] [2020-11-30 00:47:00,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:47:00,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:00,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:47:00,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:47:00,606 INFO L87 Difference]: Start difference. First operand 427 states and 656 transitions. Second operand 4 states. [2020-11-30 00:47:00,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:00,808 INFO L93 Difference]: Finished difference Result 1574 states and 2397 transitions. [2020-11-30 00:47:00,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:47:00,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-11-30 00:47:00,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:00,818 INFO L225 Difference]: With dead ends: 1574 [2020-11-30 00:47:00,819 INFO L226 Difference]: Without dead ends: 1161 [2020-11-30 00:47:00,821 INFO L677 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 [2020-11-30 00:47:00,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2020-11-30 00:47:00,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 429. [2020-11-30 00:47:00,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2020-11-30 00:47:00,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 658 transitions. [2020-11-30 00:47:00,849 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 658 transitions. Word has length 18 [2020-11-30 00:47:00,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:00,850 INFO L481 AbstractCegarLoop]: Abstraction has 429 states and 658 transitions. [2020-11-30 00:47:00,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:47:00,850 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 658 transitions. [2020-11-30 00:47:00,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-30 00:47:00,855 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:00,855 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:00,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 00:47:00,856 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:00,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:00,857 INFO L82 PathProgramCache]: Analyzing trace with hash 703965683, now seen corresponding path program 1 times [2020-11-30 00:47:00,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:00,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452941160] [2020-11-30 00:47:00,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:00,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:47:00,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452941160] [2020-11-30 00:47:00,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:00,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:47:00,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677991763] [2020-11-30 00:47:00,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:47:00,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:00,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:47:00,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:47:00,982 INFO L87 Difference]: Start difference. First operand 429 states and 658 transitions. Second operand 4 states. [2020-11-30 00:47:01,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:01,046 INFO L93 Difference]: Finished difference Result 671 states and 1022 transitions. [2020-11-30 00:47:01,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:47:01,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-11-30 00:47:01,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:01,050 INFO L225 Difference]: With dead ends: 671 [2020-11-30 00:47:01,051 INFO L226 Difference]: Without dead ends: 427 [2020-11-30 00:47:01,052 INFO L677 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 [2020-11-30 00:47:01,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2020-11-30 00:47:01,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2020-11-30 00:47:01,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-11-30 00:47:01,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 651 transitions. [2020-11-30 00:47:01,067 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 651 transitions. Word has length 19 [2020-11-30 00:47:01,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:01,068 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 651 transitions. [2020-11-30 00:47:01,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:47:01,068 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 651 transitions. [2020-11-30 00:47:01,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-30 00:47:01,069 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:01,069 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:01,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 00:47:01,070 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:01,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:01,070 INFO L82 PathProgramCache]: Analyzing trace with hash 628676147, now seen corresponding path program 1 times [2020-11-30 00:47:01,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:01,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169991778] [2020-11-30 00:47:01,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:01,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:47:01,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169991778] [2020-11-30 00:47:01,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182942829] [2020-11-30 00:47:01,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:47:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:01,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 00:47:01,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:47:01,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:47:01,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:47:01,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-11-30 00:47:01,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332525598] [2020-11-30 00:47:01,426 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:47:01,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:01,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:47:01,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:47:01,428 INFO L87 Difference]: Start difference. First operand 427 states and 651 transitions. Second operand 5 states. [2020-11-30 00:47:01,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:01,691 INFO L93 Difference]: Finished difference Result 1663 states and 2549 transitions. [2020-11-30 00:47:01,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:47:01,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-11-30 00:47:01,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:01,706 INFO L225 Difference]: With dead ends: 1663 [2020-11-30 00:47:01,706 INFO L226 Difference]: Without dead ends: 1247 [2020-11-30 00:47:01,708 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:47:01,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2020-11-30 00:47:01,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 573. [2020-11-30 00:47:01,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2020-11-30 00:47:01,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 901 transitions. [2020-11-30 00:47:01,745 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 901 transitions. Word has length 21 [2020-11-30 00:47:01,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:01,746 INFO L481 AbstractCegarLoop]: Abstraction has 573 states and 901 transitions. [2020-11-30 00:47:01,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:47:01,747 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 901 transitions. [2020-11-30 00:47:01,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 00:47:01,748 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:01,749 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:01,969 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-11-30 00:47:01,970 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:01,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:01,970 INFO L82 PathProgramCache]: Analyzing trace with hash -837838367, now seen corresponding path program 2 times [2020-11-30 00:47:01,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:01,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410807235] [2020-11-30 00:47:01,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:02,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-30 00:47:02,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410807235] [2020-11-30 00:47:02,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:02,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:47:02,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164692602] [2020-11-30 00:47:02,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:47:02,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:02,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:47:02,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:47:02,064 INFO L87 Difference]: Start difference. First operand 573 states and 901 transitions. Second operand 3 states. [2020-11-30 00:47:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:02,179 INFO L93 Difference]: Finished difference Result 1305 states and 2030 transitions. [2020-11-30 00:47:02,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:47:02,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-11-30 00:47:02,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:02,186 INFO L225 Difference]: With dead ends: 1305 [2020-11-30 00:47:02,186 INFO L226 Difference]: Without dead ends: 770 [2020-11-30 00:47:02,188 INFO L677 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 [2020-11-30 00:47:02,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2020-11-30 00:47:02,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 522. [2020-11-30 00:47:02,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2020-11-30 00:47:02,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 807 transitions. [2020-11-30 00:47:02,210 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 807 transitions. Word has length 28 [2020-11-30 00:47:02,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:02,211 INFO L481 AbstractCegarLoop]: Abstraction has 522 states and 807 transitions. [2020-11-30 00:47:02,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:47:02,211 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 807 transitions. [2020-11-30 00:47:02,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 00:47:02,212 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:02,212 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:02,212 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 00:47:02,213 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:02,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:02,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1453457771, now seen corresponding path program 1 times [2020-11-30 00:47:02,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:02,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162134137] [2020-11-30 00:47:02,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:02,272 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-30 00:47:02,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162134137] [2020-11-30 00:47:02,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:02,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:47:02,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440332687] [2020-11-30 00:47:02,274 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:47:02,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:02,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:47:02,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:47:02,275 INFO L87 Difference]: Start difference. First operand 522 states and 807 transitions. Second operand 3 states. [2020-11-30 00:47:02,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:02,427 INFO L93 Difference]: Finished difference Result 1185 states and 1812 transitions. [2020-11-30 00:47:02,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:47:02,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-11-30 00:47:02,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:02,434 INFO L225 Difference]: With dead ends: 1185 [2020-11-30 00:47:02,434 INFO L226 Difference]: Without dead ends: 692 [2020-11-30 00:47:02,436 INFO L677 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 [2020-11-30 00:47:02,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2020-11-30 00:47:02,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 456. [2020-11-30 00:47:02,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2020-11-30 00:47:02,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 682 transitions. [2020-11-30 00:47:02,458 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 682 transitions. Word has length 28 [2020-11-30 00:47:02,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:02,458 INFO L481 AbstractCegarLoop]: Abstraction has 456 states and 682 transitions. [2020-11-30 00:47:02,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:47:02,459 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 682 transitions. [2020-11-30 00:47:02,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-11-30 00:47:02,463 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:02,463 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:02,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 00:47:02,464 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:02,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:02,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1581264384, now seen corresponding path program 1 times [2020-11-30 00:47:02,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:02,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869406263] [2020-11-30 00:47:02,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:02,551 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-30 00:47:02,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869406263] [2020-11-30 00:47:02,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:02,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:47:02,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646721658] [2020-11-30 00:47:02,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:47:02,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:02,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:47:02,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:47:02,553 INFO L87 Difference]: Start difference. First operand 456 states and 682 transitions. Second operand 4 states. [2020-11-30 00:47:02,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:02,648 INFO L93 Difference]: Finished difference Result 1096 states and 1644 transitions. [2020-11-30 00:47:02,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:47:02,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2020-11-30 00:47:02,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:02,657 INFO L225 Difference]: With dead ends: 1096 [2020-11-30 00:47:02,657 INFO L226 Difference]: Without dead ends: 684 [2020-11-30 00:47:02,658 INFO L677 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 [2020-11-30 00:47:02,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2020-11-30 00:47:02,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 456. [2020-11-30 00:47:02,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2020-11-30 00:47:02,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 680 transitions. [2020-11-30 00:47:02,678 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 680 transitions. Word has length 38 [2020-11-30 00:47:02,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:02,678 INFO L481 AbstractCegarLoop]: Abstraction has 456 states and 680 transitions. [2020-11-30 00:47:02,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:47:02,679 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 680 transitions. [2020-11-30 00:47:02,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-30 00:47:02,683 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:02,683 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:02,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 00:47:02,684 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:02,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:02,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1902944388, now seen corresponding path program 1 times [2020-11-30 00:47:02,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:02,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315984225] [2020-11-30 00:47:02,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:02,791 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-30 00:47:02,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315984225] [2020-11-30 00:47:02,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:02,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:47:02,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507288361] [2020-11-30 00:47:02,792 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:47:02,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:02,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:47:02,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:47:02,793 INFO L87 Difference]: Start difference. First operand 456 states and 680 transitions. Second operand 3 states. [2020-11-30 00:47:02,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:02,871 INFO L93 Difference]: Finished difference Result 1032 states and 1543 transitions. [2020-11-30 00:47:02,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:47:02,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-11-30 00:47:02,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:02,877 INFO L225 Difference]: With dead ends: 1032 [2020-11-30 00:47:02,878 INFO L226 Difference]: Without dead ends: 639 [2020-11-30 00:47:02,879 INFO L677 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 [2020-11-30 00:47:02,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-11-30 00:47:02,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 412. [2020-11-30 00:47:02,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2020-11-30 00:47:02,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 606 transitions. [2020-11-30 00:47:02,898 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 606 transitions. Word has length 50 [2020-11-30 00:47:02,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:02,901 INFO L481 AbstractCegarLoop]: Abstraction has 412 states and 606 transitions. [2020-11-30 00:47:02,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:47:02,901 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 606 transitions. [2020-11-30 00:47:02,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-30 00:47:02,903 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:02,903 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:02,903 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 00:47:02,905 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:02,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:02,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1215657471, now seen corresponding path program 1 times [2020-11-30 00:47:02,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:02,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584893678] [2020-11-30 00:47:02,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:02,990 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-30 00:47:02,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584893678] [2020-11-30 00:47:02,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:02,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:47:02,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255648574] [2020-11-30 00:47:02,992 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:47:02,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:02,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:47:02,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:47:02,999 INFO L87 Difference]: Start difference. First operand 412 states and 606 transitions. Second operand 3 states. [2020-11-30 00:47:03,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:03,109 INFO L93 Difference]: Finished difference Result 866 states and 1272 transitions. [2020-11-30 00:47:03,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:47:03,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-11-30 00:47:03,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:03,114 INFO L225 Difference]: With dead ends: 866 [2020-11-30 00:47:03,115 INFO L226 Difference]: Without dead ends: 509 [2020-11-30 00:47:03,116 INFO L677 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 [2020-11-30 00:47:03,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2020-11-30 00:47:03,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 368. [2020-11-30 00:47:03,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2020-11-30 00:47:03,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 518 transitions. [2020-11-30 00:47:03,134 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 518 transitions. Word has length 51 [2020-11-30 00:47:03,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:03,135 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 518 transitions. [2020-11-30 00:47:03,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:47:03,135 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 518 transitions. [2020-11-30 00:47:03,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-30 00:47:03,136 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:03,137 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:03,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 00:47:03,138 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:03,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:03,138 INFO L82 PathProgramCache]: Analyzing trace with hash -64177626, now seen corresponding path program 1 times [2020-11-30 00:47:03,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:03,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017533573] [2020-11-30 00:47:03,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:03,233 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-30 00:47:03,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017533573] [2020-11-30 00:47:03,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:03,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:47:03,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102362793] [2020-11-30 00:47:03,235 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:47:03,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:03,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:47:03,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:47:03,237 INFO L87 Difference]: Start difference. First operand 368 states and 518 transitions. Second operand 4 states. [2020-11-30 00:47:03,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:03,319 INFO L93 Difference]: Finished difference Result 874 states and 1251 transitions. [2020-11-30 00:47:03,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:47:03,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-11-30 00:47:03,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:03,331 INFO L225 Difference]: With dead ends: 874 [2020-11-30 00:47:03,331 INFO L226 Difference]: Without dead ends: 578 [2020-11-30 00:47:03,332 INFO L677 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 [2020-11-30 00:47:03,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-11-30 00:47:03,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 368. [2020-11-30 00:47:03,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2020-11-30 00:47:03,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 516 transitions. [2020-11-30 00:47:03,353 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 516 transitions. Word has length 62 [2020-11-30 00:47:03,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:03,354 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 516 transitions. [2020-11-30 00:47:03,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:47:03,355 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 516 transitions. [2020-11-30 00:47:03,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-11-30 00:47:03,356 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:03,356 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:03,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 00:47:03,357 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:03,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:03,358 INFO L82 PathProgramCache]: Analyzing trace with hash 461299335, now seen corresponding path program 1 times [2020-11-30 00:47:03,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:03,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147198273] [2020-11-30 00:47:03,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:03,460 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-30 00:47:03,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147198273] [2020-11-30 00:47:03,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796283290] [2020-11-30 00:47:03,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:47:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:03,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:47:03,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:47:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-30 00:47:03,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:47:03,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-11-30 00:47:03,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949966335] [2020-11-30 00:47:03,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:47:03,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:03,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:47:03,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:47:03,717 INFO L87 Difference]: Start difference. First operand 368 states and 516 transitions. Second operand 6 states. [2020-11-30 00:47:03,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:03,881 INFO L93 Difference]: Finished difference Result 1424 states and 2026 transitions. [2020-11-30 00:47:03,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:47:03,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2020-11-30 00:47:03,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:03,889 INFO L225 Difference]: With dead ends: 1424 [2020-11-30 00:47:03,890 INFO L226 Difference]: Without dead ends: 1075 [2020-11-30 00:47:03,892 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:47:03,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2020-11-30 00:47:03,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 441. [2020-11-30 00:47:03,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-11-30 00:47:03,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 613 transitions. [2020-11-30 00:47:03,919 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 613 transitions. Word has length 76 [2020-11-30 00:47:03,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:03,919 INFO L481 AbstractCegarLoop]: Abstraction has 441 states and 613 transitions. [2020-11-30 00:47:03,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:47:03,919 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 613 transitions. [2020-11-30 00:47:03,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-11-30 00:47:03,920 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:03,921 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:04,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-11-30 00:47:04,149 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:04,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:04,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1414363196, now seen corresponding path program 2 times [2020-11-30 00:47:04,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:04,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380024021] [2020-11-30 00:47:04,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:04,279 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2020-11-30 00:47:04,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380024021] [2020-11-30 00:47:04,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:04,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:47:04,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483734402] [2020-11-30 00:47:04,284 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:47:04,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:04,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:47:04,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:47:04,286 INFO L87 Difference]: Start difference. First operand 441 states and 613 transitions. Second operand 3 states. [2020-11-30 00:47:04,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:04,374 INFO L93 Difference]: Finished difference Result 863 states and 1242 transitions. [2020-11-30 00:47:04,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:47:04,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2020-11-30 00:47:04,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:04,379 INFO L225 Difference]: With dead ends: 863 [2020-11-30 00:47:04,379 INFO L226 Difference]: Without dead ends: 564 [2020-11-30 00:47:04,380 INFO L677 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 [2020-11-30 00:47:04,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-11-30 00:47:04,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 397. [2020-11-30 00:47:04,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-11-30 00:47:04,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 555 transitions. [2020-11-30 00:47:04,402 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 555 transitions. Word has length 103 [2020-11-30 00:47:04,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:04,403 INFO L481 AbstractCegarLoop]: Abstraction has 397 states and 555 transitions. [2020-11-30 00:47:04,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:47:04,403 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 555 transitions. [2020-11-30 00:47:04,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-11-30 00:47:04,412 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:04,412 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:04,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-30 00:47:04,413 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:04,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:04,414 INFO L82 PathProgramCache]: Analyzing trace with hash -262724973, now seen corresponding path program 1 times [2020-11-30 00:47:04,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:04,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111096629] [2020-11-30 00:47:04,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:04,493 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2020-11-30 00:47:04,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111096629] [2020-11-30 00:47:04,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:04,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:47:04,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941902577] [2020-11-30 00:47:04,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:47:04,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:04,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:47:04,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:47:04,495 INFO L87 Difference]: Start difference. First operand 397 states and 555 transitions. Second operand 3 states. [2020-11-30 00:47:04,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:04,540 INFO L93 Difference]: Finished difference Result 572 states and 815 transitions. [2020-11-30 00:47:04,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:47:04,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2020-11-30 00:47:04,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:04,543 INFO L225 Difference]: With dead ends: 572 [2020-11-30 00:47:04,543 INFO L226 Difference]: Without dead ends: 313 [2020-11-30 00:47:04,546 INFO L677 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 [2020-11-30 00:47:04,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2020-11-30 00:47:04,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2020-11-30 00:47:04,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2020-11-30 00:47:04,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 432 transitions. [2020-11-30 00:47:04,561 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 432 transitions. Word has length 112 [2020-11-30 00:47:04,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:04,561 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 432 transitions. [2020-11-30 00:47:04,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:47:04,561 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 432 transitions. [2020-11-30 00:47:04,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-11-30 00:47:04,563 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:04,563 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:04,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-30 00:47:04,563 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:04,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:04,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1252211039, now seen corresponding path program 1 times [2020-11-30 00:47:04,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:04,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65614496] [2020-11-30 00:47:04,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:04,669 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2020-11-30 00:47:04,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65614496] [2020-11-30 00:47:04,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:04,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:47:04,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687441103] [2020-11-30 00:47:04,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:47:04,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:04,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:47:04,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:47:04,672 INFO L87 Difference]: Start difference. First operand 313 states and 432 transitions. Second operand 4 states. [2020-11-30 00:47:04,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:04,732 INFO L93 Difference]: Finished difference Result 487 states and 691 transitions. [2020-11-30 00:47:04,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:47:04,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2020-11-30 00:47:04,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:04,736 INFO L225 Difference]: With dead ends: 487 [2020-11-30 00:47:04,737 INFO L226 Difference]: Without dead ends: 313 [2020-11-30 00:47:04,738 INFO L677 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 [2020-11-30 00:47:04,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2020-11-30 00:47:04,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2020-11-30 00:47:04,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2020-11-30 00:47:04,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 429 transitions. [2020-11-30 00:47:04,753 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 429 transitions. Word has length 115 [2020-11-30 00:47:04,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:04,754 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 429 transitions. [2020-11-30 00:47:04,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:47:04,754 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 429 transitions. [2020-11-30 00:47:04,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-11-30 00:47:04,756 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:04,756 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:04,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-30 00:47:04,757 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:04,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:04,758 INFO L82 PathProgramCache]: Analyzing trace with hash 501578938, now seen corresponding path program 1 times [2020-11-30 00:47:04,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:04,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420283229] [2020-11-30 00:47:04,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:04,835 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-11-30 00:47:04,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420283229] [2020-11-30 00:47:04,836 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:04,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:47:04,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308610863] [2020-11-30 00:47:04,837 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:47:04,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:04,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:47:04,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:47:04,838 INFO L87 Difference]: Start difference. First operand 313 states and 429 transitions. Second operand 3 states. [2020-11-30 00:47:04,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:04,885 INFO L93 Difference]: Finished difference Result 617 states and 887 transitions. [2020-11-30 00:47:04,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:47:04,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2020-11-30 00:47:04,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:04,890 INFO L225 Difference]: With dead ends: 617 [2020-11-30 00:47:04,890 INFO L226 Difference]: Without dead ends: 448 [2020-11-30 00:47:04,891 INFO L677 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 [2020-11-30 00:47:04,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2020-11-30 00:47:04,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 308. [2020-11-30 00:47:04,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2020-11-30 00:47:04,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 421 transitions. [2020-11-30 00:47:04,909 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 421 transitions. Word has length 126 [2020-11-30 00:47:04,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:04,910 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 421 transitions. [2020-11-30 00:47:04,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:47:04,910 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 421 transitions. [2020-11-30 00:47:04,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-11-30 00:47:04,912 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:04,912 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:04,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-30 00:47:04,913 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:04,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:04,914 INFO L82 PathProgramCache]: Analyzing trace with hash 592039264, now seen corresponding path program 1 times [2020-11-30 00:47:04,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:04,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059440003] [2020-11-30 00:47:04,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:05,007 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-11-30 00:47:05,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059440003] [2020-11-30 00:47:05,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:05,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:47:05,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125233832] [2020-11-30 00:47:05,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:47:05,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:05,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:47:05,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:47:05,011 INFO L87 Difference]: Start difference. First operand 308 states and 421 transitions. Second operand 3 states. [2020-11-30 00:47:05,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:05,059 INFO L93 Difference]: Finished difference Result 597 states and 857 transitions. [2020-11-30 00:47:05,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:47:05,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2020-11-30 00:47:05,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:05,064 INFO L225 Difference]: With dead ends: 597 [2020-11-30 00:47:05,064 INFO L226 Difference]: Without dead ends: 433 [2020-11-30 00:47:05,065 INFO L677 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 [2020-11-30 00:47:05,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2020-11-30 00:47:05,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 304. [2020-11-30 00:47:05,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-11-30 00:47:05,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 414 transitions. [2020-11-30 00:47:05,084 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 414 transitions. Word has length 131 [2020-11-30 00:47:05,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:05,084 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 414 transitions. [2020-11-30 00:47:05,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:47:05,085 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 414 transitions. [2020-11-30 00:47:05,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-11-30 00:47:05,087 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:05,087 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:05,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-30 00:47:05,088 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:05,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:05,088 INFO L82 PathProgramCache]: Analyzing trace with hash -506801986, now seen corresponding path program 1 times [2020-11-30 00:47:05,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:05,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516853760] [2020-11-30 00:47:05,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:05,174 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-11-30 00:47:05,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516853760] [2020-11-30 00:47:05,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:05,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:47:05,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537002683] [2020-11-30 00:47:05,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:47:05,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:05,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:47:05,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:47:05,177 INFO L87 Difference]: Start difference. First operand 304 states and 414 transitions. Second operand 3 states. [2020-11-30 00:47:05,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:05,217 INFO L93 Difference]: Finished difference Result 462 states and 651 transitions. [2020-11-30 00:47:05,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:47:05,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2020-11-30 00:47:05,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:05,221 INFO L225 Difference]: With dead ends: 462 [2020-11-30 00:47:05,221 INFO L226 Difference]: Without dead ends: 302 [2020-11-30 00:47:05,222 INFO L677 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 [2020-11-30 00:47:05,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-11-30 00:47:05,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2020-11-30 00:47:05,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2020-11-30 00:47:05,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 408 transitions. [2020-11-30 00:47:05,239 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 408 transitions. Word has length 137 [2020-11-30 00:47:05,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:05,240 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 408 transitions. [2020-11-30 00:47:05,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:47:05,240 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 408 transitions. [2020-11-30 00:47:05,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-11-30 00:47:05,243 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:05,243 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:05,243 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-30 00:47:05,252 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:05,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:05,253 INFO L82 PathProgramCache]: Analyzing trace with hash -438207637, now seen corresponding path program 1 times [2020-11-30 00:47:05,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:05,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686729514] [2020-11-30 00:47:05,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:05,366 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-11-30 00:47:05,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686729514] [2020-11-30 00:47:05,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:05,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:47:05,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392254922] [2020-11-30 00:47:05,368 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:47:05,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:05,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:47:05,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:47:05,370 INFO L87 Difference]: Start difference. First operand 301 states and 408 transitions. Second operand 3 states. [2020-11-30 00:47:05,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:05,390 INFO L93 Difference]: Finished difference Result 506 states and 711 transitions. [2020-11-30 00:47:05,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:47:05,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2020-11-30 00:47:05,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:05,394 INFO L225 Difference]: With dead ends: 506 [2020-11-30 00:47:05,395 INFO L226 Difference]: Without dead ends: 349 [2020-11-30 00:47:05,396 INFO L677 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 [2020-11-30 00:47:05,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2020-11-30 00:47:05,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 298. [2020-11-30 00:47:05,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2020-11-30 00:47:05,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 404 transitions. [2020-11-30 00:47:05,417 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 404 transitions. Word has length 145 [2020-11-30 00:47:05,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:05,418 INFO L481 AbstractCegarLoop]: Abstraction has 298 states and 404 transitions. [2020-11-30 00:47:05,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:47:05,418 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 404 transitions. [2020-11-30 00:47:05,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-11-30 00:47:05,421 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:05,421 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:05,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-30 00:47:05,422 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:05,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:05,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1753319214, now seen corresponding path program 1 times [2020-11-30 00:47:05,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:05,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406987733] [2020-11-30 00:47:05,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:05,580 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-30 00:47:05,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406987733] [2020-11-30 00:47:05,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:05,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:47:05,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203718834] [2020-11-30 00:47:05,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:47:05,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:05,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:47:05,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:47:05,585 INFO L87 Difference]: Start difference. First operand 298 states and 404 transitions. Second operand 3 states. [2020-11-30 00:47:05,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:05,628 INFO L93 Difference]: Finished difference Result 482 states and 670 transitions. [2020-11-30 00:47:05,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:47:05,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2020-11-30 00:47:05,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:05,632 INFO L225 Difference]: With dead ends: 482 [2020-11-30 00:47:05,632 INFO L226 Difference]: Without dead ends: 298 [2020-11-30 00:47:05,633 INFO L677 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 [2020-11-30 00:47:05,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2020-11-30 00:47:05,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2020-11-30 00:47:05,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2020-11-30 00:47:05,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 401 transitions. [2020-11-30 00:47:05,653 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 401 transitions. Word has length 146 [2020-11-30 00:47:05,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:05,653 INFO L481 AbstractCegarLoop]: Abstraction has 298 states and 401 transitions. [2020-11-30 00:47:05,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:47:05,654 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 401 transitions. [2020-11-30 00:47:05,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-11-30 00:47:05,656 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:05,656 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:05,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-30 00:47:05,657 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:05,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:05,658 INFO L82 PathProgramCache]: Analyzing trace with hash -629975554, now seen corresponding path program 1 times [2020-11-30 00:47:05,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:05,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820898684] [2020-11-30 00:47:05,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:05,900 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:47:05,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820898684] [2020-11-30 00:47:05,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:05,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:47:05,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33747730] [2020-11-30 00:47:05,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:47:05,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:05,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:47:05,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:47:05,903 INFO L87 Difference]: Start difference. First operand 298 states and 401 transitions. Second operand 4 states. [2020-11-30 00:47:06,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:06,051 INFO L93 Difference]: Finished difference Result 634 states and 893 transitions. [2020-11-30 00:47:06,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:47:06,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2020-11-30 00:47:06,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:06,056 INFO L225 Difference]: With dead ends: 634 [2020-11-30 00:47:06,056 INFO L226 Difference]: Without dead ends: 480 [2020-11-30 00:47:06,057 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:47:06,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2020-11-30 00:47:06,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 384. [2020-11-30 00:47:06,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-11-30 00:47:06,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 523 transitions. [2020-11-30 00:47:06,084 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 523 transitions. Word has length 158 [2020-11-30 00:47:06,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:06,084 INFO L481 AbstractCegarLoop]: Abstraction has 384 states and 523 transitions. [2020-11-30 00:47:06,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:47:06,085 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 523 transitions. [2020-11-30 00:47:06,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-11-30 00:47:06,087 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:06,088 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:06,088 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-30 00:47:06,089 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:06,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:06,089 INFO L82 PathProgramCache]: Analyzing trace with hash -43240807, now seen corresponding path program 1 times [2020-11-30 00:47:06,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:06,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721710043] [2020-11-30 00:47:06,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:06,216 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:47:06,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721710043] [2020-11-30 00:47:06,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:06,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:47:06,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246232697] [2020-11-30 00:47:06,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:47:06,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:06,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:47:06,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:47:06,219 INFO L87 Difference]: Start difference. First operand 384 states and 523 transitions. Second operand 3 states. [2020-11-30 00:47:06,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:06,280 INFO L93 Difference]: Finished difference Result 796 states and 1128 transitions. [2020-11-30 00:47:06,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:47:06,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2020-11-30 00:47:06,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:06,285 INFO L225 Difference]: With dead ends: 796 [2020-11-30 00:47:06,285 INFO L226 Difference]: Without dead ends: 597 [2020-11-30 00:47:06,286 INFO L677 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 [2020-11-30 00:47:06,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-11-30 00:47:06,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 457. [2020-11-30 00:47:06,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2020-11-30 00:47:06,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 624 transitions. [2020-11-30 00:47:06,324 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 624 transitions. Word has length 178 [2020-11-30 00:47:06,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:06,325 INFO L481 AbstractCegarLoop]: Abstraction has 457 states and 624 transitions. [2020-11-30 00:47:06,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:47:06,325 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 624 transitions. [2020-11-30 00:47:06,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-11-30 00:47:06,328 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:06,329 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:06,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-30 00:47:06,329 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:06,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:06,331 INFO L82 PathProgramCache]: Analyzing trace with hash 26527277, now seen corresponding path program 1 times [2020-11-30 00:47:06,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:06,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277220825] [2020-11-30 00:47:06,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:06,475 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:47:06,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277220825] [2020-11-30 00:47:06,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:06,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:47:06,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133828031] [2020-11-30 00:47:06,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:47:06,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:06,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:47:06,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:47:06,478 INFO L87 Difference]: Start difference. First operand 457 states and 624 transitions. Second operand 3 states. [2020-11-30 00:47:06,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:06,563 INFO L93 Difference]: Finished difference Result 949 states and 1342 transitions. [2020-11-30 00:47:06,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:47:06,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2020-11-30 00:47:06,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:06,569 INFO L225 Difference]: With dead ends: 949 [2020-11-30 00:47:06,569 INFO L226 Difference]: Without dead ends: 706 [2020-11-30 00:47:06,571 INFO L677 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 [2020-11-30 00:47:06,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2020-11-30 00:47:06,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 553. [2020-11-30 00:47:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2020-11-30 00:47:06,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 758 transitions. [2020-11-30 00:47:06,615 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 758 transitions. Word has length 179 [2020-11-30 00:47:06,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:06,616 INFO L481 AbstractCegarLoop]: Abstraction has 553 states and 758 transitions. [2020-11-30 00:47:06,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:47:06,616 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 758 transitions. [2020-11-30 00:47:06,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-11-30 00:47:06,619 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:06,619 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:06,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-30 00:47:06,620 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:06,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:06,621 INFO L82 PathProgramCache]: Analyzing trace with hash 807845746, now seen corresponding path program 1 times [2020-11-30 00:47:06,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:06,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419861523] [2020-11-30 00:47:06,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:06,774 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2020-11-30 00:47:06,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419861523] [2020-11-30 00:47:06,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133849098] [2020-11-30 00:47:06,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:47:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:07,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 00:47:07,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:47:07,160 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:47:07,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 00:47:07,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-11-30 00:47:07,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735906214] [2020-11-30 00:47:07,162 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:47:07,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:07,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:47:07,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:47:07,163 INFO L87 Difference]: Start difference. First operand 553 states and 758 transitions. Second operand 3 states. [2020-11-30 00:47:07,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:07,346 INFO L93 Difference]: Finished difference Result 1092 states and 1492 transitions. [2020-11-30 00:47:07,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:47:07,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2020-11-30 00:47:07,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:07,354 INFO L225 Difference]: With dead ends: 1092 [2020-11-30 00:47:07,354 INFO L226 Difference]: Without dead ends: 785 [2020-11-30 00:47:07,355 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:47:07,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2020-11-30 00:47:07,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 553. [2020-11-30 00:47:07,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2020-11-30 00:47:07,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 749 transitions. [2020-11-30 00:47:07,413 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 749 transitions. Word has length 180 [2020-11-30 00:47:07,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:07,414 INFO L481 AbstractCegarLoop]: Abstraction has 553 states and 749 transitions. [2020-11-30 00:47:07,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:47:07,414 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 749 transitions. [2020-11-30 00:47:07,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2020-11-30 00:47:07,417 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:07,417 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:07,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-11-30 00:47:07,645 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:07,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:07,646 INFO L82 PathProgramCache]: Analyzing trace with hash 770084783, now seen corresponding path program 1 times [2020-11-30 00:47:07,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:07,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504715215] [2020-11-30 00:47:07,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:07,780 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2020-11-30 00:47:07,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504715215] [2020-11-30 00:47:07,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562631931] [2020-11-30 00:47:07,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:47:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:08,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 00:47:08,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:47:08,176 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:47:08,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 00:47:08,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-11-30 00:47:08,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590927504] [2020-11-30 00:47:08,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:47:08,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:08,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:47:08,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:47:08,179 INFO L87 Difference]: Start difference. First operand 553 states and 749 transitions. Second operand 3 states. [2020-11-30 00:47:08,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:08,338 INFO L93 Difference]: Finished difference Result 1257 states and 1730 transitions. [2020-11-30 00:47:08,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:47:08,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2020-11-30 00:47:08,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:08,346 INFO L225 Difference]: With dead ends: 1257 [2020-11-30 00:47:08,346 INFO L226 Difference]: Without dead ends: 950 [2020-11-30 00:47:08,348 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:47:08,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2020-11-30 00:47:08,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 553. [2020-11-30 00:47:08,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2020-11-30 00:47:08,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 748 transitions. [2020-11-30 00:47:08,398 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 748 transitions. Word has length 181 [2020-11-30 00:47:08,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:08,399 INFO L481 AbstractCegarLoop]: Abstraction has 553 states and 748 transitions. [2020-11-30 00:47:08,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:47:08,399 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 748 transitions. [2020-11-30 00:47:08,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-11-30 00:47:08,402 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:08,403 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:08,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:47:08,629 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:08,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:08,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1889013460, now seen corresponding path program 1 times [2020-11-30 00:47:08,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:08,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140304585] [2020-11-30 00:47:08,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:08,831 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2020-11-30 00:47:08,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140304585] [2020-11-30 00:47:08,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086622834] [2020-11-30 00:47:08,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:47:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:09,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 00:47:09,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:47:09,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:47:09,164 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:47:09,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 00:47:09,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2020-11-30 00:47:09,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793004480] [2020-11-30 00:47:09,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:47:09,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:09,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:47:09,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:47:09,167 INFO L87 Difference]: Start difference. First operand 553 states and 748 transitions. Second operand 4 states. [2020-11-30 00:47:09,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:09,293 INFO L93 Difference]: Finished difference Result 874 states and 1201 transitions. [2020-11-30 00:47:09,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:47:09,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2020-11-30 00:47:09,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:09,300 INFO L225 Difference]: With dead ends: 874 [2020-11-30 00:47:09,301 INFO L226 Difference]: Without dead ends: 872 [2020-11-30 00:47:09,301 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:47:09,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2020-11-30 00:47:09,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 555. [2020-11-30 00:47:09,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2020-11-30 00:47:09,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 750 transitions. [2020-11-30 00:47:09,356 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 750 transitions. Word has length 182 [2020-11-30 00:47:09,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:09,356 INFO L481 AbstractCegarLoop]: Abstraction has 555 states and 750 transitions. [2020-11-30 00:47:09,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:47:09,357 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 750 transitions. [2020-11-30 00:47:09,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-11-30 00:47:09,360 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:09,360 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:09,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-11-30 00:47:09,589 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:09,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:09,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1063535941, now seen corresponding path program 1 times [2020-11-30 00:47:09,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:09,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265104611] [2020-11-30 00:47:09,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:09,889 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-11-30 00:47:09,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265104611] [2020-11-30 00:47:09,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:09,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-30 00:47:09,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472053282] [2020-11-30 00:47:09,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 00:47:09,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:09,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 00:47:09,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:47:09,892 INFO L87 Difference]: Start difference. First operand 555 states and 750 transitions. Second operand 9 states. [2020-11-30 00:47:10,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:10,612 INFO L93 Difference]: Finished difference Result 2240 states and 3102 transitions. [2020-11-30 00:47:10,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 00:47:10,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 185 [2020-11-30 00:47:10,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:10,626 INFO L225 Difference]: With dead ends: 2240 [2020-11-30 00:47:10,627 INFO L226 Difference]: Without dead ends: 1931 [2020-11-30 00:47:10,628 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2020-11-30 00:47:10,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2020-11-30 00:47:10,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 758. [2020-11-30 00:47:10,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2020-11-30 00:47:10,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1018 transitions. [2020-11-30 00:47:10,726 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1018 transitions. Word has length 185 [2020-11-30 00:47:10,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:10,727 INFO L481 AbstractCegarLoop]: Abstraction has 758 states and 1018 transitions. [2020-11-30 00:47:10,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 00:47:10,728 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1018 transitions. [2020-11-30 00:47:10,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-11-30 00:47:10,732 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:10,732 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:10,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-30 00:47:10,733 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:10,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:10,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1951567677, now seen corresponding path program 1 times [2020-11-30 00:47:10,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:10,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434661995] [2020-11-30 00:47:10,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:10,870 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:47:10,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434661995] [2020-11-30 00:47:10,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:10,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:47:10,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538832905] [2020-11-30 00:47:10,872 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:47:10,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:10,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:47:10,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:47:10,873 INFO L87 Difference]: Start difference. First operand 758 states and 1018 transitions. Second operand 3 states. [2020-11-30 00:47:11,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:11,099 INFO L93 Difference]: Finished difference Result 1641 states and 2231 transitions. [2020-11-30 00:47:11,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:47:11,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2020-11-30 00:47:11,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:11,109 INFO L225 Difference]: With dead ends: 1641 [2020-11-30 00:47:11,110 INFO L226 Difference]: Without dead ends: 1332 [2020-11-30 00:47:11,112 INFO L677 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 [2020-11-30 00:47:11,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2020-11-30 00:47:11,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 758. [2020-11-30 00:47:11,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2020-11-30 00:47:11,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1016 transitions. [2020-11-30 00:47:11,186 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1016 transitions. Word has length 185 [2020-11-30 00:47:11,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:11,187 INFO L481 AbstractCegarLoop]: Abstraction has 758 states and 1016 transitions. [2020-11-30 00:47:11,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:47:11,187 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1016 transitions. [2020-11-30 00:47:11,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2020-11-30 00:47:11,191 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:11,191 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:11,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-30 00:47:11,192 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:11,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:11,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1498687411, now seen corresponding path program 1 times [2020-11-30 00:47:11,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:11,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753207809] [2020-11-30 00:47:11,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:11,295 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-11-30 00:47:11,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753207809] [2020-11-30 00:47:11,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:11,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:47:11,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353359916] [2020-11-30 00:47:11,296 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:47:11,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:11,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:47:11,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:47:11,298 INFO L87 Difference]: Start difference. First operand 758 states and 1016 transitions. Second operand 3 states. [2020-11-30 00:47:11,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:11,409 INFO L93 Difference]: Finished difference Result 1245 states and 1681 transitions. [2020-11-30 00:47:11,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:47:11,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2020-11-30 00:47:11,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:11,415 INFO L225 Difference]: With dead ends: 1245 [2020-11-30 00:47:11,415 INFO L226 Difference]: Without dead ends: 608 [2020-11-30 00:47:11,417 INFO L677 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 [2020-11-30 00:47:11,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-11-30 00:47:11,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 607. [2020-11-30 00:47:11,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2020-11-30 00:47:11,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 791 transitions. [2020-11-30 00:47:11,474 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 791 transitions. Word has length 188 [2020-11-30 00:47:11,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:11,474 INFO L481 AbstractCegarLoop]: Abstraction has 607 states and 791 transitions. [2020-11-30 00:47:11,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:47:11,475 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 791 transitions. [2020-11-30 00:47:11,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-11-30 00:47:11,478 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:11,478 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:11,479 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-30 00:47:11,479 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:11,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:11,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1064832121, now seen corresponding path program 1 times [2020-11-30 00:47:11,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:11,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882827527] [2020-11-30 00:47:11,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:11,784 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:47:11,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882827527] [2020-11-30 00:47:11,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:11,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-30 00:47:11,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731247678] [2020-11-30 00:47:11,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 00:47:11,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:11,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 00:47:11,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:47:11,788 INFO L87 Difference]: Start difference. First operand 607 states and 791 transitions. Second operand 9 states. [2020-11-30 00:47:13,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:13,618 INFO L93 Difference]: Finished difference Result 1884 states and 2520 transitions. [2020-11-30 00:47:13,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-30 00:47:13,619 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 193 [2020-11-30 00:47:13,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:13,630 INFO L225 Difference]: With dead ends: 1884 [2020-11-30 00:47:13,630 INFO L226 Difference]: Without dead ends: 1586 [2020-11-30 00:47:13,632 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=265, Invalid=791, Unknown=0, NotChecked=0, Total=1056 [2020-11-30 00:47:13,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2020-11-30 00:47:13,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 761. [2020-11-30 00:47:13,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2020-11-30 00:47:13,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 985 transitions. [2020-11-30 00:47:13,714 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 985 transitions. Word has length 193 [2020-11-30 00:47:13,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:13,715 INFO L481 AbstractCegarLoop]: Abstraction has 761 states and 985 transitions. [2020-11-30 00:47:13,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 00:47:13,715 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 985 transitions. [2020-11-30 00:47:13,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-11-30 00:47:13,718 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:13,719 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:13,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-30 00:47:13,720 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:13,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:13,721 INFO L82 PathProgramCache]: Analyzing trace with hash -641185399, now seen corresponding path program 1 times [2020-11-30 00:47:13,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:13,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511659485] [2020-11-30 00:47:13,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:13,903 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:47:13,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511659485] [2020-11-30 00:47:13,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:13,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:47:13,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335433004] [2020-11-30 00:47:13,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:47:13,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:13,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:47:13,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:47:13,907 INFO L87 Difference]: Start difference. First operand 761 states and 985 transitions. Second operand 4 states. [2020-11-30 00:47:14,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:14,164 INFO L93 Difference]: Finished difference Result 1415 states and 1852 transitions. [2020-11-30 00:47:14,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:47:14,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2020-11-30 00:47:14,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:14,171 INFO L225 Difference]: With dead ends: 1415 [2020-11-30 00:47:14,172 INFO L226 Difference]: Without dead ends: 963 [2020-11-30 00:47:14,175 INFO L677 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 [2020-11-30 00:47:14,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2020-11-30 00:47:14,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 699. [2020-11-30 00:47:14,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2020-11-30 00:47:14,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 905 transitions. [2020-11-30 00:47:14,247 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 905 transitions. Word has length 193 [2020-11-30 00:47:14,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:14,248 INFO L481 AbstractCegarLoop]: Abstraction has 699 states and 905 transitions. [2020-11-30 00:47:14,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:47:14,248 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 905 transitions. [2020-11-30 00:47:14,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-11-30 00:47:14,251 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:14,252 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:14,252 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-30 00:47:14,252 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:14,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:14,253 INFO L82 PathProgramCache]: Analyzing trace with hash -772341411, now seen corresponding path program 1 times [2020-11-30 00:47:14,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:14,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591354750] [2020-11-30 00:47:14,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:14,364 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:47:14,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591354750] [2020-11-30 00:47:14,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:14,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:47:14,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589291443] [2020-11-30 00:47:14,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:47:14,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:14,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:47:14,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:47:14,367 INFO L87 Difference]: Start difference. First operand 699 states and 905 transitions. Second operand 3 states. [2020-11-30 00:47:14,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:14,512 INFO L93 Difference]: Finished difference Result 1355 states and 1748 transitions. [2020-11-30 00:47:14,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:47:14,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2020-11-30 00:47:14,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:14,519 INFO L225 Difference]: With dead ends: 1355 [2020-11-30 00:47:14,519 INFO L226 Difference]: Without dead ends: 928 [2020-11-30 00:47:14,522 INFO L677 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 [2020-11-30 00:47:14,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2020-11-30 00:47:14,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 699. [2020-11-30 00:47:14,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2020-11-30 00:47:14,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 887 transitions. [2020-11-30 00:47:14,620 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 887 transitions. Word has length 199 [2020-11-30 00:47:14,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:14,621 INFO L481 AbstractCegarLoop]: Abstraction has 699 states and 887 transitions. [2020-11-30 00:47:14,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:47:14,621 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 887 transitions. [2020-11-30 00:47:14,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-11-30 00:47:14,625 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:14,626 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:14,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-11-30 00:47:14,626 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:14,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:14,627 INFO L82 PathProgramCache]: Analyzing trace with hash -991196129, now seen corresponding path program 1 times [2020-11-30 00:47:14,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:14,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636468320] [2020-11-30 00:47:14,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:47:14,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636468320] [2020-11-30 00:47:14,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:14,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 00:47:14,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612885926] [2020-11-30 00:47:14,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:47:14,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:14,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:47:14,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:47:14,805 INFO L87 Difference]: Start difference. First operand 699 states and 887 transitions. Second operand 6 states. [2020-11-30 00:47:15,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:15,038 INFO L93 Difference]: Finished difference Result 2137 states and 2796 transitions. [2020-11-30 00:47:15,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:47:15,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 199 [2020-11-30 00:47:15,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:15,060 INFO L225 Difference]: With dead ends: 2137 [2020-11-30 00:47:15,067 INFO L226 Difference]: Without dead ends: 1741 [2020-11-30 00:47:15,068 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:47:15,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1741 states. [2020-11-30 00:47:15,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1741 to 776. [2020-11-30 00:47:15,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-11-30 00:47:15,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 985 transitions. [2020-11-30 00:47:15,159 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 985 transitions. Word has length 199 [2020-11-30 00:47:15,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:15,160 INFO L481 AbstractCegarLoop]: Abstraction has 776 states and 985 transitions. [2020-11-30 00:47:15,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:47:15,160 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 985 transitions. [2020-11-30 00:47:15,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-11-30 00:47:15,164 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:15,164 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:15,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-11-30 00:47:15,165 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:15,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:15,165 INFO L82 PathProgramCache]: Analyzing trace with hash -232873249, now seen corresponding path program 1 times [2020-11-30 00:47:15,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:15,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618214228] [2020-11-30 00:47:15,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:15,512 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:47:15,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618214228] [2020-11-30 00:47:15,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:15,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-30 00:47:15,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971616466] [2020-11-30 00:47:15,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 00:47:15,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:15,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 00:47:15,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-11-30 00:47:15,515 INFO L87 Difference]: Start difference. First operand 776 states and 985 transitions. Second operand 10 states. [2020-11-30 00:47:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:18,120 INFO L93 Difference]: Finished difference Result 3770 states and 4843 transitions. [2020-11-30 00:47:18,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-11-30 00:47:18,121 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 199 [2020-11-30 00:47:18,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:18,130 INFO L225 Difference]: With dead ends: 3770 [2020-11-30 00:47:18,130 INFO L226 Difference]: Without dead ends: 3300 [2020-11-30 00:47:18,133 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=322, Invalid=1238, Unknown=0, NotChecked=0, Total=1560 [2020-11-30 00:47:18,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3300 states. [2020-11-30 00:47:18,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3300 to 954. [2020-11-30 00:47:18,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 954 states. [2020-11-30 00:47:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1192 transitions. [2020-11-30 00:47:18,259 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1192 transitions. Word has length 199 [2020-11-30 00:47:18,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:18,260 INFO L481 AbstractCegarLoop]: Abstraction has 954 states and 1192 transitions. [2020-11-30 00:47:18,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 00:47:18,260 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1192 transitions. [2020-11-30 00:47:18,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-11-30 00:47:18,264 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:18,264 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:18,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-11-30 00:47:18,265 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:18,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:18,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1955006181, now seen corresponding path program 1 times [2020-11-30 00:47:18,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:18,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034130619] [2020-11-30 00:47:18,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:18,550 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:47:18,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034130619] [2020-11-30 00:47:18,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:18,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-30 00:47:18,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237944242] [2020-11-30 00:47:18,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 00:47:18,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:18,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 00:47:18,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:47:18,553 INFO L87 Difference]: Start difference. First operand 954 states and 1192 transitions. Second operand 9 states. [2020-11-30 00:47:20,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:20,106 INFO L93 Difference]: Finished difference Result 2945 states and 3732 transitions. [2020-11-30 00:47:20,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-30 00:47:20,106 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 199 [2020-11-30 00:47:20,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:20,113 INFO L225 Difference]: With dead ends: 2945 [2020-11-30 00:47:20,113 INFO L226 Difference]: Without dead ends: 2292 [2020-11-30 00:47:20,115 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2020-11-30 00:47:20,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2292 states. [2020-11-30 00:47:20,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2292 to 1018. [2020-11-30 00:47:20,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1018 states. [2020-11-30 00:47:20,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1263 transitions. [2020-11-30 00:47:20,280 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1263 transitions. Word has length 199 [2020-11-30 00:47:20,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:20,281 INFO L481 AbstractCegarLoop]: Abstraction has 1018 states and 1263 transitions. [2020-11-30 00:47:20,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 00:47:20,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1263 transitions. [2020-11-30 00:47:20,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2020-11-30 00:47:20,285 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:20,286 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:20,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-11-30 00:47:20,287 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:20,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:20,288 INFO L82 PathProgramCache]: Analyzing trace with hash 2144774009, now seen corresponding path program 1 times [2020-11-30 00:47:20,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:20,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039775889] [2020-11-30 00:47:20,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:20,433 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2020-11-30 00:47:20,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039775889] [2020-11-30 00:47:20,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:20,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:47:20,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554795234] [2020-11-30 00:47:20,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:47:20,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:20,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:47:20,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:47:20,437 INFO L87 Difference]: Start difference. First operand 1018 states and 1263 transitions. Second operand 4 states. [2020-11-30 00:47:20,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:20,804 INFO L93 Difference]: Finished difference Result 1890 states and 2372 transitions. [2020-11-30 00:47:20,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:47:20,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2020-11-30 00:47:20,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:20,808 INFO L225 Difference]: With dead ends: 1890 [2020-11-30 00:47:20,808 INFO L226 Difference]: Without dead ends: 1181 [2020-11-30 00:47:20,810 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:47:20,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-11-30 00:47:20,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 845. [2020-11-30 00:47:20,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2020-11-30 00:47:20,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1036 transitions. [2020-11-30 00:47:20,914 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1036 transitions. Word has length 207 [2020-11-30 00:47:20,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:20,915 INFO L481 AbstractCegarLoop]: Abstraction has 845 states and 1036 transitions. [2020-11-30 00:47:20,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:47:20,915 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1036 transitions. [2020-11-30 00:47:20,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-11-30 00:47:20,918 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:20,919 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:20,919 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-11-30 00:47:20,919 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:20,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:20,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1390652320, now seen corresponding path program 1 times [2020-11-30 00:47:20,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:20,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381430759] [2020-11-30 00:47:20,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:21,513 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 35 proven. 13 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2020-11-30 00:47:21,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381430759] [2020-11-30 00:47:21,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630577098] [2020-11-30 00:47:21,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:47:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:21,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 00:47:21,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:47:21,913 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2020-11-30 00:47:21,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 00:47:21,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2020-11-30 00:47:21,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185112485] [2020-11-30 00:47:21,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:47:21,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:21,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:47:21,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:47:21,916 INFO L87 Difference]: Start difference. First operand 845 states and 1036 transitions. Second operand 4 states. [2020-11-30 00:47:22,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:22,062 INFO L93 Difference]: Finished difference Result 1436 states and 1757 transitions. [2020-11-30 00:47:22,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:47:22,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 234 [2020-11-30 00:47:22,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:22,067 INFO L225 Difference]: With dead ends: 1436 [2020-11-30 00:47:22,068 INFO L226 Difference]: Without dead ends: 845 [2020-11-30 00:47:22,069 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-11-30 00:47:22,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2020-11-30 00:47:22,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2020-11-30 00:47:22,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2020-11-30 00:47:22,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1029 transitions. [2020-11-30 00:47:22,207 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1029 transitions. Word has length 234 [2020-11-30 00:47:22,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:22,208 INFO L481 AbstractCegarLoop]: Abstraction has 845 states and 1029 transitions. [2020-11-30 00:47:22,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:47:22,208 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1029 transitions. [2020-11-30 00:47:22,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-11-30 00:47:22,211 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:22,212 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:22,424 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:47:22,425 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:22,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:22,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1236543456, now seen corresponding path program 1 times [2020-11-30 00:47:22,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:22,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293866492] [2020-11-30 00:47:22,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:22,551 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2020-11-30 00:47:22,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293866492] [2020-11-30 00:47:22,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:22,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:47:22,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397159746] [2020-11-30 00:47:22,553 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:47:22,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:22,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:47:22,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:47:22,554 INFO L87 Difference]: Start difference. First operand 845 states and 1029 transitions. Second operand 3 states. [2020-11-30 00:47:22,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:22,735 INFO L93 Difference]: Finished difference Result 1982 states and 2397 transitions. [2020-11-30 00:47:22,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:47:22,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2020-11-30 00:47:22,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:22,741 INFO L225 Difference]: With dead ends: 1982 [2020-11-30 00:47:22,741 INFO L226 Difference]: Without dead ends: 1347 [2020-11-30 00:47:22,742 INFO L677 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 [2020-11-30 00:47:22,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-11-30 00:47:22,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 962. [2020-11-30 00:47:22,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2020-11-30 00:47:22,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1166 transitions. [2020-11-30 00:47:22,865 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1166 transitions. Word has length 234 [2020-11-30 00:47:22,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:22,866 INFO L481 AbstractCegarLoop]: Abstraction has 962 states and 1166 transitions. [2020-11-30 00:47:22,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:47:22,866 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1166 transitions. [2020-11-30 00:47:22,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-11-30 00:47:22,870 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:22,870 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:22,870 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-11-30 00:47:22,871 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:22,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:22,872 INFO L82 PathProgramCache]: Analyzing trace with hash 548001386, now seen corresponding path program 1 times [2020-11-30 00:47:22,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:22,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745021220] [2020-11-30 00:47:22,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:23,277 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:47:23,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745021220] [2020-11-30 00:47:23,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837248638] [2020-11-30 00:47:23,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:47:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:23,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 00:47:23,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:47:23,872 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 24 proven. 20 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:47:23,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:47:23,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2020-11-30 00:47:23,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089262540] [2020-11-30 00:47:23,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-30 00:47:23,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:23,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-30 00:47:23,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-30 00:47:23,875 INFO L87 Difference]: Start difference. First operand 962 states and 1166 transitions. Second operand 12 states. [2020-11-30 00:47:25,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:25,569 INFO L93 Difference]: Finished difference Result 4947 states and 6152 transitions. [2020-11-30 00:47:25,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-11-30 00:47:25,570 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 236 [2020-11-30 00:47:25,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:25,579 INFO L225 Difference]: With dead ends: 4947 [2020-11-30 00:47:25,580 INFO L226 Difference]: Without dead ends: 4319 [2020-11-30 00:47:25,583 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=370, Invalid=1190, Unknown=0, NotChecked=0, Total=1560 [2020-11-30 00:47:25,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4319 states. [2020-11-30 00:47:25,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4319 to 1776. [2020-11-30 00:47:25,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1776 states. [2020-11-30 00:47:25,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 2184 transitions. [2020-11-30 00:47:25,860 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 2184 transitions. Word has length 236 [2020-11-30 00:47:25,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:25,861 INFO L481 AbstractCegarLoop]: Abstraction has 1776 states and 2184 transitions. [2020-11-30 00:47:25,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-30 00:47:25,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2184 transitions. [2020-11-30 00:47:25,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-11-30 00:47:25,867 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:25,871 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:26,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2020-11-30 00:47:26,097 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:26,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:26,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1249601260, now seen corresponding path program 1 times [2020-11-30 00:47:26,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:26,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072615875] [2020-11-30 00:47:26,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:26,444 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:47:26,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072615875] [2020-11-30 00:47:26,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564424376] [2020-11-30 00:47:26,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:47:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:26,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 993 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 00:47:26,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:47:26,904 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2020-11-30 00:47:26,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 00:47:26,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 18 [2020-11-30 00:47:26,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103143494] [2020-11-30 00:47:26,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:47:26,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:26,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:47:26,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2020-11-30 00:47:26,907 INFO L87 Difference]: Start difference. First operand 1776 states and 2184 transitions. Second operand 7 states. [2020-11-30 00:47:28,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:28,273 INFO L93 Difference]: Finished difference Result 5532 states and 6918 transitions. [2020-11-30 00:47:28,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-30 00:47:28,274 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 236 [2020-11-30 00:47:28,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:28,283 INFO L225 Difference]: With dead ends: 5532 [2020-11-30 00:47:28,284 INFO L226 Difference]: Without dead ends: 4215 [2020-11-30 00:47:28,287 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2020-11-30 00:47:28,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4215 states. [2020-11-30 00:47:28,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4215 to 1862. [2020-11-30 00:47:28,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1862 states. [2020-11-30 00:47:28,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 2284 transitions. [2020-11-30 00:47:28,559 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 2284 transitions. Word has length 236 [2020-11-30 00:47:28,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:28,559 INFO L481 AbstractCegarLoop]: Abstraction has 1862 states and 2284 transitions. [2020-11-30 00:47:28,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:47:28,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2284 transitions. [2020-11-30 00:47:28,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-11-30 00:47:28,567 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:28,568 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:28,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2020-11-30 00:47:28,773 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:28,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:28,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1358401880, now seen corresponding path program 1 times [2020-11-30 00:47:28,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:28,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407189560] [2020-11-30 00:47:28,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:28,973 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2020-11-30 00:47:28,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407189560] [2020-11-30 00:47:28,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:28,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:47:28,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982079130] [2020-11-30 00:47:28,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:47:28,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:28,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:47:28,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:47:28,975 INFO L87 Difference]: Start difference. First operand 1862 states and 2284 transitions. Second operand 5 states. [2020-11-30 00:47:29,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:29,185 INFO L93 Difference]: Finished difference Result 3387 states and 4166 transitions. [2020-11-30 00:47:29,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:47:29,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 236 [2020-11-30 00:47:29,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:29,188 INFO L225 Difference]: With dead ends: 3387 [2020-11-30 00:47:29,188 INFO L226 Difference]: Without dead ends: 1862 [2020-11-30 00:47:29,189 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:47:29,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2020-11-30 00:47:29,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1862. [2020-11-30 00:47:29,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1862 states. [2020-11-30 00:47:29,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 2281 transitions. [2020-11-30 00:47:29,428 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 2281 transitions. Word has length 236 [2020-11-30 00:47:29,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:29,429 INFO L481 AbstractCegarLoop]: Abstraction has 1862 states and 2281 transitions. [2020-11-30 00:47:29,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:47:29,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2281 transitions. [2020-11-30 00:47:29,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-11-30 00:47:29,434 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:29,435 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:29,435 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-11-30 00:47:29,435 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:29,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:29,436 INFO L82 PathProgramCache]: Analyzing trace with hash -503761366, now seen corresponding path program 1 times [2020-11-30 00:47:29,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:29,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139665281] [2020-11-30 00:47:29,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:29,682 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-11-30 00:47:29,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139665281] [2020-11-30 00:47:29,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:29,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:47:29,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195648602] [2020-11-30 00:47:29,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:47:29,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:29,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:47:29,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:47:29,684 INFO L87 Difference]: Start difference. First operand 1862 states and 2281 transitions. Second operand 5 states. [2020-11-30 00:47:29,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:29,906 INFO L93 Difference]: Finished difference Result 3490 states and 4279 transitions. [2020-11-30 00:47:29,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:47:29,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2020-11-30 00:47:29,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:29,911 INFO L225 Difference]: With dead ends: 3490 [2020-11-30 00:47:29,911 INFO L226 Difference]: Without dead ends: 1898 [2020-11-30 00:47:29,913 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:47:29,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2020-11-30 00:47:30,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1889. [2020-11-30 00:47:30,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1889 states. [2020-11-30 00:47:30,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 2308 transitions. [2020-11-30 00:47:30,166 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 2308 transitions. Word has length 237 [2020-11-30 00:47:30,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:30,169 INFO L481 AbstractCegarLoop]: Abstraction has 1889 states and 2308 transitions. [2020-11-30 00:47:30,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:47:30,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2308 transitions. [2020-11-30 00:47:30,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-11-30 00:47:30,174 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:30,175 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:30,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-11-30 00:47:30,176 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:30,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:30,176 INFO L82 PathProgramCache]: Analyzing trace with hash 379747624, now seen corresponding path program 1 times [2020-11-30 00:47:30,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:30,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072093773] [2020-11-30 00:47:30,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:30,592 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:47:30,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072093773] [2020-11-30 00:47:30,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136499472] [2020-11-30 00:47:30,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:47:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:30,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-30 00:47:30,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:47:31,081 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:47:31,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:47:31,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2020-11-30 00:47:31,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388628976] [2020-11-30 00:47:31,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-30 00:47:31,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:31,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-30 00:47:31,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-11-30 00:47:31,084 INFO L87 Difference]: Start difference. First operand 1889 states and 2308 transitions. Second operand 16 states. [2020-11-30 00:47:35,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:35,074 INFO L93 Difference]: Finished difference Result 11602 states and 14554 transitions. [2020-11-30 00:47:35,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2020-11-30 00:47:35,075 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 237 [2020-11-30 00:47:35,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:35,090 INFO L225 Difference]: With dead ends: 11602 [2020-11-30 00:47:35,090 INFO L226 Difference]: Without dead ends: 10181 [2020-11-30 00:47:35,095 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=885, Invalid=2897, Unknown=0, NotChecked=0, Total=3782 [2020-11-30 00:47:35,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10181 states. [2020-11-30 00:47:35,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10181 to 2766. [2020-11-30 00:47:35,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2020-11-30 00:47:35,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3397 transitions. [2020-11-30 00:47:35,568 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3397 transitions. Word has length 237 [2020-11-30 00:47:35,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:35,569 INFO L481 AbstractCegarLoop]: Abstraction has 2766 states and 3397 transitions. [2020-11-30 00:47:35,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-30 00:47:35,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3397 transitions. [2020-11-30 00:47:35,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-11-30 00:47:35,575 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:35,576 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:35,795 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:47:35,796 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:35,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:35,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1173888676, now seen corresponding path program 1 times [2020-11-30 00:47:35,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:35,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392307020] [2020-11-30 00:47:35,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:36,145 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:47:36,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392307020] [2020-11-30 00:47:36,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900046146] [2020-11-30 00:47:36,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:47:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:36,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 00:47:36,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:47:36,677 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 24 proven. 20 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:47:36,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:47:36,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2020-11-30 00:47:36,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230620280] [2020-11-30 00:47:36,678 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-30 00:47:36,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:36,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-30 00:47:36,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-30 00:47:36,679 INFO L87 Difference]: Start difference. First operand 2766 states and 3397 transitions. Second operand 12 states. [2020-11-30 00:47:39,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:39,385 INFO L93 Difference]: Finished difference Result 13695 states and 17184 transitions. [2020-11-30 00:47:39,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-11-30 00:47:39,386 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 237 [2020-11-30 00:47:39,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:39,394 INFO L225 Difference]: With dead ends: 13695 [2020-11-30 00:47:39,395 INFO L226 Difference]: Without dead ends: 11506 [2020-11-30 00:47:39,398 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=369, Invalid=1191, Unknown=0, NotChecked=0, Total=1560 [2020-11-30 00:47:39,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11506 states. [2020-11-30 00:47:39,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11506 to 2778. [2020-11-30 00:47:39,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2778 states. [2020-11-30 00:47:39,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2778 states to 2778 states and 3413 transitions. [2020-11-30 00:47:39,810 INFO L78 Accepts]: Start accepts. Automaton has 2778 states and 3413 transitions. Word has length 237 [2020-11-30 00:47:39,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:39,810 INFO L481 AbstractCegarLoop]: Abstraction has 2778 states and 3413 transitions. [2020-11-30 00:47:39,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-30 00:47:39,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2778 states and 3413 transitions. [2020-11-30 00:47:39,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-11-30 00:47:39,816 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:39,817 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:40,032 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:47:40,033 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:40,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:40,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1214675354, now seen corresponding path program 1 times [2020-11-30 00:47:40,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:40,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960422342] [2020-11-30 00:47:40,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:40,316 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2020-11-30 00:47:40,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960422342] [2020-11-30 00:47:40,317 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:40,317 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:47:40,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122387874] [2020-11-30 00:47:40,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:47:40,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:40,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:47:40,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:47:40,320 INFO L87 Difference]: Start difference. First operand 2778 states and 3413 transitions. Second operand 5 states. [2020-11-30 00:47:40,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:40,811 INFO L93 Difference]: Finished difference Result 5185 states and 6385 transitions. [2020-11-30 00:47:40,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:47:40,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2020-11-30 00:47:40,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:40,814 INFO L225 Difference]: With dead ends: 5185 [2020-11-30 00:47:40,814 INFO L226 Difference]: Without dead ends: 2782 [2020-11-30 00:47:40,816 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:47:40,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2782 states. [2020-11-30 00:47:41,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2782 to 2766. [2020-11-30 00:47:41,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2020-11-30 00:47:41,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3397 transitions. [2020-11-30 00:47:41,241 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3397 transitions. Word has length 237 [2020-11-30 00:47:41,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:41,241 INFO L481 AbstractCegarLoop]: Abstraction has 2766 states and 3397 transitions. [2020-11-30 00:47:41,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:47:41,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3397 transitions. [2020-11-30 00:47:41,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2020-11-30 00:47:41,247 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:41,247 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:41,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-11-30 00:47:41,248 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:41,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:41,248 INFO L82 PathProgramCache]: Analyzing trace with hash -185177923, now seen corresponding path program 1 times [2020-11-30 00:47:41,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:41,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054041960] [2020-11-30 00:47:41,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:41,624 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:47:41,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054041960] [2020-11-30 00:47:41,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315994756] [2020-11-30 00:47:41,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:47:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:41,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-30 00:47:41,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:47:42,124 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2020-11-30 00:47:42,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 00:47:42,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 19 [2020-11-30 00:47:42,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079344187] [2020-11-30 00:47:42,125 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 00:47:42,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:42,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 00:47:42,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2020-11-30 00:47:42,126 INFO L87 Difference]: Start difference. First operand 2766 states and 3397 transitions. Second operand 8 states. [2020-11-30 00:47:44,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:44,265 INFO L93 Difference]: Finished difference Result 10128 states and 12736 transitions. [2020-11-30 00:47:44,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-30 00:47:44,265 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 238 [2020-11-30 00:47:44,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:44,271 INFO L225 Difference]: With dead ends: 10128 [2020-11-30 00:47:44,271 INFO L226 Difference]: Without dead ends: 7939 [2020-11-30 00:47:44,274 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=264, Invalid=1458, Unknown=0, NotChecked=0, Total=1722 [2020-11-30 00:47:44,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7939 states. [2020-11-30 00:47:44,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7939 to 2724. [2020-11-30 00:47:44,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2724 states. [2020-11-30 00:47:44,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2724 states to 2724 states and 3349 transitions. [2020-11-30 00:47:44,610 INFO L78 Accepts]: Start accepts. Automaton has 2724 states and 3349 transitions. Word has length 238 [2020-11-30 00:47:44,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:44,611 INFO L481 AbstractCegarLoop]: Abstraction has 2724 states and 3349 transitions. [2020-11-30 00:47:44,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 00:47:44,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2724 states and 3349 transitions. [2020-11-30 00:47:44,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2020-11-30 00:47:44,615 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:44,615 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:44,820 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2020-11-30 00:47:44,822 INFO L429 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:44,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:44,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1475101884, now seen corresponding path program 1 times [2020-11-30 00:47:44,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:44,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722959532] [2020-11-30 00:47:44,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:45,079 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-11-30 00:47:45,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722959532] [2020-11-30 00:47:45,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:47:45,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:47:45,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436517273] [2020-11-30 00:47:45,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:47:45,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:45,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:47:45,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:47:45,082 INFO L87 Difference]: Start difference. First operand 2724 states and 3349 transitions. Second operand 5 states. [2020-11-30 00:47:45,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:45,506 INFO L93 Difference]: Finished difference Result 5108 states and 6295 transitions. [2020-11-30 00:47:45,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:47:45,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 238 [2020-11-30 00:47:45,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:45,509 INFO L225 Difference]: With dead ends: 5108 [2020-11-30 00:47:45,509 INFO L226 Difference]: Without dead ends: 2772 [2020-11-30 00:47:45,512 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:47:45,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2772 states. [2020-11-30 00:47:45,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2772 to 2748. [2020-11-30 00:47:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2748 states. [2020-11-30 00:47:45,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2748 states to 2748 states and 3373 transitions. [2020-11-30 00:47:45,843 INFO L78 Accepts]: Start accepts. Automaton has 2748 states and 3373 transitions. Word has length 238 [2020-11-30 00:47:45,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:45,844 INFO L481 AbstractCegarLoop]: Abstraction has 2748 states and 3373 transitions. [2020-11-30 00:47:45,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:47:45,844 INFO L276 IsEmpty]: Start isEmpty. Operand 2748 states and 3373 transitions. [2020-11-30 00:47:45,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2020-11-30 00:47:45,847 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:45,848 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:45,848 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-11-30 00:47:45,848 INFO L429 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:45,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:45,849 INFO L82 PathProgramCache]: Analyzing trace with hash -591592894, now seen corresponding path program 1 times [2020-11-30 00:47:45,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:45,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569920765] [2020-11-30 00:47:45,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:46,241 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:47:46,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569920765] [2020-11-30 00:47:46,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759992963] [2020-11-30 00:47:46,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:47:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:46,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-30 00:47:46,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:47:46,791 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:47:46,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:47:46,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2020-11-30 00:47:46,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616427616] [2020-11-30 00:47:46,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-30 00:47:46,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:46,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-30 00:47:46,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-11-30 00:47:46,794 INFO L87 Difference]: Start difference. First operand 2748 states and 3373 transitions. Second operand 16 states. [2020-11-30 00:47:51,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:47:51,186 INFO L93 Difference]: Finished difference Result 15828 states and 19867 transitions. [2020-11-30 00:47:51,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2020-11-30 00:47:51,187 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 238 [2020-11-30 00:47:51,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:47:51,199 INFO L225 Difference]: With dead ends: 15828 [2020-11-30 00:47:51,199 INFO L226 Difference]: Without dead ends: 13663 [2020-11-30 00:47:51,204 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=877, Invalid=2905, Unknown=0, NotChecked=0, Total=3782 [2020-11-30 00:47:51,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13663 states. [2020-11-30 00:47:51,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13663 to 2724. [2020-11-30 00:47:51,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2724 states. [2020-11-30 00:47:51,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2724 states to 2724 states and 3349 transitions. [2020-11-30 00:47:51,667 INFO L78 Accepts]: Start accepts. Automaton has 2724 states and 3349 transitions. Word has length 238 [2020-11-30 00:47:51,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:47:51,667 INFO L481 AbstractCegarLoop]: Abstraction has 2724 states and 3349 transitions. [2020-11-30 00:47:51,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-30 00:47:51,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2724 states and 3349 transitions. [2020-11-30 00:47:51,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2020-11-30 00:47:51,671 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:47:51,671 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:47:51,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2020-11-30 00:47:51,872 INFO L429 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:47:51,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:47:51,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1042939045, now seen corresponding path program 1 times [2020-11-30 00:47:51,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:47:51,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535943221] [2020-11-30 00:47:51,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:47:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:52,255 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:47:52,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535943221] [2020-11-30 00:47:52,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647491676] [2020-11-30 00:47:52,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:47:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:47:52,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 00:47:52,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:47:52,945 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 16 proven. 21 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:47:52,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:47:52,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2020-11-30 00:47:52,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407584731] [2020-11-30 00:47:52,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-30 00:47:52,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:47:52,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-30 00:47:52,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2020-11-30 00:47:52,948 INFO L87 Difference]: Start difference. First operand 2724 states and 3349 transitions. Second operand 21 states. [2020-11-30 00:48:00,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:48:00,573 INFO L93 Difference]: Finished difference Result 25326 states and 31312 transitions. [2020-11-30 00:48:00,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2020-11-30 00:48:00,573 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 238 [2020-11-30 00:48:00,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:48:00,593 INFO L225 Difference]: With dead ends: 25326 [2020-11-30 00:48:00,593 INFO L226 Difference]: Without dead ends: 23179 [2020-11-30 00:48:00,602 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3432 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1884, Invalid=8216, Unknown=0, NotChecked=0, Total=10100 [2020-11-30 00:48:00,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23179 states. [2020-11-30 00:48:01,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23179 to 3842. [2020-11-30 00:48:01,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3842 states. [2020-11-30 00:48:01,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3842 states to 3842 states and 4732 transitions. [2020-11-30 00:48:01,342 INFO L78 Accepts]: Start accepts. Automaton has 3842 states and 4732 transitions. Word has length 238 [2020-11-30 00:48:01,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:48:01,342 INFO L481 AbstractCegarLoop]: Abstraction has 3842 states and 4732 transitions. [2020-11-30 00:48:01,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-30 00:48:01,343 INFO L276 IsEmpty]: Start isEmpty. Operand 3842 states and 4732 transitions. [2020-11-30 00:48:01,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2020-11-30 00:48:01,350 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:48:01,350 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:48:01,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2020-11-30 00:48:01,551 INFO L429 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:48:01,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:48:01,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1629215267, now seen corresponding path program 1 times [2020-11-30 00:48:01,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:48:01,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081681197] [2020-11-30 00:48:01,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:48:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:01,835 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2020-11-30 00:48:01,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081681197] [2020-11-30 00:48:01,836 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:48:01,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:48:01,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031258328] [2020-11-30 00:48:01,837 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:48:01,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:48:01,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:48:01,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:48:01,838 INFO L87 Difference]: Start difference. First operand 3842 states and 4732 transitions. Second operand 5 states. [2020-11-30 00:48:02,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:48:02,421 INFO L93 Difference]: Finished difference Result 7308 states and 9013 transitions. [2020-11-30 00:48:02,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:48:02,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 238 [2020-11-30 00:48:02,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:48:02,426 INFO L225 Difference]: With dead ends: 7308 [2020-11-30 00:48:02,426 INFO L226 Difference]: Without dead ends: 3922 [2020-11-30 00:48:02,430 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:48:02,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3922 states. [2020-11-30 00:48:02,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3922 to 3902. [2020-11-30 00:48:02,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3902 states. [2020-11-30 00:48:02,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3902 states to 3902 states and 4772 transitions. [2020-11-30 00:48:02,959 INFO L78 Accepts]: Start accepts. Automaton has 3902 states and 4772 transitions. Word has length 238 [2020-11-30 00:48:02,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:48:02,960 INFO L481 AbstractCegarLoop]: Abstraction has 3902 states and 4772 transitions. [2020-11-30 00:48:02,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:48:02,960 INFO L276 IsEmpty]: Start isEmpty. Operand 3902 states and 4772 transitions. [2020-11-30 00:48:02,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2020-11-30 00:48:02,966 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:48:02,966 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:48:02,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-11-30 00:48:02,967 INFO L429 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:48:02,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:48:02,967 INFO L82 PathProgramCache]: Analyzing trace with hash 161721903, now seen corresponding path program 1 times [2020-11-30 00:48:02,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:48:02,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811365617] [2020-11-30 00:48:02,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:48:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:03,295 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:48:03,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811365617] [2020-11-30 00:48:03,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956713271] [2020-11-30 00:48:03,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:48:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:03,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 00:48:03,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:48:03,804 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 24 proven. 20 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:48:03,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:48:03,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2020-11-30 00:48:03,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543058342] [2020-11-30 00:48:03,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-30 00:48:03,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:48:03,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-30 00:48:03,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-30 00:48:03,806 INFO L87 Difference]: Start difference. First operand 3902 states and 4772 transitions. Second operand 12 states. [2020-11-30 00:48:08,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:48:08,421 INFO L93 Difference]: Finished difference Result 21183 states and 26279 transitions. [2020-11-30 00:48:08,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-11-30 00:48:08,422 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 238 [2020-11-30 00:48:08,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:48:08,436 INFO L225 Difference]: With dead ends: 21183 [2020-11-30 00:48:08,436 INFO L226 Difference]: Without dead ends: 17965 [2020-11-30 00:48:08,440 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=369, Invalid=1191, Unknown=0, NotChecked=0, Total=1560 [2020-11-30 00:48:08,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17965 states. [2020-11-30 00:48:09,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17965 to 3917. [2020-11-30 00:48:09,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3917 states. [2020-11-30 00:48:09,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3917 states to 3917 states and 4792 transitions. [2020-11-30 00:48:09,076 INFO L78 Accepts]: Start accepts. Automaton has 3917 states and 4792 transitions. Word has length 238 [2020-11-30 00:48:09,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:48:09,077 INFO L481 AbstractCegarLoop]: Abstraction has 3917 states and 4792 transitions. [2020-11-30 00:48:09,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-30 00:48:09,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3917 states and 4792 transitions. [2020-11-30 00:48:09,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2020-11-30 00:48:09,085 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:48:09,085 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:48:09,300 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:48:09,301 INFO L429 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:48:09,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:48:09,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1744681363, now seen corresponding path program 1 times [2020-11-30 00:48:09,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:48:09,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933628885] [2020-11-30 00:48:09,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:48:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:09,548 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2020-11-30 00:48:09,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933628885] [2020-11-30 00:48:09,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:48:09,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:48:09,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436432515] [2020-11-30 00:48:09,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:48:09,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:48:09,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:48:09,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:48:09,552 INFO L87 Difference]: Start difference. First operand 3917 states and 4792 transitions. Second operand 5 states. [2020-11-30 00:48:10,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:48:10,255 INFO L93 Difference]: Finished difference Result 7433 states and 9113 transitions. [2020-11-30 00:48:10,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:48:10,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 238 [2020-11-30 00:48:10,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:48:10,259 INFO L225 Difference]: With dead ends: 7433 [2020-11-30 00:48:10,259 INFO L226 Difference]: Without dead ends: 3922 [2020-11-30 00:48:10,263 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:48:10,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3922 states. [2020-11-30 00:48:10,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3922 to 3902. [2020-11-30 00:48:10,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3902 states. [2020-11-30 00:48:10,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3902 states to 3902 states and 4772 transitions. [2020-11-30 00:48:10,881 INFO L78 Accepts]: Start accepts. Automaton has 3902 states and 4772 transitions. Word has length 238 [2020-11-30 00:48:10,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:48:10,881 INFO L481 AbstractCegarLoop]: Abstraction has 3902 states and 4772 transitions. [2020-11-30 00:48:10,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:48:10,881 INFO L276 IsEmpty]: Start isEmpty. Operand 3902 states and 4772 transitions. [2020-11-30 00:48:10,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2020-11-30 00:48:10,886 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:48:10,887 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:48:10,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-11-30 00:48:10,887 INFO L429 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:48:10,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:48:10,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1145420495, now seen corresponding path program 1 times [2020-11-30 00:48:10,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:48:10,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892585087] [2020-11-30 00:48:10,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:48:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:11,214 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 36 proven. 13 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2020-11-30 00:48:11,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892585087] [2020-11-30 00:48:11,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057900495] [2020-11-30 00:48:11,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:48:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:11,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 00:48:11,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:48:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2020-11-30 00:48:11,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 00:48:11,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2020-11-30 00:48:11,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912252618] [2020-11-30 00:48:11,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:48:11,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:48:11,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:48:11,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:48:11,621 INFO L87 Difference]: Start difference. First operand 3902 states and 4772 transitions. Second operand 4 states. [2020-11-30 00:48:12,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:48:12,131 INFO L93 Difference]: Finished difference Result 6618 states and 8049 transitions. [2020-11-30 00:48:12,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:48:12,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2020-11-30 00:48:12,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:48:12,134 INFO L225 Difference]: With dead ends: 6618 [2020-11-30 00:48:12,134 INFO L226 Difference]: Without dead ends: 3108 [2020-11-30 00:48:12,138 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-11-30 00:48:12,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3108 states. [2020-11-30 00:48:12,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3108 to 3108. [2020-11-30 00:48:12,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3108 states. [2020-11-30 00:48:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 3108 states and 3732 transitions. [2020-11-30 00:48:12,587 INFO L78 Accepts]: Start accepts. Automaton has 3108 states and 3732 transitions. Word has length 238 [2020-11-30 00:48:12,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:48:12,587 INFO L481 AbstractCegarLoop]: Abstraction has 3108 states and 3732 transitions. [2020-11-30 00:48:12,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:48:12,587 INFO L276 IsEmpty]: Start isEmpty. Operand 3108 states and 3732 transitions. [2020-11-30 00:48:12,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2020-11-30 00:48:12,591 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:48:12,591 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:48:12,791 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2020-11-30 00:48:12,792 INFO L429 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:48:12,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:48:12,793 INFO L82 PathProgramCache]: Analyzing trace with hash 131252421, now seen corresponding path program 1 times [2020-11-30 00:48:12,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:48:12,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870893966] [2020-11-30 00:48:12,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:48:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:13,094 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-11-30 00:48:13,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870893966] [2020-11-30 00:48:13,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:48:13,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:48:13,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899827743] [2020-11-30 00:48:13,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:48:13,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:48:13,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:48:13,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:48:13,096 INFO L87 Difference]: Start difference. First operand 3108 states and 3732 transitions. Second operand 5 states. [2020-11-30 00:48:13,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:48:13,593 INFO L93 Difference]: Finished difference Result 5926 states and 7129 transitions. [2020-11-30 00:48:13,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:48:13,594 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 239 [2020-11-30 00:48:13,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:48:13,598 INFO L225 Difference]: With dead ends: 5926 [2020-11-30 00:48:13,598 INFO L226 Difference]: Without dead ends: 3148 [2020-11-30 00:48:13,602 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:48:13,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3148 states. [2020-11-30 00:48:14,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3148 to 3123. [2020-11-30 00:48:14,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-11-30 00:48:14,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 3747 transitions. [2020-11-30 00:48:14,061 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 3747 transitions. Word has length 239 [2020-11-30 00:48:14,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:48:14,061 INFO L481 AbstractCegarLoop]: Abstraction has 3123 states and 3747 transitions. [2020-11-30 00:48:14,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:48:14,061 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 3747 transitions. [2020-11-30 00:48:14,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2020-11-30 00:48:14,065 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:48:14,066 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:48:14,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-11-30 00:48:14,066 INFO L429 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:48:14,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:48:14,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1014761411, now seen corresponding path program 1 times [2020-11-30 00:48:14,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:48:14,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641682672] [2020-11-30 00:48:14,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:48:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:14,428 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:48:14,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641682672] [2020-11-30 00:48:14,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311637747] [2020-11-30 00:48:14,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:48:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:14,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 997 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-30 00:48:14,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:48:14,908 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:48:14,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:48:14,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2020-11-30 00:48:14,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609725712] [2020-11-30 00:48:14,909 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-30 00:48:14,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:48:14,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-30 00:48:14,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-11-30 00:48:14,910 INFO L87 Difference]: Start difference. First operand 3123 states and 3747 transitions. Second operand 16 states. [2020-11-30 00:48:20,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:48:20,781 INFO L93 Difference]: Finished difference Result 18460 states and 22543 transitions. [2020-11-30 00:48:20,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2020-11-30 00:48:20,782 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 239 [2020-11-30 00:48:20,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:48:20,794 INFO L225 Difference]: With dead ends: 18460 [2020-11-30 00:48:20,794 INFO L226 Difference]: Without dead ends: 15894 [2020-11-30 00:48:20,798 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=877, Invalid=2905, Unknown=0, NotChecked=0, Total=3782 [2020-11-30 00:48:20,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15894 states. [2020-11-30 00:48:21,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15894 to 3108. [2020-11-30 00:48:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3108 states. [2020-11-30 00:48:21,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 3108 states and 3732 transitions. [2020-11-30 00:48:21,350 INFO L78 Accepts]: Start accepts. Automaton has 3108 states and 3732 transitions. Word has length 239 [2020-11-30 00:48:21,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:48:21,350 INFO L481 AbstractCegarLoop]: Abstraction has 3108 states and 3732 transitions. [2020-11-30 00:48:21,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-30 00:48:21,351 INFO L276 IsEmpty]: Start isEmpty. Operand 3108 states and 3732 transitions. [2020-11-30 00:48:21,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2020-11-30 00:48:21,354 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:48:21,355 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:48:21,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:48:21,556 INFO L429 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:48:21,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:48:21,556 INFO L82 PathProgramCache]: Analyzing trace with hash -925478781, now seen corresponding path program 1 times [2020-11-30 00:48:21,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:48:21,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093236267] [2020-11-30 00:48:21,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:48:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:21,878 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 29 proven. 13 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2020-11-30 00:48:21,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093236267] [2020-11-30 00:48:21,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075177864] [2020-11-30 00:48:21,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:48:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:22,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 00:48:22,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:48:22,333 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-11-30 00:48:22,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 00:48:22,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2020-11-30 00:48:22,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223944408] [2020-11-30 00:48:22,334 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:48:22,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:48:22,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:48:22,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:48:22,336 INFO L87 Difference]: Start difference. First operand 3108 states and 3732 transitions. Second operand 4 states. [2020-11-30 00:48:22,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:48:22,905 INFO L93 Difference]: Finished difference Result 5600 states and 6714 transitions. [2020-11-30 00:48:22,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:48:22,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2020-11-30 00:48:22,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:48:22,908 INFO L225 Difference]: With dead ends: 5600 [2020-11-30 00:48:22,908 INFO L226 Difference]: Without dead ends: 2800 [2020-11-30 00:48:22,911 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-11-30 00:48:22,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2800 states. [2020-11-30 00:48:23,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2800 to 2800. [2020-11-30 00:48:23,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2800 states. [2020-11-30 00:48:23,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2800 states to 2800 states and 3333 transitions. [2020-11-30 00:48:23,360 INFO L78 Accepts]: Start accepts. Automaton has 2800 states and 3333 transitions. Word has length 239 [2020-11-30 00:48:23,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:48:23,360 INFO L481 AbstractCegarLoop]: Abstraction has 2800 states and 3333 transitions. [2020-11-30 00:48:23,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:48:23,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2800 states and 3333 transitions. [2020-11-30 00:48:23,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2020-11-30 00:48:23,364 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:48:23,364 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:48:23,576 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2020-11-30 00:48:23,577 INFO L429 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:48:23,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:48:23,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1431537307, now seen corresponding path program 1 times [2020-11-30 00:48:23,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:48:23,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443216245] [2020-11-30 00:48:23,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:48:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:24,019 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:48:24,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443216245] [2020-11-30 00:48:24,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732068671] [2020-11-30 00:48:24,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:48:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:24,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 997 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 00:48:24,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:48:24,705 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 16 proven. 21 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:48:24,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:48:24,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2020-11-30 00:48:24,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047618275] [2020-11-30 00:48:24,706 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-30 00:48:24,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:48:24,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-30 00:48:24,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2020-11-30 00:48:24,707 INFO L87 Difference]: Start difference. First operand 2800 states and 3333 transitions. Second operand 21 states. [2020-11-30 00:48:33,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:48:33,134 INFO L93 Difference]: Finished difference Result 21660 states and 26003 transitions. [2020-11-30 00:48:33,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2020-11-30 00:48:33,135 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 239 [2020-11-30 00:48:33,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:48:33,150 INFO L225 Difference]: With dead ends: 21660 [2020-11-30 00:48:33,150 INFO L226 Difference]: Without dead ends: 19365 [2020-11-30 00:48:33,155 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3407 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1877, Invalid=8223, Unknown=0, NotChecked=0, Total=10100 [2020-11-30 00:48:33,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19365 states. [2020-11-30 00:48:33,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19365 to 2815. [2020-11-30 00:48:33,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2815 states. [2020-11-30 00:48:33,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 3353 transitions. [2020-11-30 00:48:33,786 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 3353 transitions. Word has length 239 [2020-11-30 00:48:33,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:48:33,786 INFO L481 AbstractCegarLoop]: Abstraction has 2815 states and 3353 transitions. [2020-11-30 00:48:33,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-30 00:48:33,786 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 3353 transitions. [2020-11-30 00:48:33,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2020-11-30 00:48:33,790 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:48:33,790 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:48:33,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2020-11-30 00:48:33,991 INFO L429 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:48:33,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:48:33,991 INFO L82 PathProgramCache]: Analyzing trace with hash 845261085, now seen corresponding path program 1 times [2020-11-30 00:48:33,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:48:33,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074614597] [2020-11-30 00:48:33,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:48:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:34,243 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2020-11-30 00:48:34,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074614597] [2020-11-30 00:48:34,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:48:34,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:48:34,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997051718] [2020-11-30 00:48:34,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:48:34,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:48:34,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:48:34,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:48:34,245 INFO L87 Difference]: Start difference. First operand 2815 states and 3353 transitions. Second operand 5 states. [2020-11-30 00:48:34,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:48:34,959 INFO L93 Difference]: Finished difference Result 5370 states and 6405 transitions. [2020-11-30 00:48:34,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:48:34,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 239 [2020-11-30 00:48:34,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:48:34,962 INFO L225 Difference]: With dead ends: 5370 [2020-11-30 00:48:34,962 INFO L226 Difference]: Without dead ends: 2880 [2020-11-30 00:48:34,964 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:48:34,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2020-11-30 00:48:35,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 2800. [2020-11-30 00:48:35,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2800 states. [2020-11-30 00:48:35,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2800 states to 2800 states and 3333 transitions. [2020-11-30 00:48:35,446 INFO L78 Accepts]: Start accepts. Automaton has 2800 states and 3333 transitions. Word has length 239 [2020-11-30 00:48:35,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:48:35,447 INFO L481 AbstractCegarLoop]: Abstraction has 2800 states and 3333 transitions. [2020-11-30 00:48:35,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:48:35,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2800 states and 3333 transitions. [2020-11-30 00:48:35,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2020-11-30 00:48:35,450 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:48:35,450 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:48:35,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2020-11-30 00:48:35,451 INFO L429 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:48:35,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:48:35,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1228583670, now seen corresponding path program 1 times [2020-11-30 00:48:35,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:48:35,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655255421] [2020-11-30 00:48:35,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:48:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:35,886 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:48:35,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655255421] [2020-11-30 00:48:35,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629970007] [2020-11-30 00:48:35,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:48:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:36,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 00:48:36,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:48:36,522 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 16 proven. 21 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:48:36,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:48:36,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2020-11-30 00:48:36,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107215125] [2020-11-30 00:48:36,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-30 00:48:36,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:48:36,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-30 00:48:36,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2020-11-30 00:48:36,524 INFO L87 Difference]: Start difference. First operand 2800 states and 3333 transitions. Second operand 21 states. [2020-11-30 00:48:45,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:48:45,161 INFO L93 Difference]: Finished difference Result 21660 states and 26003 transitions. [2020-11-30 00:48:45,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2020-11-30 00:48:45,161 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 240 [2020-11-30 00:48:45,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:48:45,175 INFO L225 Difference]: With dead ends: 21660 [2020-11-30 00:48:45,176 INFO L226 Difference]: Without dead ends: 19365 [2020-11-30 00:48:45,180 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3386 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1877, Invalid=8223, Unknown=0, NotChecked=0, Total=10100 [2020-11-30 00:48:45,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19365 states. [2020-11-30 00:48:45,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19365 to 2815. [2020-11-30 00:48:45,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2815 states. [2020-11-30 00:48:45,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 3353 transitions. [2020-11-30 00:48:45,767 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 3353 transitions. Word has length 240 [2020-11-30 00:48:45,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:48:45,768 INFO L481 AbstractCegarLoop]: Abstraction has 2815 states and 3353 transitions. [2020-11-30 00:48:45,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-30 00:48:45,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 3353 transitions. [2020-11-30 00:48:45,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2020-11-30 00:48:45,772 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:48:45,772 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:48:45,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2020-11-30 00:48:45,973 INFO L429 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:48:45,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:48:45,974 INFO L82 PathProgramCache]: Analyzing trace with hash 642307448, now seen corresponding path program 1 times [2020-11-30 00:48:45,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:48:45,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964827379] [2020-11-30 00:48:45,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:48:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:46,238 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2020-11-30 00:48:46,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964827379] [2020-11-30 00:48:46,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:48:46,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:48:46,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464802816] [2020-11-30 00:48:46,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:48:46,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:48:46,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:48:46,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:48:46,240 INFO L87 Difference]: Start difference. First operand 2815 states and 3353 transitions. Second operand 5 states. [2020-11-30 00:48:46,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:48:46,832 INFO L93 Difference]: Finished difference Result 5370 states and 6405 transitions. [2020-11-30 00:48:46,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:48:46,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2020-11-30 00:48:46,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:48:46,835 INFO L225 Difference]: With dead ends: 5370 [2020-11-30 00:48:46,836 INFO L226 Difference]: Without dead ends: 2880 [2020-11-30 00:48:46,837 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:48:46,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2020-11-30 00:48:47,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 2800. [2020-11-30 00:48:47,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2800 states. [2020-11-30 00:48:47,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2800 states to 2800 states and 3333 transitions. [2020-11-30 00:48:47,361 INFO L78 Accepts]: Start accepts. Automaton has 2800 states and 3333 transitions. Word has length 240 [2020-11-30 00:48:47,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:48:47,361 INFO L481 AbstractCegarLoop]: Abstraction has 2800 states and 3333 transitions. [2020-11-30 00:48:47,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:48:47,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2800 states and 3333 transitions. [2020-11-30 00:48:47,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2020-11-30 00:48:47,365 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:48:47,365 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:48:47,365 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2020-11-30 00:48:47,365 INFO L429 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:48:47,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:48:47,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1189320396, now seen corresponding path program 1 times [2020-11-30 00:48:47,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:48:47,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970450349] [2020-11-30 00:48:47,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:48:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:47,665 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 29 proven. 13 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2020-11-30 00:48:47,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970450349] [2020-11-30 00:48:47,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454305631] [2020-11-30 00:48:47,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:48:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:48,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 997 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 00:48:48,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:48:48,168 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2020-11-30 00:48:48,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 00:48:48,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2020-11-30 00:48:48,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073563716] [2020-11-30 00:48:48,170 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:48:48,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:48:48,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:48:48,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:48:48,171 INFO L87 Difference]: Start difference. First operand 2800 states and 3333 transitions. Second operand 4 states. [2020-11-30 00:48:48,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:48:48,646 INFO L93 Difference]: Finished difference Result 4379 states and 5213 transitions. [2020-11-30 00:48:48,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:48:48,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2020-11-30 00:48:48,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:48:48,648 INFO L225 Difference]: With dead ends: 4379 [2020-11-30 00:48:48,648 INFO L226 Difference]: Without dead ends: 1865 [2020-11-30 00:48:48,650 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-11-30 00:48:48,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2020-11-30 00:48:49,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1865. [2020-11-30 00:48:49,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1865 states. [2020-11-30 00:48:49,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 2201 transitions. [2020-11-30 00:48:49,036 INFO L78 Accepts]: Start accepts. Automaton has 1865 states and 2201 transitions. Word has length 240 [2020-11-30 00:48:49,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:48:49,037 INFO L481 AbstractCegarLoop]: Abstraction has 1865 states and 2201 transitions. [2020-11-30 00:48:49,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:48:49,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 2201 transitions. [2020-11-30 00:48:49,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2020-11-30 00:48:49,039 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:48:49,039 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:48:49,239 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2020-11-30 00:48:49,240 INFO L429 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:48:49,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:48:49,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1460985528, now seen corresponding path program 1 times [2020-11-30 00:48:49,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:48:49,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916071697] [2020-11-30 00:48:49,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:48:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:49,397 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2020-11-30 00:48:49,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916071697] [2020-11-30 00:48:49,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:48:49,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 00:48:49,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047325402] [2020-11-30 00:48:49,398 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:48:49,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:48:49,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:48:49,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:48:49,399 INFO L87 Difference]: Start difference. First operand 1865 states and 2201 transitions. Second operand 7 states. [2020-11-30 00:48:50,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:48:50,529 INFO L93 Difference]: Finished difference Result 4437 states and 5280 transitions. [2020-11-30 00:48:50,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 00:48:50,529 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 244 [2020-11-30 00:48:50,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:48:50,532 INFO L225 Difference]: With dead ends: 4437 [2020-11-30 00:48:50,532 INFO L226 Difference]: Without dead ends: 3007 [2020-11-30 00:48:50,534 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:48:50,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2020-11-30 00:48:50,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2072. [2020-11-30 00:48:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2072 states. [2020-11-30 00:48:50,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 2453 transitions. [2020-11-30 00:48:50,998 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 2453 transitions. Word has length 244 [2020-11-30 00:48:50,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:48:50,998 INFO L481 AbstractCegarLoop]: Abstraction has 2072 states and 2453 transitions. [2020-11-30 00:48:50,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:48:50,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 2453 transitions. [2020-11-30 00:48:51,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2020-11-30 00:48:51,000 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:48:51,001 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:48:51,001 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2020-11-30 00:48:51,001 INFO L429 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:48:51,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:48:51,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1495433335, now seen corresponding path program 1 times [2020-11-30 00:48:51,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:48:51,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028890554] [2020-11-30 00:48:51,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:48:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:51,164 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2020-11-30 00:48:51,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028890554] [2020-11-30 00:48:51,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:48:51,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 00:48:51,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303794963] [2020-11-30 00:48:51,165 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:48:51,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:48:51,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:48:51,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:48:51,166 INFO L87 Difference]: Start difference. First operand 2072 states and 2453 transitions. Second operand 7 states. [2020-11-30 00:48:52,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:48:52,196 INFO L93 Difference]: Finished difference Result 4719 states and 5619 transitions. [2020-11-30 00:48:52,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 00:48:52,198 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 246 [2020-11-30 00:48:52,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:48:52,201 INFO L225 Difference]: With dead ends: 4719 [2020-11-30 00:48:52,201 INFO L226 Difference]: Without dead ends: 3082 [2020-11-30 00:48:52,202 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:48:52,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3082 states. [2020-11-30 00:48:52,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082 to 2147. [2020-11-30 00:48:52,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2020-11-30 00:48:52,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 2540 transitions. [2020-11-30 00:48:52,636 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 2540 transitions. Word has length 246 [2020-11-30 00:48:52,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:48:52,637 INFO L481 AbstractCegarLoop]: Abstraction has 2147 states and 2540 transitions. [2020-11-30 00:48:52,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:48:52,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 2540 transitions. [2020-11-30 00:48:52,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2020-11-30 00:48:52,639 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:48:52,639 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:48:52,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2020-11-30 00:48:52,640 INFO L429 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:48:52,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:48:52,640 INFO L82 PathProgramCache]: Analyzing trace with hash -775971801, now seen corresponding path program 1 times [2020-11-30 00:48:52,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:48:52,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964765355] [2020-11-30 00:48:52,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:48:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2020-11-30 00:48:52,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964765355] [2020-11-30 00:48:52,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:48:52,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 00:48:52,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491642898] [2020-11-30 00:48:52,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:48:52,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:48:52,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:48:52,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:48:52,788 INFO L87 Difference]: Start difference. First operand 2147 states and 2540 transitions. Second operand 7 states. [2020-11-30 00:48:53,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:48:53,708 INFO L93 Difference]: Finished difference Result 4488 states and 5337 transitions. [2020-11-30 00:48:53,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:48:53,709 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 246 [2020-11-30 00:48:53,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:48:53,711 INFO L225 Difference]: With dead ends: 4488 [2020-11-30 00:48:53,711 INFO L226 Difference]: Without dead ends: 2776 [2020-11-30 00:48:53,713 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:48:53,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2020-11-30 00:48:54,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 2147. [2020-11-30 00:48:54,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2020-11-30 00:48:54,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 2537 transitions. [2020-11-30 00:48:54,227 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 2537 transitions. Word has length 246 [2020-11-30 00:48:54,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:48:54,228 INFO L481 AbstractCegarLoop]: Abstraction has 2147 states and 2537 transitions. [2020-11-30 00:48:54,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:48:54,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 2537 transitions. [2020-11-30 00:48:54,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2020-11-30 00:48:54,230 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:48:54,231 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:48:54,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2020-11-30 00:48:54,231 INFO L429 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:48:54,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:48:54,232 INFO L82 PathProgramCache]: Analyzing trace with hash -400513712, now seen corresponding path program 1 times [2020-11-30 00:48:54,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:48:54,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049736271] [2020-11-30 00:48:54,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:48:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:54,413 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2020-11-30 00:48:54,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049736271] [2020-11-30 00:48:54,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:48:54,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-30 00:48:54,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703480254] [2020-11-30 00:48:54,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 00:48:54,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:48:54,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 00:48:54,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:48:54,416 INFO L87 Difference]: Start difference. First operand 2147 states and 2537 transitions. Second operand 8 states. [2020-11-30 00:48:56,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:48:56,856 INFO L93 Difference]: Finished difference Result 6435 states and 7632 transitions. [2020-11-30 00:48:56,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-30 00:48:56,857 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 250 [2020-11-30 00:48:56,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:48:56,865 INFO L225 Difference]: With dead ends: 6435 [2020-11-30 00:48:56,866 INFO L226 Difference]: Without dead ends: 4723 [2020-11-30 00:48:56,868 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2020-11-30 00:48:56,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4723 states. [2020-11-30 00:48:57,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4723 to 2129. [2020-11-30 00:48:57,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2129 states. [2020-11-30 00:48:57,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 2129 states and 2513 transitions. [2020-11-30 00:48:57,402 INFO L78 Accepts]: Start accepts. Automaton has 2129 states and 2513 transitions. Word has length 250 [2020-11-30 00:48:57,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:48:57,402 INFO L481 AbstractCegarLoop]: Abstraction has 2129 states and 2513 transitions. [2020-11-30 00:48:57,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 00:48:57,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 2513 transitions. [2020-11-30 00:48:57,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2020-11-30 00:48:57,405 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:48:57,405 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:48:57,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2020-11-30 00:48:57,406 INFO L429 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:48:57,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:48:57,407 INFO L82 PathProgramCache]: Analyzing trace with hash 618484607, now seen corresponding path program 1 times [2020-11-30 00:48:57,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:48:57,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272690968] [2020-11-30 00:48:57,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:48:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:48:57,584 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2020-11-30 00:48:57,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272690968] [2020-11-30 00:48:57,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:48:57,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-30 00:48:57,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453950628] [2020-11-30 00:48:57,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 00:48:57,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:48:57,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 00:48:57,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:48:57,586 INFO L87 Difference]: Start difference. First operand 2129 states and 2513 transitions. Second operand 8 states. [2020-11-30 00:48:59,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:48:59,630 INFO L93 Difference]: Finished difference Result 5947 states and 7034 transitions. [2020-11-30 00:48:59,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 00:48:59,631 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 252 [2020-11-30 00:48:59,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:48:59,634 INFO L225 Difference]: With dead ends: 5947 [2020-11-30 00:48:59,634 INFO L226 Difference]: Without dead ends: 4253 [2020-11-30 00:48:59,636 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2020-11-30 00:48:59,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4253 states. [2020-11-30 00:49:00,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4253 to 2129. [2020-11-30 00:49:00,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2129 states. [2020-11-30 00:49:00,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 2129 states and 2510 transitions. [2020-11-30 00:49:00,170 INFO L78 Accepts]: Start accepts. Automaton has 2129 states and 2510 transitions. Word has length 252 [2020-11-30 00:49:00,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:49:00,170 INFO L481 AbstractCegarLoop]: Abstraction has 2129 states and 2510 transitions. [2020-11-30 00:49:00,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 00:49:00,170 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 2510 transitions. [2020-11-30 00:49:00,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2020-11-30 00:49:00,173 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:49:00,173 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:49:00,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2020-11-30 00:49:00,173 INFO L429 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:49:00,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:49:00,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1103648325, now seen corresponding path program 1 times [2020-11-30 00:49:00,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:49:00,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982802574] [2020-11-30 00:49:00,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:49:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:49:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2020-11-30 00:49:00,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982802574] [2020-11-30 00:49:00,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:49:00,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-30 00:49:00,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041141615] [2020-11-30 00:49:00,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 00:49:00,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:49:00,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 00:49:00,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:49:00,313 INFO L87 Difference]: Start difference. First operand 2129 states and 2510 transitions. Second operand 8 states. [2020-11-30 00:49:02,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:49:02,161 INFO L93 Difference]: Finished difference Result 5453 states and 6445 transitions. [2020-11-30 00:49:02,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 00:49:02,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 252 [2020-11-30 00:49:02,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:49:02,165 INFO L225 Difference]: With dead ends: 5453 [2020-11-30 00:49:02,165 INFO L226 Difference]: Without dead ends: 3759 [2020-11-30 00:49:02,166 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-11-30 00:49:02,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3759 states. [2020-11-30 00:49:02,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3759 to 2114. [2020-11-30 00:49:02,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2020-11-30 00:49:02,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 2489 transitions. [2020-11-30 00:49:02,682 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 2489 transitions. Word has length 252 [2020-11-30 00:49:02,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:49:02,682 INFO L481 AbstractCegarLoop]: Abstraction has 2114 states and 2489 transitions. [2020-11-30 00:49:02,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 00:49:02,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 2489 transitions. [2020-11-30 00:49:02,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2020-11-30 00:49:02,684 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:49:02,685 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:49:02,685 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2020-11-30 00:49:02,685 INFO L429 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:49:02,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:49:02,686 INFO L82 PathProgramCache]: Analyzing trace with hash -459842049, now seen corresponding path program 1 times [2020-11-30 00:49:02,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:49:02,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751622039] [2020-11-30 00:49:02,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:49:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:49:02,980 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:49:02,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751622039] [2020-11-30 00:49:02,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605924998] [2020-11-30 00:49:02,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:49:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:49:03,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 1044 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-30 00:49:03,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:49:03,567 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:49:03,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:49:03,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-11-30 00:49:03,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770828076] [2020-11-30 00:49:03,569 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-30 00:49:03,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:49:03,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-30 00:49:03,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2020-11-30 00:49:03,570 INFO L87 Difference]: Start difference. First operand 2114 states and 2489 transitions. Second operand 13 states. [2020-11-30 00:49:21,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:49:21,175 INFO L93 Difference]: Finished difference Result 13414 states and 15791 transitions. [2020-11-30 00:49:21,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 321 states. [2020-11-30 00:49:21,177 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 252 [2020-11-30 00:49:21,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:49:21,187 INFO L225 Difference]: With dead ends: 13414 [2020-11-30 00:49:21,187 INFO L226 Difference]: Without dead ends: 11735 [2020-11-30 00:49:21,199 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 277 SyntacticMatches, 1 SemanticMatches, 329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49497 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=8307, Invalid=100923, Unknown=0, NotChecked=0, Total=109230 [2020-11-30 00:49:21,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11735 states. [2020-11-30 00:49:22,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11735 to 2651. [2020-11-30 00:49:22,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2651 states. [2020-11-30 00:49:22,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2651 states to 2651 states and 3101 transitions. [2020-11-30 00:49:22,008 INFO L78 Accepts]: Start accepts. Automaton has 2651 states and 3101 transitions. Word has length 252 [2020-11-30 00:49:22,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:49:22,009 INFO L481 AbstractCegarLoop]: Abstraction has 2651 states and 3101 transitions. [2020-11-30 00:49:22,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-30 00:49:22,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2651 states and 3101 transitions. [2020-11-30 00:49:22,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2020-11-30 00:49:22,011 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:49:22,011 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:49:22,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2020-11-30 00:49:22,212 INFO L429 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:49:22,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:49:22,212 INFO L82 PathProgramCache]: Analyzing trace with hash 805908605, now seen corresponding path program 1 times [2020-11-30 00:49:22,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:49:22,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530203569] [2020-11-30 00:49:22,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:49:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:49:22,325 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2020-11-30 00:49:22,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530203569] [2020-11-30 00:49:22,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:49:22,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:49:22,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318304111] [2020-11-30 00:49:22,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:49:22,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:49:22,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:49:22,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:49:22,327 INFO L87 Difference]: Start difference. First operand 2651 states and 3101 transitions. Second operand 3 states. [2020-11-30 00:49:23,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:49:23,635 INFO L93 Difference]: Finished difference Result 5774 states and 6761 transitions. [2020-11-30 00:49:23,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:49:23,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2020-11-30 00:49:23,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:49:23,639 INFO L225 Difference]: With dead ends: 5774 [2020-11-30 00:49:23,639 INFO L226 Difference]: Without dead ends: 3654 [2020-11-30 00:49:23,640 INFO L677 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 [2020-11-30 00:49:23,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2020-11-30 00:49:24,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 2651. [2020-11-30 00:49:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2651 states. [2020-11-30 00:49:24,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2651 states to 2651 states and 3091 transitions. [2020-11-30 00:49:24,478 INFO L78 Accepts]: Start accepts. Automaton has 2651 states and 3091 transitions. Word has length 255 [2020-11-30 00:49:24,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:49:24,479 INFO L481 AbstractCegarLoop]: Abstraction has 2651 states and 3091 transitions. [2020-11-30 00:49:24,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:49:24,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2651 states and 3091 transitions. [2020-11-30 00:49:24,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2020-11-30 00:49:24,482 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:49:24,483 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:49:24,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2020-11-30 00:49:24,484 INFO L429 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:49:24,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:49:24,484 INFO L82 PathProgramCache]: Analyzing trace with hash 728411323, now seen corresponding path program 1 times [2020-11-30 00:49:24,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:49:24,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103632758] [2020-11-30 00:49:24,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:49:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:49:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2020-11-30 00:49:24,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103632758] [2020-11-30 00:49:24,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:49:24,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-30 00:49:24,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599181774] [2020-11-30 00:49:24,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 00:49:24,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:49:24,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 00:49:24,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:49:24,681 INFO L87 Difference]: Start difference. First operand 2651 states and 3091 transitions. Second operand 8 states. [2020-11-30 00:49:28,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:49:28,139 INFO L93 Difference]: Finished difference Result 8664 states and 10151 transitions. [2020-11-30 00:49:28,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-30 00:49:28,140 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 255 [2020-11-30 00:49:28,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:49:28,145 INFO L225 Difference]: With dead ends: 8664 [2020-11-30 00:49:28,146 INFO L226 Difference]: Without dead ends: 6479 [2020-11-30 00:49:28,148 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2020-11-30 00:49:28,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6479 states. [2020-11-30 00:49:28,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6479 to 2616. [2020-11-30 00:49:28,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2616 states. [2020-11-30 00:49:28,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2616 states to 2616 states and 3041 transitions. [2020-11-30 00:49:28,922 INFO L78 Accepts]: Start accepts. Automaton has 2616 states and 3041 transitions. Word has length 255 [2020-11-30 00:49:28,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:49:28,923 INFO L481 AbstractCegarLoop]: Abstraction has 2616 states and 3041 transitions. [2020-11-30 00:49:28,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 00:49:28,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 3041 transitions. [2020-11-30 00:49:28,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2020-11-30 00:49:28,925 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:49:28,926 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:49:28,926 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2020-11-30 00:49:28,926 INFO L429 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:49:28,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:49:28,926 INFO L82 PathProgramCache]: Analyzing trace with hash 208706706, now seen corresponding path program 1 times [2020-11-30 00:49:28,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:49:28,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930625248] [2020-11-30 00:49:28,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:49:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:49:29,111 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2020-11-30 00:49:29,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930625248] [2020-11-30 00:49:29,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:49:29,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-30 00:49:29,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706628605] [2020-11-30 00:49:29,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 00:49:29,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:49:29,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 00:49:29,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:49:29,114 INFO L87 Difference]: Start difference. First operand 2616 states and 3041 transitions. Second operand 8 states. [2020-11-30 00:49:31,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:49:31,458 INFO L93 Difference]: Finished difference Result 6595 states and 7713 transitions. [2020-11-30 00:49:31,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 00:49:31,459 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 256 [2020-11-30 00:49:31,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:49:31,462 INFO L225 Difference]: With dead ends: 6595 [2020-11-30 00:49:31,462 INFO L226 Difference]: Without dead ends: 4510 [2020-11-30 00:49:31,463 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2020-11-30 00:49:31,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2020-11-30 00:49:32,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 2591. [2020-11-30 00:49:32,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2591 states. [2020-11-30 00:49:32,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2591 states to 2591 states and 3001 transitions. [2020-11-30 00:49:32,263 INFO L78 Accepts]: Start accepts. Automaton has 2591 states and 3001 transitions. Word has length 256 [2020-11-30 00:49:32,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:49:32,263 INFO L481 AbstractCegarLoop]: Abstraction has 2591 states and 3001 transitions. [2020-11-30 00:49:32,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 00:49:32,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 3001 transitions. [2020-11-30 00:49:32,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2020-11-30 00:49:32,266 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:49:32,266 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:49:32,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2020-11-30 00:49:32,267 INFO L429 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:49:32,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:49:32,267 INFO L82 PathProgramCache]: Analyzing trace with hash -378099308, now seen corresponding path program 1 times [2020-11-30 00:49:32,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:49:32,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209760566] [2020-11-30 00:49:32,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:49:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:49:32,416 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2020-11-30 00:49:32,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209760566] [2020-11-30 00:49:32,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:49:32,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-30 00:49:32,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746188779] [2020-11-30 00:49:32,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 00:49:32,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:49:32,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 00:49:32,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:49:32,421 INFO L87 Difference]: Start difference. First operand 2591 states and 3001 transitions. Second operand 8 states. [2020-11-30 00:49:35,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:49:35,168 INFO L93 Difference]: Finished difference Result 7352 states and 8570 transitions. [2020-11-30 00:49:35,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 00:49:35,169 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 256 [2020-11-30 00:49:35,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:49:35,173 INFO L225 Difference]: With dead ends: 7352 [2020-11-30 00:49:35,173 INFO L226 Difference]: Without dead ends: 5292 [2020-11-30 00:49:35,175 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2020-11-30 00:49:35,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5292 states. [2020-11-30 00:49:36,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5292 to 2571. [2020-11-30 00:49:36,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2571 states. [2020-11-30 00:49:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 2971 transitions. [2020-11-30 00:49:36,026 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 2971 transitions. Word has length 256 [2020-11-30 00:49:36,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:49:36,026 INFO L481 AbstractCegarLoop]: Abstraction has 2571 states and 2971 transitions. [2020-11-30 00:49:36,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 00:49:36,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 2971 transitions. [2020-11-30 00:49:36,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2020-11-30 00:49:36,029 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:49:36,029 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:49:36,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2020-11-30 00:49:36,029 INFO L429 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:49:36,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:49:36,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1187445934, now seen corresponding path program 1 times [2020-11-30 00:49:36,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:49:36,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662973484] [2020-11-30 00:49:36,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:49:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:49:36,193 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2020-11-30 00:49:36,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662973484] [2020-11-30 00:49:36,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:49:36,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:49:36,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632649549] [2020-11-30 00:49:36,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:49:36,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:49:36,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:49:36,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:49:36,195 INFO L87 Difference]: Start difference. First operand 2571 states and 2971 transitions. Second operand 4 states. [2020-11-30 00:49:37,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:49:37,814 INFO L93 Difference]: Finished difference Result 5517 states and 6449 transitions. [2020-11-30 00:49:37,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:49:37,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2020-11-30 00:49:37,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:49:37,817 INFO L225 Difference]: With dead ends: 5517 [2020-11-30 00:49:37,817 INFO L226 Difference]: Without dead ends: 3477 [2020-11-30 00:49:37,819 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:49:37,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3477 states. [2020-11-30 00:49:38,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3477 to 2571. [2020-11-30 00:49:38,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2571 states. [2020-11-30 00:49:38,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 2961 transitions. [2020-11-30 00:49:38,580 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 2961 transitions. Word has length 256 [2020-11-30 00:49:38,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:49:38,580 INFO L481 AbstractCegarLoop]: Abstraction has 2571 states and 2961 transitions. [2020-11-30 00:49:38,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:49:38,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 2961 transitions. [2020-11-30 00:49:38,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2020-11-30 00:49:38,583 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:49:38,583 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:49:38,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2020-11-30 00:49:38,583 INFO L429 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:49:38,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:49:38,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1180564213, now seen corresponding path program 1 times [2020-11-30 00:49:38,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:49:38,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125477721] [2020-11-30 00:49:38,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:49:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:49:39,089 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:49:39,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125477721] [2020-11-30 00:49:39,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172073449] [2020-11-30 00:49:39,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:49:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:49:39,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-30 00:49:39,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:49:39,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:49:39,871 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:49:39,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:49:39,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2020-11-30 00:49:39,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081890989] [2020-11-30 00:49:39,872 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-30 00:49:39,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:49:39,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-30 00:49:39,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2020-11-30 00:49:39,872 INFO L87 Difference]: Start difference. First operand 2571 states and 2961 transitions. Second operand 15 states. [2020-11-30 00:49:45,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:49:45,425 INFO L93 Difference]: Finished difference Result 10332 states and 11932 transitions. [2020-11-30 00:49:45,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-11-30 00:49:45,426 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 256 [2020-11-30 00:49:45,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:49:45,433 INFO L225 Difference]: With dead ends: 10332 [2020-11-30 00:49:45,434 INFO L226 Difference]: Without dead ends: 8292 [2020-11-30 00:49:45,436 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=592, Invalid=1858, Unknown=0, NotChecked=0, Total=2450 [2020-11-30 00:49:45,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8292 states. [2020-11-30 00:49:46,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8292 to 3377. [2020-11-30 00:49:46,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3377 states. [2020-11-30 00:49:46,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 3377 states and 3879 transitions. [2020-11-30 00:49:46,707 INFO L78 Accepts]: Start accepts. Automaton has 3377 states and 3879 transitions. Word has length 256 [2020-11-30 00:49:46,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:49:46,707 INFO L481 AbstractCegarLoop]: Abstraction has 3377 states and 3879 transitions. [2020-11-30 00:49:46,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-30 00:49:46,707 INFO L276 IsEmpty]: Start isEmpty. Operand 3377 states and 3879 transitions. [2020-11-30 00:49:46,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2020-11-30 00:49:46,711 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:49:46,711 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:49:46,926 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:49:46,927 INFO L429 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:49:46,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:49:46,927 INFO L82 PathProgramCache]: Analyzing trace with hash 285258499, now seen corresponding path program 1 times [2020-11-30 00:49:46,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:49:46,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201614866] [2020-11-30 00:49:46,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:49:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:49:47,457 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:49:47,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201614866] [2020-11-30 00:49:47,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876898570] [2020-11-30 00:49:47,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:49:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:49:47,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 1063 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-30 00:49:47,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:49:47,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:49:50,050 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:49:50,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:49:50,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2020-11-30 00:49:50,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462718078] [2020-11-30 00:49:50,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-30 00:49:50,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:49:50,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-30 00:49:50,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2020-11-30 00:49:50,052 INFO L87 Difference]: Start difference. First operand 3377 states and 3879 transitions. Second operand 16 states. [2020-11-30 00:49:57,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:49:57,368 INFO L93 Difference]: Finished difference Result 12803 states and 14746 transitions. [2020-11-30 00:49:57,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-11-30 00:49:57,369 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 257 [2020-11-30 00:49:57,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:49:57,376 INFO L225 Difference]: With dead ends: 12803 [2020-11-30 00:49:57,376 INFO L226 Difference]: Without dead ends: 10023 [2020-11-30 00:49:57,378 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=609, Invalid=1941, Unknown=0, NotChecked=0, Total=2550 [2020-11-30 00:49:57,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10023 states. [2020-11-30 00:49:58,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10023 to 3377. [2020-11-30 00:49:58,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3377 states. [2020-11-30 00:49:58,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 3377 states and 3879 transitions. [2020-11-30 00:49:58,598 INFO L78 Accepts]: Start accepts. Automaton has 3377 states and 3879 transitions. Word has length 257 [2020-11-30 00:49:58,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:49:58,599 INFO L481 AbstractCegarLoop]: Abstraction has 3377 states and 3879 transitions. [2020-11-30 00:49:58,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-30 00:49:58,599 INFO L276 IsEmpty]: Start isEmpty. Operand 3377 states and 3879 transitions. [2020-11-30 00:49:58,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2020-11-30 00:49:58,602 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:49:58,602 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:49:58,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable75 [2020-11-30 00:49:58,802 INFO L429 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:49:58,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:49:58,803 INFO L82 PathProgramCache]: Analyzing trace with hash -340486810, now seen corresponding path program 1 times [2020-11-30 00:49:58,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:49:58,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606202389] [2020-11-30 00:49:58,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:49:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:49:59,281 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:49:59,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606202389] [2020-11-30 00:49:59,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963159735] [2020-11-30 00:49:59,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:49:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:49:59,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 1064 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-30 00:49:59,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:49:59,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:50:00,008 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:50:00,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:50:00,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2020-11-30 00:50:00,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129164318] [2020-11-30 00:50:00,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-30 00:50:00,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:50:00,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-30 00:50:00,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2020-11-30 00:50:00,009 INFO L87 Difference]: Start difference. First operand 3377 states and 3879 transitions. Second operand 16 states. [2020-11-30 00:50:05,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:50:05,775 INFO L93 Difference]: Finished difference Result 12369 states and 14248 transitions. [2020-11-30 00:50:05,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-11-30 00:50:05,776 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 258 [2020-11-30 00:50:05,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:50:05,783 INFO L225 Difference]: With dead ends: 12369 [2020-11-30 00:50:05,783 INFO L226 Difference]: Without dead ends: 9589 [2020-11-30 00:50:05,785 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 251 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=609, Invalid=1941, Unknown=0, NotChecked=0, Total=2550 [2020-11-30 00:50:05,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9589 states. [2020-11-30 00:50:06,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9589 to 3230. [2020-11-30 00:50:06,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3230 states. [2020-11-30 00:50:06,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3230 states to 3230 states and 3702 transitions. [2020-11-30 00:50:06,973 INFO L78 Accepts]: Start accepts. Automaton has 3230 states and 3702 transitions. Word has length 258 [2020-11-30 00:50:06,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:50:06,973 INFO L481 AbstractCegarLoop]: Abstraction has 3230 states and 3702 transitions. [2020-11-30 00:50:06,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-30 00:50:06,973 INFO L276 IsEmpty]: Start isEmpty. Operand 3230 states and 3702 transitions. [2020-11-30 00:50:06,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2020-11-30 00:50:06,978 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:50:06,978 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:50:07,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:50:07,193 INFO L429 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:50:07,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:50:07,193 INFO L82 PathProgramCache]: Analyzing trace with hash 900397750, now seen corresponding path program 1 times [2020-11-30 00:50:07,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:50:07,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592505511] [2020-11-30 00:50:07,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:50:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:50:07,590 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 31 proven. 13 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2020-11-30 00:50:07,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592505511] [2020-11-30 00:50:07,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661054300] [2020-11-30 00:50:07,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:50:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:50:07,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 1081 conjuncts, 35 conjunts are in the unsatisfiable core [2020-11-30 00:50:07,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:50:08,368 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 00:50:08,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:50:08,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16] total 23 [2020-11-30 00:50:08,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687163075] [2020-11-30 00:50:08,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-30 00:50:08,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:50:08,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-30 00:50:08,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2020-11-30 00:50:08,370 INFO L87 Difference]: Start difference. First operand 3230 states and 3702 transitions. Second operand 23 states. [2020-11-30 00:50:30,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:50:30,262 INFO L93 Difference]: Finished difference Result 22354 states and 25944 transitions. [2020-11-30 00:50:30,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2020-11-30 00:50:30,263 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 259 [2020-11-30 00:50:30,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:50:30,277 INFO L225 Difference]: With dead ends: 22354 [2020-11-30 00:50:30,277 INFO L226 Difference]: Without dead ends: 19637 [2020-11-30 00:50:30,281 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9881 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=4411, Invalid=26389, Unknown=0, NotChecked=0, Total=30800 [2020-11-30 00:50:30,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19637 states. [2020-11-30 00:50:32,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19637 to 4876. [2020-11-30 00:50:32,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4876 states. [2020-11-30 00:50:32,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4876 states to 4876 states and 5597 transitions. [2020-11-30 00:50:32,038 INFO L78 Accepts]: Start accepts. Automaton has 4876 states and 5597 transitions. Word has length 259 [2020-11-30 00:50:32,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:50:32,039 INFO L481 AbstractCegarLoop]: Abstraction has 4876 states and 5597 transitions. [2020-11-30 00:50:32,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-30 00:50:32,039 INFO L276 IsEmpty]: Start isEmpty. Operand 4876 states and 5597 transitions. [2020-11-30 00:50:32,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2020-11-30 00:50:32,042 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:50:32,042 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:50:32,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2020-11-30 00:50:32,243 INFO L429 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:50:32,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:50:32,243 INFO L82 PathProgramCache]: Analyzing trace with hash 157890383, now seen corresponding path program 1 times [2020-11-30 00:50:32,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:50:32,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613224304] [2020-11-30 00:50:32,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:50:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:50:32,337 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2020-11-30 00:50:32,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613224304] [2020-11-30 00:50:32,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:50:32,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:50:32,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493125989] [2020-11-30 00:50:32,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:50:32,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:50:32,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:50:32,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:50:32,339 INFO L87 Difference]: Start difference. First operand 4876 states and 5597 transitions. Second operand 3 states. [2020-11-30 00:50:33,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:50:33,876 INFO L93 Difference]: Finished difference Result 9338 states and 10708 transitions. [2020-11-30 00:50:33,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:50:33,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2020-11-30 00:50:33,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:50:33,879 INFO L225 Difference]: With dead ends: 9338 [2020-11-30 00:50:33,880 INFO L226 Difference]: Without dead ends: 4475 [2020-11-30 00:50:33,887 INFO L677 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 [2020-11-30 00:50:33,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4475 states. [2020-11-30 00:50:35,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4475 to 4475. [2020-11-30 00:50:35,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4475 states. [2020-11-30 00:50:35,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4475 states to 4475 states and 5117 transitions. [2020-11-30 00:50:35,405 INFO L78 Accepts]: Start accepts. Automaton has 4475 states and 5117 transitions. Word has length 263 [2020-11-30 00:50:35,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:50:35,405 INFO L481 AbstractCegarLoop]: Abstraction has 4475 states and 5117 transitions. [2020-11-30 00:50:35,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:50:35,405 INFO L276 IsEmpty]: Start isEmpty. Operand 4475 states and 5117 transitions. [2020-11-30 00:50:35,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2020-11-30 00:50:35,410 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:50:35,411 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:50:35,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2020-11-30 00:50:35,411 INFO L429 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:50:35,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:50:35,412 INFO L82 PathProgramCache]: Analyzing trace with hash -714118884, now seen corresponding path program 1 times [2020-11-30 00:50:35,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:50:35,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653350644] [2020-11-30 00:50:35,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:50:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:50:35,641 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 37 proven. 17 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2020-11-30 00:50:35,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653350644] [2020-11-30 00:50:35,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617989152] [2020-11-30 00:50:35,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:50:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:50:35,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 1102 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 00:50:35,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:50:36,054 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 39 proven. 20 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2020-11-30 00:50:36,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:50:36,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-11-30 00:50:36,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067635338] [2020-11-30 00:50:36,056 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 00:50:36,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:50:36,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 00:50:36,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-30 00:50:36,056 INFO L87 Difference]: Start difference. First operand 4475 states and 5117 transitions. Second operand 10 states. [2020-11-30 00:50:38,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:50:38,902 INFO L93 Difference]: Finished difference Result 10211 states and 11808 transitions. [2020-11-30 00:50:38,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-30 00:50:38,902 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 266 [2020-11-30 00:50:38,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:50:38,907 INFO L225 Difference]: With dead ends: 10211 [2020-11-30 00:50:38,907 INFO L226 Difference]: Without dead ends: 6358 [2020-11-30 00:50:38,909 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 265 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2020-11-30 00:50:38,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6358 states. [2020-11-30 00:50:40,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6358 to 4475. [2020-11-30 00:50:40,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4475 states. [2020-11-30 00:50:40,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4475 states to 4475 states and 5109 transitions. [2020-11-30 00:50:40,571 INFO L78 Accepts]: Start accepts. Automaton has 4475 states and 5109 transitions. Word has length 266 [2020-11-30 00:50:40,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:50:40,572 INFO L481 AbstractCegarLoop]: Abstraction has 4475 states and 5109 transitions. [2020-11-30 00:50:40,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 00:50:40,572 INFO L276 IsEmpty]: Start isEmpty. Operand 4475 states and 5109 transitions. [2020-11-30 00:50:40,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2020-11-30 00:50:40,576 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:50:40,576 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:50:40,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2020-11-30 00:50:40,777 INFO L429 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:50:40,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:50:40,777 INFO L82 PathProgramCache]: Analyzing trace with hash 696806879, now seen corresponding path program 1 times [2020-11-30 00:50:40,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:50:40,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135151450] [2020-11-30 00:50:40,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:50:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:50:41,099 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 44 proven. 21 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-11-30 00:50:41,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135151450] [2020-11-30 00:50:41,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728968296] [2020-11-30 00:50:41,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:50:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:50:41,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 1123 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 00:50:41,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:50:41,545 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 46 proven. 24 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2020-11-30 00:50:41,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:50:41,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-11-30 00:50:41,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506725901] [2020-11-30 00:50:41,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 00:50:41,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:50:41,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 00:50:41,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-30 00:50:41,548 INFO L87 Difference]: Start difference. First operand 4475 states and 5109 transitions. Second operand 10 states. [2020-11-30 00:50:45,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:50:45,885 INFO L93 Difference]: Finished difference Result 11854 states and 13809 transitions. [2020-11-30 00:50:45,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-30 00:50:45,886 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 273 [2020-11-30 00:50:45,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:50:45,892 INFO L225 Difference]: With dead ends: 11854 [2020-11-30 00:50:45,892 INFO L226 Difference]: Without dead ends: 8001 [2020-11-30 00:50:45,899 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 272 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2020-11-30 00:50:45,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8001 states. [2020-11-30 00:50:47,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8001 to 4475. [2020-11-30 00:50:47,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4475 states. [2020-11-30 00:50:47,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4475 states to 4475 states and 5101 transitions. [2020-11-30 00:50:47,774 INFO L78 Accepts]: Start accepts. Automaton has 4475 states and 5101 transitions. Word has length 273 [2020-11-30 00:50:47,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:50:47,774 INFO L481 AbstractCegarLoop]: Abstraction has 4475 states and 5101 transitions. [2020-11-30 00:50:47,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 00:50:47,774 INFO L276 IsEmpty]: Start isEmpty. Operand 4475 states and 5101 transitions. [2020-11-30 00:50:47,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2020-11-30 00:50:47,778 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:50:47,778 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:50:47,978 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:50:47,979 INFO L429 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:50:47,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:50:47,979 INFO L82 PathProgramCache]: Analyzing trace with hash 180129625, now seen corresponding path program 1 times [2020-11-30 00:50:47,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:50:47,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111791642] [2020-11-30 00:50:47,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:50:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:50:48,024 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:50:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:50:48,087 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:50:48,247 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:50:48,248 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 00:50:48,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2020-11-30 00:50:48,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 12:50:48 BoogieIcfgContainer [2020-11-30 00:50:48,611 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 00:50:48,612 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:50:48,612 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:50:48,613 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:50:48,613 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:46:58" (3/4) ... [2020-11-30 00:50:48,615 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 00:50:48,988 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_baf95149-d898-4bff-b5eb-25e246f84647/bin/uautomizer/witness.graphml [2020-11-30 00:50:48,988 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:50:48,990 INFO L168 Benchmark]: Toolchain (without parser) took 233200.95 ms. Allocated memory was 81.8 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 50.0 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 368.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:50:48,991 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 67.1 MB. Free memory was 29.8 MB in the beginning and 29.7 MB in the end (delta: 56.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:50:48,991 INFO L168 Benchmark]: CACSL2BoogieTranslator took 516.07 ms. Allocated memory is still 81.8 MB. Free memory was 49.7 MB in the beginning and 54.3 MB in the end (delta: -4.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 00:50:48,992 INFO L168 Benchmark]: Boogie Procedure Inliner took 128.24 ms. Allocated memory is still 81.8 MB. Free memory was 54.3 MB in the beginning and 47.7 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-30 00:50:48,992 INFO L168 Benchmark]: Boogie Preprocessor took 140.16 ms. Allocated memory is still 81.8 MB. Free memory was 47.6 MB in the beginning and 42.3 MB in the end (delta: 5.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 00:50:48,993 INFO L168 Benchmark]: RCFGBuilder took 2319.80 ms. Allocated memory was 81.8 MB in the beginning and 100.7 MB in the end (delta: 18.9 MB). Free memory was 42.3 MB in the beginning and 49.3 MB in the end (delta: -7.0 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.1 GB. [2020-11-30 00:50:48,993 INFO L168 Benchmark]: TraceAbstraction took 229711.53 ms. Allocated memory was 100.7 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 48.6 MB in the beginning and 1.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 276.5 MB. Max. memory is 16.1 GB. [2020-11-30 00:50:48,994 INFO L168 Benchmark]: Witness Printer took 376.36 ms. Allocated memory is still 2.2 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 71.3 MB). Peak memory consumption was 71.3 MB. Max. memory is 16.1 GB. [2020-11-30 00:50:48,996 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35 ms. Allocated memory is still 67.1 MB. Free memory was 29.8 MB in the beginning and 29.7 MB in the end (delta: 56.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 516.07 ms. Allocated memory is still 81.8 MB. Free memory was 49.7 MB in the beginning and 54.3 MB in the end (delta: -4.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 128.24 ms. Allocated memory is still 81.8 MB. Free memory was 54.3 MB in the beginning and 47.7 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 140.16 ms. Allocated memory is still 81.8 MB. Free memory was 47.6 MB in the beginning and 42.3 MB in the end (delta: 5.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2319.80 ms. Allocated memory was 81.8 MB in the beginning and 100.7 MB in the end (delta: 18.9 MB). Free memory was 42.3 MB in the beginning and 49.3 MB in the end (delta: -7.0 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 229711.53 ms. Allocated memory was 100.7 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 48.6 MB in the beginning and 1.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 276.5 MB. Max. memory is 16.1 GB. * Witness Printer took 376.36 ms. Allocated memory is still 2.2 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 71.3 MB). Peak memory consumption was 71.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L23] msg_t nomsg = (msg_t )-1; [L24] port_t g1v ; [L25] int8_t g1v_old ; [L26] int8_t g1v_new ; [L27] port_t g2v ; [L28] int8_t g2v_old ; [L29] int8_t g2v_new ; [L30] port_t g3v ; [L31] int8_t g3v_old ; [L32] int8_t g3v_new ; [L39] _Bool gate1Failed ; [L40] _Bool gate2Failed ; [L41] _Bool gate3Failed ; [L42] msg_t VALUE1 ; [L43] msg_t VALUE2 ; [L44] msg_t VALUE3 ; [L46] _Bool gate1Failed_History_0 ; [L47] _Bool gate1Failed_History_1 ; [L48] _Bool gate1Failed_History_2 ; [L49] _Bool gate2Failed_History_0 ; [L50] _Bool gate2Failed_History_1 ; [L51] _Bool gate2Failed_History_2 ; [L52] _Bool gate3Failed_History_0 ; [L53] _Bool gate3Failed_History_1 ; [L54] _Bool gate3Failed_History_2 ; [L55] int8_t votedValue_History_0 ; [L56] int8_t votedValue_History_1 ; [L57] int8_t votedValue_History_2 ; VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=0, votedValue_History_1=0, votedValue_History_2=0] [L475] int c1 ; [L476] int i2 ; [L479] c1 = 0 [L480] gate1Failed = __VERIFIER_nondet_bool() [L481] gate2Failed = __VERIFIER_nondet_bool() [L482] gate3Failed = __VERIFIER_nondet_bool() [L483] VALUE1 = __VERIFIER_nondet_char() [L484] VALUE2 = __VERIFIER_nondet_char() [L485] VALUE3 = __VERIFIER_nondet_char() [L486] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L487] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L488] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L489] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L490] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L491] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L492] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L493] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L494] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L495] votedValue_History_0 = __VERIFIER_nondet_char() [L496] votedValue_History_1 = __VERIFIER_nondet_char() [L497] votedValue_History_2 = __VERIFIER_nondet_char() [L206] int tmp ; [L207] int tmp___0 ; [L208] int tmp___1 ; [L209] int tmp___2 ; [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND TRUE history_id == 0 [L129] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L130] COND TRUE historyIndex == 0 [L131] return (gate1Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L76] tmp = (int )read_history_bool(0, 0) [L77] COND FALSE !(! (tmp == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND TRUE history_id == 0 [L129] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L130] COND TRUE historyIndex == 0 [L131] return (gate1Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L76] tmp = (int )read_history_bool(0, 0) [L77] COND FALSE !(! (tmp == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND TRUE history_id == 0 [L129] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L130] COND TRUE historyIndex == 0 [L131] return (gate1Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L76] tmp = (int )read_history_bool(0, 0) [L77] COND FALSE !(! (tmp == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND FALSE !(var < 3) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L101] return (1); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L212] tmp = add_history_type(0) [L213] COND FALSE !(! tmp) [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND TRUE history_id == 1 [L129] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L139] COND TRUE history_id == 1 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L140] COND TRUE historyIndex == 0 [L141] return (gate2Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND TRUE history_id == 1 [L129] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L139] COND TRUE history_id == 1 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L140] COND TRUE historyIndex == 0 [L141] return (gate2Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND TRUE history_id == 1 [L129] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L139] COND TRUE history_id == 1 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L140] COND TRUE historyIndex == 0 [L141] return (gate2Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND FALSE !(var < 3) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L101] return (1); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L216] tmp___0 = add_history_type(1) [L217] COND FALSE !(! tmp___0) [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L87] COND TRUE history_id == 2 [L129] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L139] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L149] COND TRUE history_id == 2 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L150] COND TRUE historyIndex == 0 [L151] return (gate3Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L87] COND TRUE history_id == 2 [L129] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L139] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L149] COND TRUE history_id == 2 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L150] COND TRUE historyIndex == 0 [L151] return (gate3Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L87] COND TRUE history_id == 2 [L129] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L139] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L149] COND TRUE history_id == 2 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L150] COND TRUE historyIndex == 0 [L151] return (gate3Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND FALSE !(var < 3) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L101] return (1); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L220] tmp___1 = add_history_type(2) [L221] COND FALSE !(! tmp___1) [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L87] COND FALSE !(history_id == 2) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L93] COND TRUE history_id == 3 [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L87] COND FALSE !(history_id == 2) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L93] COND TRUE history_id == 3 [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L87] COND FALSE !(history_id == 2) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L93] COND TRUE history_id == 3 [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND FALSE !(var < 3) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L101] return (1); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L224] tmp___2 = add_history_type(3) [L225] COND FALSE !(! tmp___2) [L228] return (1); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L498] i2 = init() [L37] COND FALSE !(!cond) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L500] g1v_old = nomsg [L501] g1v_new = nomsg [L502] g2v_old = nomsg [L503] g2v_new = nomsg [L504] g3v_old = nomsg [L505] g3v_new = nomsg [L506] i2 = 0 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L507] COND TRUE 1 [L341] int8_t next_state ; [L342] msg_t tmp ; [L343] int tmp___0 ; [L346] gate1Failed = __VERIFIER_nondet_bool() [L184] COND TRUE history_id == 0 [L185] gate1Failed_History_2 = gate1Failed_History_1 [L186] gate1Failed_History_1 = gate1Failed_History_0 [L187] gate1Failed_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L348] COND FALSE !(\read(gate1Failed)) [L352] tmp = __VERIFIER_nondet_char() [L353] next_state = tmp VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L354] COND FALSE !((int )next_state == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L357] COND TRUE (int )next_state == 1 [L358] tmp___0 = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L37] COND FALSE !(!cond) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L366] EXPR next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L366] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new [L372] int8_t next_state ; [L373] msg_t tmp ; [L374] int tmp___0 ; [L377] gate2Failed = __VERIFIER_nondet_bool() [L184] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L189] COND TRUE history_id == 1 [L190] gate2Failed_History_2 = gate2Failed_History_1 [L191] gate2Failed_History_1 = gate2Failed_History_0 [L192] gate2Failed_History_0 = buf VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L379] COND FALSE !(\read(gate2Failed)) [L383] tmp = __VERIFIER_nondet_char() [L384] next_state = tmp VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L385] COND TRUE (int )next_state == 0 [L386] tmp___0 = 1 VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L37] COND FALSE !(!cond) VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L397] EXPR next_state != nomsg && g2v_new == nomsg ? next_state : g2v_new VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L397] g2v_new = next_state != nomsg && g2v_new == nomsg ? next_state : g2v_new [L403] int8_t next_state ; [L404] msg_t tmp ; [L405] int tmp___0 ; [L408] gate3Failed = __VERIFIER_nondet_bool() [L184] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L189] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L194] COND TRUE history_id == 2 [L195] gate3Failed_History_2 = gate3Failed_History_1 [L196] gate3Failed_History_1 = gate3Failed_History_0 [L197] gate3Failed_History_0 = buf VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L410] COND FALSE !(\read(gate3Failed)) [L414] tmp = __VERIFIER_nondet_char() [L415] next_state = tmp VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L416] COND TRUE (int )next_state == 0 [L417] tmp___0 = 1 VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L37] COND FALSE !(!cond) VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L428] EXPR next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L428] g3v_new = next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new [L434] int8_t voted_value ; [L437] voted_value = nomsg [L438] VALUE1 = g1v_old [L439] g1v_old = nomsg [L440] VALUE2 = g2v_old [L441] g2v_old = nomsg [L442] VALUE3 = g3v_old [L443] g3v_old = nomsg VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L444] COND TRUE (int )VALUE1 == (int )VALUE2 VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L445] COND TRUE (int )VALUE1 == (int )nomsg [L446] voted_value = VALUE3 VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L169] COND TRUE history_id == 3 [L170] votedValue_History_2 = votedValue_History_1 [L171] votedValue_History_1 = votedValue_History_0 [L172] votedValue_History_0 = buf VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L513] g1v_old = g1v_new [L514] g1v_new = nomsg [L515] g2v_old = g2v_new [L516] g2v_new = nomsg [L517] g3v_old = g3v_new [L518] g3v_new = nomsg [L233] int tmp ; [L234] int temp_count ; [L235] int8_t tmp___0 ; [L236] int8_t tmp___1 ; [L237] int8_t tmp___2 ; [L238] _Bool tmp___3 ; [L239] _Bool tmp___4 ; [L240] _Bool tmp___5 ; [L241] int8_t tmp___6 ; [L242] _Bool tmp___7 ; [L243] _Bool tmp___8 ; [L244] _Bool tmp___9 ; [L245] int8_t tmp___10 ; [L246] int8_t tmp___11 ; [L247] int8_t tmp___12 ; [L248] int8_t tmp___13 ; [L249] int8_t tmp___14 ; VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L252] COND TRUE ! gate1Failed [L253] tmp = 1 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L37] COND FALSE !(!cond) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L129] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L130] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L133] COND TRUE historyIndex == 1 [L134] return (gate1Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L264] tmp___3 = read_history_bool(0, 1) [L265] COND TRUE ! tmp___3 [L129] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L139] COND TRUE history_id == 1 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L140] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L143] COND TRUE historyIndex == 1 [L144] return (gate2Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L266] tmp___4 = read_history_bool(1, 1) [L267] COND TRUE ! tmp___4 [L129] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L139] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L149] COND TRUE history_id == 2 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L150] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L153] COND TRUE historyIndex == 1 [L154] return (gate3Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L268] tmp___5 = read_history_bool(2, 1) [L269] COND TRUE ! tmp___5 [L270] temp_count = 0 [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L271] tmp___0 = read_history_int8(3, 0) [L272] COND TRUE (int )VALUE1 == (int )tmp___0 [L273] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L275] tmp___1 = read_history_int8(3, 0) [L276] COND TRUE (int )VALUE2 == (int )tmp___1 [L277] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L279] tmp___2 = read_history_int8(3, 0) [L280] COND TRUE (int )VALUE3 == (int )tmp___2 [L281] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L283] COND FALSE !((int )VALUE1 != (int )VALUE2) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L297] COND FALSE !(! (temp_count > 1)) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L110] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L113] COND TRUE historyIndex == 1 [L114] return (votedValue_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L303] tmp___10 = read_history_int8(3, 1) [L304] COND FALSE !((int )tmp___10 > -2) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L323] tmp___11 = read_history_int8(3, 0) [L324] COND FALSE !((int )tmp___11 != (int )nomsg) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L336] return (1); VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L519] c1 = check() [L531] COND FALSE !(! arg) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L507] COND TRUE 1 [L341] int8_t next_state ; [L342] msg_t tmp ; [L343] int tmp___0 ; [L346] gate1Failed = __VERIFIER_nondet_bool() [L184] COND TRUE history_id == 0 [L185] gate1Failed_History_2 = gate1Failed_History_1 [L186] gate1Failed_History_1 = gate1Failed_History_0 [L187] gate1Failed_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L348] COND FALSE !(\read(gate1Failed)) [L352] tmp = __VERIFIER_nondet_char() [L353] next_state = tmp VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L354] COND TRUE (int )next_state == 0 [L355] tmp___0 = 1 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L37] COND FALSE !(!cond) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L366] EXPR next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L366] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new [L372] int8_t next_state ; [L373] msg_t tmp ; [L374] int tmp___0 ; [L377] gate2Failed = __VERIFIER_nondet_bool() [L184] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L189] COND TRUE history_id == 1 [L190] gate2Failed_History_2 = gate2Failed_History_1 [L191] gate2Failed_History_1 = gate2Failed_History_0 [L192] gate2Failed_History_0 = buf VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L379] COND TRUE \read(gate2Failed) VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L380] EXPR nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L380] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L403] int8_t next_state ; [L404] msg_t tmp ; [L405] int tmp___0 ; [L408] gate3Failed = __VERIFIER_nondet_bool() [L184] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L189] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L194] COND TRUE history_id == 2 [L195] gate3Failed_History_2 = gate3Failed_History_1 [L196] gate3Failed_History_1 = gate3Failed_History_0 [L197] gate3Failed_History_0 = buf VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L410] COND TRUE \read(gate3Failed) VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L411] EXPR nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L411] g3v_new = nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new [L434] int8_t voted_value ; [L437] voted_value = nomsg [L438] VALUE1 = g1v_old [L439] g1v_old = nomsg [L440] VALUE2 = g2v_old [L441] g2v_old = nomsg [L442] VALUE3 = g3v_old [L443] g3v_old = nomsg VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L444] COND FALSE !((int )VALUE1 == (int )VALUE2) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L451] COND FALSE !((int )VALUE1 == (int )VALUE3) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L458] COND TRUE (int )VALUE1 != (int )nomsg [L459] voted_value = VALUE1 VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L169] COND TRUE history_id == 3 [L170] votedValue_History_2 = votedValue_History_1 [L171] votedValue_History_1 = votedValue_History_0 [L172] votedValue_History_0 = buf VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L513] g1v_old = g1v_new [L514] g1v_new = nomsg [L515] g2v_old = g2v_new [L516] g2v_new = nomsg [L517] g3v_old = g3v_new [L518] g3v_new = nomsg [L233] int tmp ; [L234] int temp_count ; [L235] int8_t tmp___0 ; [L236] int8_t tmp___1 ; [L237] int8_t tmp___2 ; [L238] _Bool tmp___3 ; [L239] _Bool tmp___4 ; [L240] _Bool tmp___5 ; [L241] int8_t tmp___6 ; [L242] _Bool tmp___7 ; [L243] _Bool tmp___8 ; [L244] _Bool tmp___9 ; [L245] int8_t tmp___10 ; [L246] int8_t tmp___11 ; [L247] int8_t tmp___12 ; [L248] int8_t tmp___13 ; [L249] int8_t tmp___14 ; VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L252] COND TRUE ! gate1Failed [L253] tmp = 1 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L37] COND FALSE !(!cond) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L129] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L133] COND TRUE historyIndex == 1 [L134] return (gate1Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L264] tmp___3 = read_history_bool(0, 1) [L265] COND TRUE ! tmp___3 [L129] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L139] COND TRUE history_id == 1 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L140] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L143] COND TRUE historyIndex == 1 [L144] return (gate2Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L266] tmp___4 = read_history_bool(1, 1) [L267] COND TRUE ! tmp___4 [L129] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L139] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L149] COND TRUE history_id == 2 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L150] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L153] COND TRUE historyIndex == 1 [L154] return (gate3Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L268] tmp___5 = read_history_bool(2, 1) [L269] COND TRUE ! tmp___5 [L270] temp_count = 0 [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L271] tmp___0 = read_history_int8(3, 0) [L272] COND TRUE (int )VALUE1 == (int )tmp___0 [L273] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L275] tmp___1 = read_history_int8(3, 0) [L276] COND FALSE !((int )VALUE2 == (int )tmp___1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L109] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L279] tmp___2 = read_history_int8(3, 0) [L280] COND FALSE !((int )VALUE3 == (int )tmp___2) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L283] COND TRUE (int )VALUE1 != (int )VALUE2 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L284] COND TRUE (int )VALUE1 != (int )VALUE3 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L285] COND FALSE !((int )VALUE2 != (int )VALUE3) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L297] COND TRUE ! (temp_count > 1) [L298] return (0); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L519] c1 = check() [L531] COND TRUE ! arg VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L3] __assert_fail("0", "pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c", 3, "reach_error") VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 557 locations, 37 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 229.2s, OverallIterations: 82, TraceHistogramMax: 3, AutomataDifference: 157.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 41366 SDtfs, 64180 SDslu, 163938 SDs, 0 SdLazy, 31755 SolverSat, 1075 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7838 GetRequests, 6127 SyntacticMatches, 7 SemanticMatches, 1704 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77377 ImplicationChecksByTransitivity, 43.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4876occurred in iteration=78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 30.8s AutomataMinimizationTime, 81 MinimizatonAttempts, 197637 StatesRemovedByMinimization, 71 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2.4s SsaConstructionTime, 6.5s SatisfiabilityAnalysisTime, 18.0s InterpolantComputationTime, 21556 NumberOfCodeBlocks, 21556 NumberOfCodeBlocksAsserted, 109 NumberOfCheckSat, 21159 ConstructedInterpolants, 96 QuantifiedInterpolants, 18917965 SizeOfPredicates, 123 NumberOfNonLiveVariables, 25242 ConjunctsInSsa, 312 ConjunctsInUnsatCore, 108 InterpolantComputations, 63 PerfectInterpolantSequences, 13079/13996 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...