./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 69874e26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2dc9288e-42ab-45f1-9070-ac5d16c58818/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_2dc9288e-42ab-45f1-9070-ac5d16c58818/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2dc9288e-42ab-45f1-9070-ac5d16c58818/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2dc9288e-42ab-45f1-9070-ac5d16c58818/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2dc9288e-42ab-45f1-9070-ac5d16c58818/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2dc9288e-42ab-45f1-9070-ac5d16c58818/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 a2cb7dd7cbe25a85ad6bdbcb76856248329abedc .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-69874e2 [2020-12-01 15:12:43,973 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 15:12:43,975 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 15:12:44,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 15:12:44,049 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 15:12:44,050 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 15:12:44,057 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 15:12:44,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 15:12:44,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 15:12:44,064 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 15:12:44,065 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 15:12:44,067 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 15:12:44,067 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 15:12:44,069 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 15:12:44,070 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 15:12:44,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 15:12:44,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 15:12:44,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 15:12:44,076 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 15:12:44,079 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 15:12:44,081 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 15:12:44,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 15:12:44,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 15:12:44,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 15:12:44,099 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 15:12:44,103 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 15:12:44,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 15:12:44,105 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 15:12:44,106 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 15:12:44,108 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 15:12:44,108 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 15:12:44,109 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 15:12:44,110 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 15:12:44,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 15:12:44,114 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 15:12:44,114 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 15:12:44,116 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 15:12:44,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 15:12:44,117 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 15:12:44,118 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 15:12:44,119 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 15:12:44,121 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2dc9288e-42ab-45f1-9070-ac5d16c58818/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-01 15:12:44,163 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 15:12:44,166 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 15:12:44,168 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 15:12:44,169 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 15:12:44,169 INFO L138 SettingsManager]: * Use SBE=true [2020-12-01 15:12:44,169 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 15:12:44,169 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 15:12:44,170 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 15:12:44,170 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 15:12:44,170 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 15:12:44,171 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 15:12:44,172 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 15:12:44,172 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 15:12:44,172 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 15:12:44,172 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 15:12:44,173 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 15:12:44,173 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 15:12:44,173 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 15:12:44,173 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-01 15:12:44,174 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 15:12:44,174 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-01 15:12:44,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-01 15:12:44,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 15:12:44,175 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 15:12:44,175 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 15:12:44,175 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-01 15:12:44,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 15:12:44,176 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 15:12:44,176 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-01 15:12:44,176 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_2dc9288e-42ab-45f1-9070-ac5d16c58818/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_2dc9288e-42ab-45f1-9070-ac5d16c58818/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 -> a2cb7dd7cbe25a85ad6bdbcb76856248329abedc [2020-12-01 15:12:44,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 15:12:44,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 15:12:44,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 15:12:44,500 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 15:12:44,502 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 15:12:44,503 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2dc9288e-42ab-45f1-9070-ac5d16c58818/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2020-12-01 15:12:44,582 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2dc9288e-42ab-45f1-9070-ac5d16c58818/bin/uautomizer/data/a8ae8c934/07d3c21b0b554321a2617f47ccdcb817/FLAG692e951e2 [2020-12-01 15:12:45,119 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 15:12:45,120 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2dc9288e-42ab-45f1-9070-ac5d16c58818/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2020-12-01 15:12:45,133 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2dc9288e-42ab-45f1-9070-ac5d16c58818/bin/uautomizer/data/a8ae8c934/07d3c21b0b554321a2617f47ccdcb817/FLAG692e951e2 [2020-12-01 15:12:45,442 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2dc9288e-42ab-45f1-9070-ac5d16c58818/bin/uautomizer/data/a8ae8c934/07d3c21b0b554321a2617f47ccdcb817 [2020-12-01 15:12:45,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 15:12:45,446 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 15:12:45,448 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 15:12:45,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 15:12:45,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 15:12:45,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:12:45" (1/1) ... [2020-12-01 15:12:45,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3ca32f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:12:45, skipping insertion in model container [2020-12-01 15:12:45,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:12:45" (1/1) ... [2020-12-01 15:12:45,472 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 15:12:45,543 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 15:12:45,858 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 15:12:45,869 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 15:12:45,933 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 15:12:45,968 INFO L208 MainTranslator]: Completed translation [2020-12-01 15:12:45,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:12:45 WrapperNode [2020-12-01 15:12:45,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 15:12:45,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 15:12:45,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 15:12:45,970 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 15:12:45,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:12:45" (1/1) ... [2020-12-01 15:12:45,992 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:12:45" (1/1) ... [2020-12-01 15:12:46,098 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 15:12:46,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 15:12:46,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 15:12:46,100 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 15:12:46,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:12:45" (1/1) ... [2020-12-01 15:12:46,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:12:45" (1/1) ... [2020-12-01 15:12:46,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:12:45" (1/1) ... [2020-12-01 15:12:46,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:12:45" (1/1) ... [2020-12-01 15:12:46,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:12:45" (1/1) ... [2020-12-01 15:12:46,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:12:45" (1/1) ... [2020-12-01 15:12:46,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:12:45" (1/1) ... [2020-12-01 15:12:46,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 15:12:46,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 15:12:46,238 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 15:12:46,238 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 15:12:46,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:12:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dc9288e-42ab-45f1-9070-ac5d16c58818/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-12-01 15:12:46,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 15:12:46,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 15:12:46,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 15:12:46,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 15:12:47,976 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 15:12:47,976 INFO L298 CfgBuilder]: Removed 247 assume(true) statements. [2020-12-01 15:12:47,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:12:47 BoogieIcfgContainer [2020-12-01 15:12:47,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 15:12:47,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-01 15:12:47,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-01 15:12:47,985 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-01 15:12:47,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 03:12:45" (1/3) ... [2020-12-01 15:12:47,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a90e59c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:12:47, skipping insertion in model container [2020-12-01 15:12:47,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:12:45" (2/3) ... [2020-12-01 15:12:47,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a90e59c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:12:47, skipping insertion in model container [2020-12-01 15:12:47,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:12:47" (3/3) ... [2020-12-01 15:12:47,988 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2020-12-01 15:12:48,002 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-01 15:12:48,007 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2020-12-01 15:12:48,019 INFO L253 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2020-12-01 15:12:48,050 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-01 15:12:48,050 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-01 15:12:48,050 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-01 15:12:48,050 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-01 15:12:48,050 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-01 15:12:48,050 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-01 15:12:48,051 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-01 15:12:48,051 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-01 15:12:48,084 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states. [2020-12-01 15:12:48,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-01 15:12:48,090 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:48,091 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:12:48,092 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-12-01 15:12:48,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:48,098 INFO L82 PathProgramCache]: Analyzing trace with hash 595705480, now seen corresponding path program 1 times [2020-12-01 15:12:48,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:48,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498252764] [2020-12-01 15:12:48,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:48,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:12:48,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498252764] [2020-12-01 15:12:48,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:12:48,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:12:48,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121813915] [2020-12-01 15:12:48,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:12:48,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:48,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:12:48,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:12:48,340 INFO L87 Difference]: Start difference. First operand 555 states. Second operand 3 states. [2020-12-01 15:12:48,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:48,627 INFO L93 Difference]: Finished difference Result 1281 states and 2094 transitions. [2020-12-01 15:12:48,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:12:48,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-12-01 15:12:48,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:48,662 INFO L225 Difference]: With dead ends: 1281 [2020-12-01 15:12:48,663 INFO L226 Difference]: Without dead ends: 720 [2020-12-01 15:12:48,694 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-12-01 15:12:48,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2020-12-01 15:12:48,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 454. [2020-12-01 15:12:48,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2020-12-01 15:12:48,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 709 transitions. [2020-12-01 15:12:48,763 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 709 transitions. Word has length 9 [2020-12-01 15:12:48,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:48,764 INFO L481 AbstractCegarLoop]: Abstraction has 454 states and 709 transitions. [2020-12-01 15:12:48,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:12:48,764 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 709 transitions. [2020-12-01 15:12:48,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-01 15:12:48,765 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:48,765 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:12:48,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-01 15:12:48,766 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-12-01 15:12:48,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:48,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1330220136, now seen corresponding path program 1 times [2020-12-01 15:12:48,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:48,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259550042] [2020-12-01 15:12:48,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:48,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:12:48,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259550042] [2020-12-01 15:12:48,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:12:48,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:12:48,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557986690] [2020-12-01 15:12:48,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:12:48,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:48,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:12:48,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:12:48,821 INFO L87 Difference]: Start difference. First operand 454 states and 709 transitions. Second operand 3 states. [2020-12-01 15:12:48,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:48,891 INFO L93 Difference]: Finished difference Result 1122 states and 1737 transitions. [2020-12-01 15:12:48,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:12:48,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-12-01 15:12:48,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:48,896 INFO L225 Difference]: With dead ends: 1122 [2020-12-01 15:12:48,896 INFO L226 Difference]: Without dead ends: 670 [2020-12-01 15:12:48,897 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-12-01 15:12:48,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2020-12-01 15:12:48,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 421. [2020-12-01 15:12:48,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-12-01 15:12:48,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 651 transitions. [2020-12-01 15:12:48,924 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 651 transitions. Word has length 10 [2020-12-01 15:12:48,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:48,925 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 651 transitions. [2020-12-01 15:12:48,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:12:48,925 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 651 transitions. [2020-12-01 15:12:48,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-01 15:12:48,926 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:48,927 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:12:48,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-01 15:12:48,927 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-12-01 15:12:48,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:48,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1243418079, now seen corresponding path program 1 times [2020-12-01 15:12:48,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:48,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108807449] [2020-12-01 15:12:48,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:48,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:12:48,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108807449] [2020-12-01 15:12:48,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:12:48,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:12:48,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525297766] [2020-12-01 15:12:48,976 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:12:48,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:48,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:12:48,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:12:48,978 INFO L87 Difference]: Start difference. First operand 421 states and 651 transitions. Second operand 3 states. [2020-12-01 15:12:49,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:49,034 INFO L93 Difference]: Finished difference Result 1241 states and 1924 transitions. [2020-12-01 15:12:49,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:12:49,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-12-01 15:12:49,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:49,040 INFO L225 Difference]: With dead ends: 1241 [2020-12-01 15:12:49,040 INFO L226 Difference]: Without dead ends: 830 [2020-12-01 15:12:49,041 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-12-01 15:12:49,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2020-12-01 15:12:49,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 425. [2020-12-01 15:12:49,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2020-12-01 15:12:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 655 transitions. [2020-12-01 15:12:49,057 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 655 transitions. Word has length 14 [2020-12-01 15:12:49,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:49,057 INFO L481 AbstractCegarLoop]: Abstraction has 425 states and 655 transitions. [2020-12-01 15:12:49,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:12:49,057 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 655 transitions. [2020-12-01 15:12:49,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-01 15:12:49,059 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:49,059 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:12:49,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-01 15:12:49,059 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-12-01 15:12:49,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:49,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1419090732, now seen corresponding path program 1 times [2020-12-01 15:12:49,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:49,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645847226] [2020-12-01 15:12:49,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:12:49,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645847226] [2020-12-01 15:12:49,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:12:49,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:12:49,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757338676] [2020-12-01 15:12:49,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:12:49,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:49,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:12:49,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:12:49,116 INFO L87 Difference]: Start difference. First operand 425 states and 655 transitions. Second operand 4 states. [2020-12-01 15:12:49,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:49,223 INFO L93 Difference]: Finished difference Result 1564 states and 2392 transitions. [2020-12-01 15:12:49,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:12:49,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-12-01 15:12:49,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:49,231 INFO L225 Difference]: With dead ends: 1564 [2020-12-01 15:12:49,231 INFO L226 Difference]: Without dead ends: 1153 [2020-12-01 15:12:49,233 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-12-01 15:12:49,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2020-12-01 15:12:49,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 427. [2020-12-01 15:12:49,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-12-01 15:12:49,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 657 transitions. [2020-12-01 15:12:49,251 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 657 transitions. Word has length 18 [2020-12-01 15:12:49,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:49,251 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 657 transitions. [2020-12-01 15:12:49,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:12:49,252 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 657 transitions. [2020-12-01 15:12:49,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-01 15:12:49,256 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:49,257 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-12-01 15:12:49,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-01 15:12:49,257 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-12-01 15:12:49,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:49,258 INFO L82 PathProgramCache]: Analyzing trace with hash 703965683, now seen corresponding path program 1 times [2020-12-01 15:12:49,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:49,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229159650] [2020-12-01 15:12:49,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:49,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:12:49,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229159650] [2020-12-01 15:12:49,363 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:12:49,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:12:49,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547406467] [2020-12-01 15:12:49,364 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:12:49,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:49,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:12:49,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:12:49,365 INFO L87 Difference]: Start difference. First operand 427 states and 657 transitions. Second operand 4 states. [2020-12-01 15:12:49,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:49,416 INFO L93 Difference]: Finished difference Result 904 states and 1380 transitions. [2020-12-01 15:12:49,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:12:49,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-12-01 15:12:49,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:49,424 INFO L225 Difference]: With dead ends: 904 [2020-12-01 15:12:49,424 INFO L226 Difference]: Without dead ends: 662 [2020-12-01 15:12:49,425 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-12-01 15:12:49,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-12-01 15:12:49,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 425. [2020-12-01 15:12:49,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2020-12-01 15:12:49,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 650 transitions. [2020-12-01 15:12:49,442 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 650 transitions. Word has length 19 [2020-12-01 15:12:49,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:49,443 INFO L481 AbstractCegarLoop]: Abstraction has 425 states and 650 transitions. [2020-12-01 15:12:49,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:12:49,443 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 650 transitions. [2020-12-01 15:12:49,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 15:12:49,444 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:49,444 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-12-01 15:12:49,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-01 15:12:49,445 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-12-01 15:12:49,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:49,445 INFO L82 PathProgramCache]: Analyzing trace with hash 628676147, now seen corresponding path program 1 times [2020-12-01 15:12:49,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:49,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694588706] [2020-12-01 15:12:49,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:49,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:12:49,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694588706] [2020-12-01 15:12:49,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769289465] [2020-12-01 15:12:49,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dc9288e-42ab-45f1-9070-ac5d16c58818/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-12-01 15:12:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:49,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-01 15:12:49,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:12:49,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:12:49,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-01 15:12:49,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-12-01 15:12:49,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123911944] [2020-12-01 15:12:49,693 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:12:49,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:49,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:12:49,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:12:49,695 INFO L87 Difference]: Start difference. First operand 425 states and 650 transitions. Second operand 5 states. [2020-12-01 15:12:49,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:49,816 INFO L93 Difference]: Finished difference Result 1655 states and 2545 transitions. [2020-12-01 15:12:49,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:12:49,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-12-01 15:12:49,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:49,828 INFO L225 Difference]: With dead ends: 1655 [2020-12-01 15:12:49,828 INFO L226 Difference]: Without dead ends: 1241 [2020-12-01 15:12:49,830 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-12-01 15:12:49,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2020-12-01 15:12:49,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 571. [2020-12-01 15:12:49,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2020-12-01 15:12:49,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 900 transitions. [2020-12-01 15:12:49,857 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 900 transitions. Word has length 21 [2020-12-01 15:12:49,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:49,857 INFO L481 AbstractCegarLoop]: Abstraction has 571 states and 900 transitions. [2020-12-01 15:12:49,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:12:49,858 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 900 transitions. [2020-12-01 15:12:49,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-01 15:12:49,859 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:49,859 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-12-01 15:12:50,078 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-12-01 15:12:50,079 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-12-01 15:12:50,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:50,080 INFO L82 PathProgramCache]: Analyzing trace with hash -837838367, now seen corresponding path program 2 times [2020-12-01 15:12:50,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:50,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873543943] [2020-12-01 15:12:50,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:50,155 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-01 15:12:50,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873543943] [2020-12-01 15:12:50,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:12:50,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:12:50,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134648289] [2020-12-01 15:12:50,157 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:12:50,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:50,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:12:50,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:12:50,158 INFO L87 Difference]: Start difference. First operand 571 states and 900 transitions. Second operand 3 states. [2020-12-01 15:12:50,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:50,230 INFO L93 Difference]: Finished difference Result 1299 states and 2027 transitions. [2020-12-01 15:12:50,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:12:50,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-12-01 15:12:50,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:50,236 INFO L225 Difference]: With dead ends: 1299 [2020-12-01 15:12:50,236 INFO L226 Difference]: Without dead ends: 766 [2020-12-01 15:12:50,237 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-12-01 15:12:50,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2020-12-01 15:12:50,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 520. [2020-12-01 15:12:50,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2020-12-01 15:12:50,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 806 transitions. [2020-12-01 15:12:50,256 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 806 transitions. Word has length 28 [2020-12-01 15:12:50,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:50,256 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 806 transitions. [2020-12-01 15:12:50,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:12:50,256 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 806 transitions. [2020-12-01 15:12:50,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-01 15:12:50,257 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:50,257 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-12-01 15:12:50,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-01 15:12:50,258 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-12-01 15:12:50,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:50,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1453457771, now seen corresponding path program 1 times [2020-12-01 15:12:50,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:50,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676131385] [2020-12-01 15:12:50,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:50,344 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-01 15:12:50,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676131385] [2020-12-01 15:12:50,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:12:50,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:12:50,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494514385] [2020-12-01 15:12:50,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:12:50,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:50,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:12:50,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:12:50,360 INFO L87 Difference]: Start difference. First operand 520 states and 806 transitions. Second operand 3 states. [2020-12-01 15:12:50,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:50,448 INFO L93 Difference]: Finished difference Result 1179 states and 1809 transitions. [2020-12-01 15:12:50,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:12:50,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-12-01 15:12:50,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:50,453 INFO L225 Difference]: With dead ends: 1179 [2020-12-01 15:12:50,453 INFO L226 Difference]: Without dead ends: 688 [2020-12-01 15:12:50,455 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-12-01 15:12:50,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2020-12-01 15:12:50,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 454. [2020-12-01 15:12:50,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2020-12-01 15:12:50,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 681 transitions. [2020-12-01 15:12:50,493 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 681 transitions. Word has length 28 [2020-12-01 15:12:50,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:50,493 INFO L481 AbstractCegarLoop]: Abstraction has 454 states and 681 transitions. [2020-12-01 15:12:50,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:12:50,494 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 681 transitions. [2020-12-01 15:12:50,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-01 15:12:50,495 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:50,495 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-12-01 15:12:50,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-01 15:12:50,496 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-12-01 15:12:50,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:50,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1581264384, now seen corresponding path program 1 times [2020-12-01 15:12:50,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:50,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613169440] [2020-12-01 15:12:50,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:50,542 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-01 15:12:50,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613169440] [2020-12-01 15:12:50,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:12:50,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:12:50,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480249805] [2020-12-01 15:12:50,544 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:12:50,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:50,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:12:50,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:12:50,545 INFO L87 Difference]: Start difference. First operand 454 states and 681 transitions. Second operand 4 states. [2020-12-01 15:12:50,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:50,606 INFO L93 Difference]: Finished difference Result 1090 states and 1641 transitions. [2020-12-01 15:12:50,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:12:50,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2020-12-01 15:12:50,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:50,611 INFO L225 Difference]: With dead ends: 1090 [2020-12-01 15:12:50,611 INFO L226 Difference]: Without dead ends: 680 [2020-12-01 15:12:50,613 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-12-01 15:12:50,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2020-12-01 15:12:50,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 454. [2020-12-01 15:12:50,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2020-12-01 15:12:50,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 679 transitions. [2020-12-01 15:12:50,631 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 679 transitions. Word has length 38 [2020-12-01 15:12:50,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:50,632 INFO L481 AbstractCegarLoop]: Abstraction has 454 states and 679 transitions. [2020-12-01 15:12:50,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:12:50,632 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 679 transitions. [2020-12-01 15:12:50,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-01 15:12:50,633 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:50,633 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-12-01 15:12:50,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-01 15:12:50,634 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-12-01 15:12:50,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:50,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1902944388, now seen corresponding path program 1 times [2020-12-01 15:12:50,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:50,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528248883] [2020-12-01 15:12:50,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:50,708 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-01 15:12:50,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528248883] [2020-12-01 15:12:50,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:12:50,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:12:50,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591626037] [2020-12-01 15:12:50,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:12:50,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:50,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:12:50,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:12:50,716 INFO L87 Difference]: Start difference. First operand 454 states and 679 transitions. Second operand 3 states. [2020-12-01 15:12:50,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:50,808 INFO L93 Difference]: Finished difference Result 1026 states and 1540 transitions. [2020-12-01 15:12:50,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:12:50,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-12-01 15:12:50,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:50,815 INFO L225 Difference]: With dead ends: 1026 [2020-12-01 15:12:50,815 INFO L226 Difference]: Without dead ends: 635 [2020-12-01 15:12:50,816 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-12-01 15:12:50,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-12-01 15:12:50,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 410. [2020-12-01 15:12:50,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2020-12-01 15:12:50,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 605 transitions. [2020-12-01 15:12:50,830 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 605 transitions. Word has length 50 [2020-12-01 15:12:50,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:50,833 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 605 transitions. [2020-12-01 15:12:50,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:12:50,833 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 605 transitions. [2020-12-01 15:12:50,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-01 15:12:50,834 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:50,835 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-12-01 15:12:50,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-01 15:12:50,835 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-12-01 15:12:50,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:50,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1215657471, now seen corresponding path program 1 times [2020-12-01 15:12:50,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:50,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815035561] [2020-12-01 15:12:50,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:50,903 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-01 15:12:50,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815035561] [2020-12-01 15:12:50,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:12:50,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:12:50,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616870359] [2020-12-01 15:12:50,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:12:50,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:50,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:12:50,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:12:50,905 INFO L87 Difference]: Start difference. First operand 410 states and 605 transitions. Second operand 3 states. [2020-12-01 15:12:50,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:50,971 INFO L93 Difference]: Finished difference Result 860 states and 1269 transitions. [2020-12-01 15:12:50,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:12:50,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-12-01 15:12:50,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:50,975 INFO L225 Difference]: With dead ends: 860 [2020-12-01 15:12:50,975 INFO L226 Difference]: Without dead ends: 505 [2020-12-01 15:12:50,976 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-12-01 15:12:50,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2020-12-01 15:12:50,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 366. [2020-12-01 15:12:50,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2020-12-01 15:12:50,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 517 transitions. [2020-12-01 15:12:50,989 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 517 transitions. Word has length 51 [2020-12-01 15:12:50,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:50,989 INFO L481 AbstractCegarLoop]: Abstraction has 366 states and 517 transitions. [2020-12-01 15:12:50,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:12:50,989 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 517 transitions. [2020-12-01 15:12:50,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-01 15:12:50,990 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:50,990 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-12-01 15:12:50,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-01 15:12:50,990 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-12-01 15:12:50,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:50,991 INFO L82 PathProgramCache]: Analyzing trace with hash -64177626, now seen corresponding path program 1 times [2020-12-01 15:12:50,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:50,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958041658] [2020-12-01 15:12:50,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:51,059 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-01 15:12:51,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958041658] [2020-12-01 15:12:51,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:12:51,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:12:51,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725334424] [2020-12-01 15:12:51,061 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:12:51,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:51,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:12:51,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:12:51,062 INFO L87 Difference]: Start difference. First operand 366 states and 517 transitions. Second operand 4 states. [2020-12-01 15:12:51,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:51,107 INFO L93 Difference]: Finished difference Result 868 states and 1248 transitions. [2020-12-01 15:12:51,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:12:51,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-12-01 15:12:51,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:51,112 INFO L225 Difference]: With dead ends: 868 [2020-12-01 15:12:51,112 INFO L226 Difference]: Without dead ends: 574 [2020-12-01 15:12:51,113 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-12-01 15:12:51,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-12-01 15:12:51,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 366. [2020-12-01 15:12:51,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2020-12-01 15:12:51,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 515 transitions. [2020-12-01 15:12:51,129 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 515 transitions. Word has length 62 [2020-12-01 15:12:51,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:51,130 INFO L481 AbstractCegarLoop]: Abstraction has 366 states and 515 transitions. [2020-12-01 15:12:51,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:12:51,130 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 515 transitions. [2020-12-01 15:12:51,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-01 15:12:51,131 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:51,131 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-12-01 15:12:51,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-01 15:12:51,132 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-12-01 15:12:51,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:51,133 INFO L82 PathProgramCache]: Analyzing trace with hash 461299335, now seen corresponding path program 1 times [2020-12-01 15:12:51,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:51,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840787107] [2020-12-01 15:12:51,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:51,234 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-12-01 15:12:51,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840787107] [2020-12-01 15:12:51,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200235657] [2020-12-01 15:12:51,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dc9288e-42ab-45f1-9070-ac5d16c58818/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-12-01 15:12:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:51,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-01 15:12:51,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:12:51,453 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-12-01 15:12:51,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-01 15:12:51,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-12-01 15:12:51,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071567424] [2020-12-01 15:12:51,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 15:12:51,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:51,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 15:12:51,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-01 15:12:51,462 INFO L87 Difference]: Start difference. First operand 366 states and 515 transitions. Second operand 6 states. [2020-12-01 15:12:51,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:51,554 INFO L93 Difference]: Finished difference Result 1414 states and 2021 transitions. [2020-12-01 15:12:51,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:12:51,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2020-12-01 15:12:51,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:51,561 INFO L225 Difference]: With dead ends: 1414 [2020-12-01 15:12:51,561 INFO L226 Difference]: Without dead ends: 1067 [2020-12-01 15:12:51,563 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-12-01 15:12:51,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2020-12-01 15:12:51,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 439. [2020-12-01 15:12:51,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2020-12-01 15:12:51,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 612 transitions. [2020-12-01 15:12:51,582 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 612 transitions. Word has length 76 [2020-12-01 15:12:51,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:51,583 INFO L481 AbstractCegarLoop]: Abstraction has 439 states and 612 transitions. [2020-12-01 15:12:51,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 15:12:51,583 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 612 transitions. [2020-12-01 15:12:51,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-12-01 15:12:51,584 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:51,584 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-12-01 15:12:51,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-12-01 15:12:51,810 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-12-01 15:12:51,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:51,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1414363196, now seen corresponding path program 2 times [2020-12-01 15:12:51,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:51,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234371422] [2020-12-01 15:12:51,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:51,920 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2020-12-01 15:12:51,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234371422] [2020-12-01 15:12:51,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:12:51,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:12:51,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706028662] [2020-12-01 15:12:51,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:12:51,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:51,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:12:51,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:12:51,926 INFO L87 Difference]: Start difference. First operand 439 states and 612 transitions. Second operand 3 states. [2020-12-01 15:12:51,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:51,976 INFO L93 Difference]: Finished difference Result 856 states and 1238 transitions. [2020-12-01 15:12:51,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:12:51,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2020-12-01 15:12:51,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:51,980 INFO L225 Difference]: With dead ends: 856 [2020-12-01 15:12:51,980 INFO L226 Difference]: Without dead ends: 559 [2020-12-01 15:12:51,981 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-12-01 15:12:51,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-12-01 15:12:51,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 395. [2020-12-01 15:12:51,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-12-01 15:12:51,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 554 transitions. [2020-12-01 15:12:52,000 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 554 transitions. Word has length 103 [2020-12-01 15:12:52,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:52,000 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 554 transitions. [2020-12-01 15:12:52,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:12:52,001 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 554 transitions. [2020-12-01 15:12:52,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-12-01 15:12:52,008 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:52,008 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-12-01 15:12:52,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-01 15:12:52,009 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-12-01 15:12:52,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:52,009 INFO L82 PathProgramCache]: Analyzing trace with hash -262724973, now seen corresponding path program 1 times [2020-12-01 15:12:52,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:52,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845445696] [2020-12-01 15:12:52,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2020-12-01 15:12:52,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845445696] [2020-12-01 15:12:52,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:12:52,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:12:52,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798626754] [2020-12-01 15:12:52,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:12:52,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:52,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:12:52,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:12:52,096 INFO L87 Difference]: Start difference. First operand 395 states and 554 transitions. Second operand 3 states. [2020-12-01 15:12:52,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:52,127 INFO L93 Difference]: Finished difference Result 568 states and 813 transitions. [2020-12-01 15:12:52,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:12:52,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2020-12-01 15:12:52,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:52,129 INFO L225 Difference]: With dead ends: 568 [2020-12-01 15:12:52,130 INFO L226 Difference]: Without dead ends: 311 [2020-12-01 15:12:52,132 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-12-01 15:12:52,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2020-12-01 15:12:52,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2020-12-01 15:12:52,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2020-12-01 15:12:52,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 431 transitions. [2020-12-01 15:12:52,148 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 431 transitions. Word has length 112 [2020-12-01 15:12:52,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:52,149 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 431 transitions. [2020-12-01 15:12:52,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:12:52,149 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 431 transitions. [2020-12-01 15:12:52,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-12-01 15:12:52,150 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:52,151 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-12-01 15:12:52,151 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-01 15:12:52,151 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-12-01 15:12:52,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:52,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1252211039, now seen corresponding path program 1 times [2020-12-01 15:12:52,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:52,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684606196] [2020-12-01 15:12:52,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:52,226 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2020-12-01 15:12:52,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684606196] [2020-12-01 15:12:52,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:12:52,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:12:52,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577257534] [2020-12-01 15:12:52,227 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:12:52,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:52,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:12:52,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:12:52,229 INFO L87 Difference]: Start difference. First operand 311 states and 431 transitions. Second operand 4 states. [2020-12-01 15:12:52,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:52,262 INFO L93 Difference]: Finished difference Result 483 states and 689 transitions. [2020-12-01 15:12:52,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:12:52,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2020-12-01 15:12:52,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:52,265 INFO L225 Difference]: With dead ends: 483 [2020-12-01 15:12:52,265 INFO L226 Difference]: Without dead ends: 311 [2020-12-01 15:12:52,265 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-12-01 15:12:52,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2020-12-01 15:12:52,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2020-12-01 15:12:52,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2020-12-01 15:12:52,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 428 transitions. [2020-12-01 15:12:52,286 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 428 transitions. Word has length 115 [2020-12-01 15:12:52,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:52,287 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 428 transitions. [2020-12-01 15:12:52,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:12:52,287 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 428 transitions. [2020-12-01 15:12:52,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-12-01 15:12:52,288 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:52,289 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-12-01 15:12:52,289 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-01 15:12:52,289 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-12-01 15:12:52,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:52,290 INFO L82 PathProgramCache]: Analyzing trace with hash 501578938, now seen corresponding path program 1 times [2020-12-01 15:12:52,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:52,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514933673] [2020-12-01 15:12:52,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:52,368 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-12-01 15:12:52,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514933673] [2020-12-01 15:12:52,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:12:52,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:12:52,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849522618] [2020-12-01 15:12:52,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:12:52,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:52,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:12:52,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:12:52,371 INFO L87 Difference]: Start difference. First operand 311 states and 428 transitions. Second operand 3 states. [2020-12-01 15:12:52,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:52,407 INFO L93 Difference]: Finished difference Result 612 states and 885 transitions. [2020-12-01 15:12:52,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:12:52,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2020-12-01 15:12:52,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:52,411 INFO L225 Difference]: With dead ends: 612 [2020-12-01 15:12:52,411 INFO L226 Difference]: Without dead ends: 445 [2020-12-01 15:12:52,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-12-01 15:12:52,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2020-12-01 15:12:52,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 306. [2020-12-01 15:12:52,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2020-12-01 15:12:52,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 420 transitions. [2020-12-01 15:12:52,431 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 420 transitions. Word has length 126 [2020-12-01 15:12:52,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:52,432 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 420 transitions. [2020-12-01 15:12:52,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:12:52,432 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 420 transitions. [2020-12-01 15:12:52,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-12-01 15:12:52,434 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:52,434 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-12-01 15:12:52,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-01 15:12:52,435 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-12-01 15:12:52,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:52,435 INFO L82 PathProgramCache]: Analyzing trace with hash 562455808, now seen corresponding path program 1 times [2020-12-01 15:12:52,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:52,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467476921] [2020-12-01 15:12:52,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:52,508 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-12-01 15:12:52,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467476921] [2020-12-01 15:12:52,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:12:52,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:12:52,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054382969] [2020-12-01 15:12:52,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:12:52,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:52,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:12:52,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:12:52,513 INFO L87 Difference]: Start difference. First operand 306 states and 420 transitions. Second operand 3 states. [2020-12-01 15:12:52,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:52,542 INFO L93 Difference]: Finished difference Result 593 states and 856 transitions. [2020-12-01 15:12:52,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:12:52,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2020-12-01 15:12:52,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:52,546 INFO L225 Difference]: With dead ends: 593 [2020-12-01 15:12:52,546 INFO L226 Difference]: Without dead ends: 431 [2020-12-01 15:12:52,548 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-12-01 15:12:52,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2020-12-01 15:12:52,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 302. [2020-12-01 15:12:52,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2020-12-01 15:12:52,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 413 transitions. [2020-12-01 15:12:52,562 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 413 transitions. Word has length 131 [2020-12-01 15:12:52,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:52,563 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 413 transitions. [2020-12-01 15:12:52,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:12:52,563 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 413 transitions. [2020-12-01 15:12:52,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-12-01 15:12:52,565 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:52,565 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-12-01 15:12:52,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-01 15:12:52,566 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-12-01 15:12:52,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:52,566 INFO L82 PathProgramCache]: Analyzing trace with hash 475553694, now seen corresponding path program 1 times [2020-12-01 15:12:52,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:52,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900636964] [2020-12-01 15:12:52,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:52,668 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-12-01 15:12:52,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900636964] [2020-12-01 15:12:52,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:12:52,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:12:52,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707552750] [2020-12-01 15:12:52,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:12:52,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:52,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:12:52,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:12:52,671 INFO L87 Difference]: Start difference. First operand 302 states and 413 transitions. Second operand 3 states. [2020-12-01 15:12:52,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:52,697 INFO L93 Difference]: Finished difference Result 458 states and 649 transitions. [2020-12-01 15:12:52,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:12:52,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2020-12-01 15:12:52,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:52,700 INFO L225 Difference]: With dead ends: 458 [2020-12-01 15:12:52,700 INFO L226 Difference]: Without dead ends: 300 [2020-12-01 15:12:52,701 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-12-01 15:12:52,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2020-12-01 15:12:52,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 299. [2020-12-01 15:12:52,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-12-01 15:12:52,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 407 transitions. [2020-12-01 15:12:52,715 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 407 transitions. Word has length 137 [2020-12-01 15:12:52,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:52,715 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 407 transitions. [2020-12-01 15:12:52,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:12:52,715 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 407 transitions. [2020-12-01 15:12:52,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-12-01 15:12:52,717 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:52,717 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] [2020-12-01 15:12:52,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-01 15:12:52,718 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-12-01 15:12:52,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:52,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1872473539, now seen corresponding path program 1 times [2020-12-01 15:12:52,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:52,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805618257] [2020-12-01 15:12:52,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:52,795 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-12-01 15:12:52,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805618257] [2020-12-01 15:12:52,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:12:52,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:12:52,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742498678] [2020-12-01 15:12:52,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:12:52,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:52,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:12:52,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:12:52,797 INFO L87 Difference]: Start difference. First operand 299 states and 407 transitions. Second operand 3 states. [2020-12-01 15:12:52,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:52,810 INFO L93 Difference]: Finished difference Result 500 states and 708 transitions. [2020-12-01 15:12:52,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:12:52,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2020-12-01 15:12:52,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:52,813 INFO L225 Difference]: With dead ends: 500 [2020-12-01 15:12:52,814 INFO L226 Difference]: Without dead ends: 345 [2020-12-01 15:12:52,814 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-12-01 15:12:52,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2020-12-01 15:12:52,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 296. [2020-12-01 15:12:52,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-12-01 15:12:52,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 403 transitions. [2020-12-01 15:12:52,827 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 403 transitions. Word has length 144 [2020-12-01 15:12:52,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:52,827 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 403 transitions. [2020-12-01 15:12:52,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:12:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 403 transitions. [2020-12-01 15:12:52,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-12-01 15:12:52,829 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:52,829 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, 1] [2020-12-01 15:12:52,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-01 15:12:52,830 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-12-01 15:12:52,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:52,830 INFO L82 PathProgramCache]: Analyzing trace with hash 2083787767, now seen corresponding path program 1 times [2020-12-01 15:12:52,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:52,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077997372] [2020-12-01 15:12:52,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:52,939 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-12-01 15:12:52,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077997372] [2020-12-01 15:12:52,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:12:52,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:12:52,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285093530] [2020-12-01 15:12:52,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:12:52,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:52,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:12:52,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:12:52,942 INFO L87 Difference]: Start difference. First operand 296 states and 403 transitions. Second operand 3 states. [2020-12-01 15:12:52,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:52,969 INFO L93 Difference]: Finished difference Result 478 states and 668 transitions. [2020-12-01 15:12:52,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:12:52,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2020-12-01 15:12:52,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:52,972 INFO L225 Difference]: With dead ends: 478 [2020-12-01 15:12:52,972 INFO L226 Difference]: Without dead ends: 296 [2020-12-01 15:12:52,973 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-12-01 15:12:52,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-12-01 15:12:52,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2020-12-01 15:12:52,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-12-01 15:12:52,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 400 transitions. [2020-12-01 15:12:52,987 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 400 transitions. Word has length 147 [2020-12-01 15:12:52,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:52,987 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 400 transitions. [2020-12-01 15:12:52,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:12:52,988 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 400 transitions. [2020-12-01 15:12:52,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-12-01 15:12:52,989 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:52,990 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] [2020-12-01 15:12:52,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-01 15:12:52,990 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-12-01 15:12:52,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:52,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1747264437, now seen corresponding path program 1 times [2020-12-01 15:12:52,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:52,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529481968] [2020-12-01 15:12:52,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-12-01 15:12:53,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529481968] [2020-12-01 15:12:53,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:12:53,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:12:53,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886376308] [2020-12-01 15:12:53,158 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:12:53,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:53,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:12:53,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:12:53,159 INFO L87 Difference]: Start difference. First operand 296 states and 400 transitions. Second operand 4 states. [2020-12-01 15:12:53,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:53,264 INFO L93 Difference]: Finished difference Result 624 states and 885 transitions. [2020-12-01 15:12:53,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:12:53,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2020-12-01 15:12:53,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:53,267 INFO L225 Difference]: With dead ends: 624 [2020-12-01 15:12:53,267 INFO L226 Difference]: Without dead ends: 472 [2020-12-01 15:12:53,269 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-12-01 15:12:53,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2020-12-01 15:12:53,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 378. [2020-12-01 15:12:53,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-12-01 15:12:53,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 518 transitions. [2020-12-01 15:12:53,288 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 518 transitions. Word has length 159 [2020-12-01 15:12:53,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:53,289 INFO L481 AbstractCegarLoop]: Abstraction has 378 states and 518 transitions. [2020-12-01 15:12:53,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:12:53,289 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 518 transitions. [2020-12-01 15:12:53,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-12-01 15:12:53,291 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:53,291 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] [2020-12-01 15:12:53,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-01 15:12:53,292 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-12-01 15:12:53,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:53,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1373332782, now seen corresponding path program 1 times [2020-12-01 15:12:53,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:53,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28435896] [2020-12-01 15:12:53,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:53,399 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-12-01 15:12:53,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28435896] [2020-12-01 15:12:53,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:12:53,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:12:53,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3375582] [2020-12-01 15:12:53,400 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:12:53,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:53,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:12:53,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:12:53,403 INFO L87 Difference]: Start difference. First operand 378 states and 518 transitions. Second operand 3 states. [2020-12-01 15:12:53,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:53,461 INFO L93 Difference]: Finished difference Result 783 states and 1118 transitions. [2020-12-01 15:12:53,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:12:53,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2020-12-01 15:12:53,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:53,465 INFO L225 Difference]: With dead ends: 783 [2020-12-01 15:12:53,466 INFO L226 Difference]: Without dead ends: 587 [2020-12-01 15:12:53,466 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-12-01 15:12:53,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-12-01 15:12:53,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 448. [2020-12-01 15:12:53,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2020-12-01 15:12:53,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 617 transitions. [2020-12-01 15:12:53,496 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 617 transitions. Word has length 176 [2020-12-01 15:12:53,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:53,497 INFO L481 AbstractCegarLoop]: Abstraction has 448 states and 617 transitions. [2020-12-01 15:12:53,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:12:53,497 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 617 transitions. [2020-12-01 15:12:53,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-12-01 15:12:53,499 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:53,499 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] [2020-12-01 15:12:53,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-01 15:12:53,500 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-12-01 15:12:53,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:53,500 INFO L82 PathProgramCache]: Analyzing trace with hash 914197344, now seen corresponding path program 1 times [2020-12-01 15:12:53,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:53,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883074336] [2020-12-01 15:12:53,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:53,634 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-12-01 15:12:53,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883074336] [2020-12-01 15:12:53,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:12:53,634 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:12:53,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429310843] [2020-12-01 15:12:53,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:12:53,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:53,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:12:53,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:12:53,636 INFO L87 Difference]: Start difference. First operand 448 states and 617 transitions. Second operand 3 states. [2020-12-01 15:12:53,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:53,698 INFO L93 Difference]: Finished difference Result 932 states and 1331 transitions. [2020-12-01 15:12:53,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:12:53,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2020-12-01 15:12:53,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:53,703 INFO L225 Difference]: With dead ends: 932 [2020-12-01 15:12:53,703 INFO L226 Difference]: Without dead ends: 693 [2020-12-01 15:12:53,704 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-12-01 15:12:53,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2020-12-01 15:12:53,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 542. [2020-12-01 15:12:53,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2020-12-01 15:12:53,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 751 transitions. [2020-12-01 15:12:53,743 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 751 transitions. Word has length 177 [2020-12-01 15:12:53,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:53,743 INFO L481 AbstractCegarLoop]: Abstraction has 542 states and 751 transitions. [2020-12-01 15:12:53,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:12:53,743 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 751 transitions. [2020-12-01 15:12:53,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-12-01 15:12:53,746 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:53,746 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-12-01 15:12:53,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-01 15:12:53,746 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-12-01 15:12:53,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:53,747 INFO L82 PathProgramCache]: Analyzing trace with hash -130058217, now seen corresponding path program 1 times [2020-12-01 15:12:53,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:53,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083431286] [2020-12-01 15:12:53,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:53,859 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-12-01 15:12:53,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083431286] [2020-12-01 15:12:53,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:12:53,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:12:53,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021192297] [2020-12-01 15:12:53,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:12:53,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:53,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:12:53,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:12:53,861 INFO L87 Difference]: Start difference. First operand 542 states and 751 transitions. Second operand 3 states. [2020-12-01 15:12:53,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:53,926 INFO L93 Difference]: Finished difference Result 1108 states and 1589 transitions. [2020-12-01 15:12:53,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:12:53,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2020-12-01 15:12:53,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:53,931 INFO L225 Difference]: With dead ends: 1108 [2020-12-01 15:12:53,932 INFO L226 Difference]: Without dead ends: 805 [2020-12-01 15:12:53,932 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-12-01 15:12:53,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2020-12-01 15:12:53,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 628. [2020-12-01 15:12:53,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2020-12-01 15:12:53,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 879 transitions. [2020-12-01 15:12:53,974 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 879 transitions. Word has length 178 [2020-12-01 15:12:53,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:53,974 INFO L481 AbstractCegarLoop]: Abstraction has 628 states and 879 transitions. [2020-12-01 15:12:53,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:12:53,975 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 879 transitions. [2020-12-01 15:12:53,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-12-01 15:12:53,977 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:53,977 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-12-01 15:12:53,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-01 15:12:53,978 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-12-01 15:12:53,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:53,978 INFO L82 PathProgramCache]: Analyzing trace with hash 292643609, now seen corresponding path program 1 times [2020-12-01 15:12:53,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:53,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138467769] [2020-12-01 15:12:53,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:54,092 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2020-12-01 15:12:54,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138467769] [2020-12-01 15:12:54,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208793119] [2020-12-01 15:12:54,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dc9288e-42ab-45f1-9070-ac5d16c58818/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-12-01 15:12:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:54,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-01 15:12:54,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:12:54,501 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-12-01 15:12:54,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-01 15:12:54,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-12-01 15:12:54,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179802489] [2020-12-01 15:12:54,502 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:12:54,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:54,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:12:54,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:12:54,503 INFO L87 Difference]: Start difference. First operand 628 states and 879 transitions. Second operand 3 states. [2020-12-01 15:12:54,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:54,596 INFO L93 Difference]: Finished difference Result 1256 states and 1747 transitions. [2020-12-01 15:12:54,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:12:54,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2020-12-01 15:12:54,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:54,601 INFO L225 Difference]: With dead ends: 1256 [2020-12-01 15:12:54,602 INFO L226 Difference]: Without dead ends: 875 [2020-12-01 15:12:54,603 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 179 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-12-01 15:12:54,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2020-12-01 15:12:54,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 628. [2020-12-01 15:12:54,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2020-12-01 15:12:54,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 870 transitions. [2020-12-01 15:12:54,646 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 870 transitions. Word has length 178 [2020-12-01 15:12:54,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:54,646 INFO L481 AbstractCegarLoop]: Abstraction has 628 states and 870 transitions. [2020-12-01 15:12:54,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:12:54,647 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 870 transitions. [2020-12-01 15:12:54,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-12-01 15:12:54,649 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:54,649 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-12-01 15:12:54,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-12-01 15:12:54,874 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-12-01 15:12:54,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:54,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1978687721, now seen corresponding path program 1 times [2020-12-01 15:12:54,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:54,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322850631] [2020-12-01 15:12:54,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:54,962 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2020-12-01 15:12:54,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322850631] [2020-12-01 15:12:54,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761704779] [2020-12-01 15:12:54,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dc9288e-42ab-45f1-9070-ac5d16c58818/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-12-01 15:12:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:55,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-01 15:12:55,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:12:55,300 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-12-01 15:12:55,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-01 15:12:55,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-12-01 15:12:55,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434198986] [2020-12-01 15:12:55,301 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:12:55,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:55,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:12:55,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:12:55,302 INFO L87 Difference]: Start difference. First operand 628 states and 870 transitions. Second operand 3 states. [2020-12-01 15:12:55,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:55,421 INFO L93 Difference]: Finished difference Result 1481 states and 2092 transitions. [2020-12-01 15:12:55,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:12:55,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2020-12-01 15:12:55,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:55,428 INFO L225 Difference]: With dead ends: 1481 [2020-12-01 15:12:55,428 INFO L226 Difference]: Without dead ends: 1100 [2020-12-01 15:12:55,429 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 180 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-12-01 15:12:55,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2020-12-01 15:12:55,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 628. [2020-12-01 15:12:55,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2020-12-01 15:12:55,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 869 transitions. [2020-12-01 15:12:55,474 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 869 transitions. Word has length 179 [2020-12-01 15:12:55,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:55,475 INFO L481 AbstractCegarLoop]: Abstraction has 628 states and 869 transitions. [2020-12-01 15:12:55,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:12:55,475 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 869 transitions. [2020-12-01 15:12:55,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-12-01 15:12:55,477 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:55,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] [2020-12-01 15:12:55,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-01 15:12:55,698 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-12-01 15:12:55,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:55,698 INFO L82 PathProgramCache]: Analyzing trace with hash 700998875, now seen corresponding path program 1 times [2020-12-01 15:12:55,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:55,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824291401] [2020-12-01 15:12:55,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:55,845 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-12-01 15:12:55,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824291401] [2020-12-01 15:12:55,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:12:55,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:12:55,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695351327] [2020-12-01 15:12:55,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:12:55,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:55,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:12:55,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:12:55,847 INFO L87 Difference]: Start difference. First operand 628 states and 869 transitions. Second operand 3 states. [2020-12-01 15:12:55,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:55,886 INFO L93 Difference]: Finished difference Result 1011 states and 1430 transitions. [2020-12-01 15:12:55,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:12:55,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2020-12-01 15:12:55,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:55,891 INFO L225 Difference]: With dead ends: 1011 [2020-12-01 15:12:55,891 INFO L226 Difference]: Without dead ends: 610 [2020-12-01 15:12:55,892 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-12-01 15:12:55,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-12-01 15:12:55,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2020-12-01 15:12:55,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2020-12-01 15:12:55,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 835 transitions. [2020-12-01 15:12:55,927 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 835 transitions. Word has length 180 [2020-12-01 15:12:55,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:55,928 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 835 transitions. [2020-12-01 15:12:55,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:12:55,928 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 835 transitions. [2020-12-01 15:12:55,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-12-01 15:12:55,930 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:55,930 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-12-01 15:12:55,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-01 15:12:55,931 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-12-01 15:12:55,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:55,931 INFO L82 PathProgramCache]: Analyzing trace with hash 772458455, now seen corresponding path program 1 times [2020-12-01 15:12:55,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:55,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181228134] [2020-12-01 15:12:55,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:56,058 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2020-12-01 15:12:56,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181228134] [2020-12-01 15:12:56,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136071188] [2020-12-01 15:12:56,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dc9288e-42ab-45f1-9070-ac5d16c58818/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-12-01 15:12:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:56,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-01 15:12:56,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:12:56,396 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:12:56,428 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-12-01 15:12:56,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-01 15:12:56,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2020-12-01 15:12:56,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172672425] [2020-12-01 15:12:56,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:12:56,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:56,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:12:56,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-01 15:12:56,431 INFO L87 Difference]: Start difference. First operand 610 states and 835 transitions. Second operand 5 states. [2020-12-01 15:12:56,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:56,638 INFO L93 Difference]: Finished difference Result 1581 states and 2220 transitions. [2020-12-01 15:12:56,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-01 15:12:56,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2020-12-01 15:12:56,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:56,647 INFO L225 Difference]: With dead ends: 1581 [2020-12-01 15:12:56,647 INFO L226 Difference]: Without dead ends: 1579 [2020-12-01 15:12:56,648 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-12-01 15:12:56,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2020-12-01 15:12:56,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 612. [2020-12-01 15:12:56,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2020-12-01 15:12:56,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 837 transitions. [2020-12-01 15:12:56,706 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 837 transitions. Word has length 180 [2020-12-01 15:12:56,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:56,707 INFO L481 AbstractCegarLoop]: Abstraction has 612 states and 837 transitions. [2020-12-01 15:12:56,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:12:56,707 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 837 transitions. [2020-12-01 15:12:56,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2020-12-01 15:12:56,709 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:56,710 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] [2020-12-01 15:12:56,924 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2020-12-01 15:12:56,924 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-12-01 15:12:56,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:56,925 INFO L82 PathProgramCache]: Analyzing trace with hash 168018617, now seen corresponding path program 1 times [2020-12-01 15:12:56,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:56,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278233918] [2020-12-01 15:12:56,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:57,143 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-12-01 15:12:57,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278233918] [2020-12-01 15:12:57,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:12:57,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-01 15:12:57,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923173825] [2020-12-01 15:12:57,144 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-01 15:12:57,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:57,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-01 15:12:57,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-01 15:12:57,145 INFO L87 Difference]: Start difference. First operand 612 states and 837 transitions. Second operand 9 states. [2020-12-01 15:12:57,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:57,645 INFO L93 Difference]: Finished difference Result 2633 states and 3697 transitions. [2020-12-01 15:12:57,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-01 15:12:57,646 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 183 [2020-12-01 15:12:57,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:57,658 INFO L225 Difference]: With dead ends: 2633 [2020-12-01 15:12:57,658 INFO L226 Difference]: Without dead ends: 2264 [2020-12-01 15:12:57,660 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-12-01 15:12:57,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2020-12-01 15:12:57,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 820. [2020-12-01 15:12:57,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2020-12-01 15:12:57,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1105 transitions. [2020-12-01 15:12:57,729 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1105 transitions. Word has length 183 [2020-12-01 15:12:57,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:57,730 INFO L481 AbstractCegarLoop]: Abstraction has 820 states and 1105 transitions. [2020-12-01 15:12:57,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-01 15:12:57,730 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1105 transitions. [2020-12-01 15:12:57,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2020-12-01 15:12:57,732 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:57,733 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] [2020-12-01 15:12:57,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-01 15:12:57,733 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-12-01 15:12:57,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:57,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1111845061, now seen corresponding path program 1 times [2020-12-01 15:12:57,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:57,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595482070] [2020-12-01 15:12:57,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:57,806 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-12-01 15:12:57,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595482070] [2020-12-01 15:12:57,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:12:57,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:12:57,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624529502] [2020-12-01 15:12:57,808 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:12:57,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:57,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:12:57,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:12:57,808 INFO L87 Difference]: Start difference. First operand 820 states and 1105 transitions. Second operand 3 states. [2020-12-01 15:12:57,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:57,977 INFO L93 Difference]: Finished difference Result 1825 states and 2496 transitions. [2020-12-01 15:12:57,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:12:57,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2020-12-01 15:12:57,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:57,985 INFO L225 Difference]: With dead ends: 1825 [2020-12-01 15:12:57,985 INFO L226 Difference]: Without dead ends: 1456 [2020-12-01 15:12:57,986 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-12-01 15:12:57,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2020-12-01 15:12:58,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 820. [2020-12-01 15:12:58,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2020-12-01 15:12:58,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1103 transitions. [2020-12-01 15:12:58,049 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1103 transitions. Word has length 183 [2020-12-01 15:12:58,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:58,049 INFO L481 AbstractCegarLoop]: Abstraction has 820 states and 1103 transitions. [2020-12-01 15:12:58,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:12:58,049 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1103 transitions. [2020-12-01 15:12:58,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-12-01 15:12:58,052 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:58,052 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] [2020-12-01 15:12:58,053 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-01 15:12:58,053 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-12-01 15:12:58,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:58,054 INFO L82 PathProgramCache]: Analyzing trace with hash -43840079, now seen corresponding path program 1 times [2020-12-01 15:12:58,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:58,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451481728] [2020-12-01 15:12:58,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:58,125 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-12-01 15:12:58,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451481728] [2020-12-01 15:12:58,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:12:58,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:12:58,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428042136] [2020-12-01 15:12:58,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:12:58,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:58,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:12:58,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:12:58,127 INFO L87 Difference]: Start difference. First operand 820 states and 1103 transitions. Second operand 3 states. [2020-12-01 15:12:58,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:58,200 INFO L93 Difference]: Finished difference Result 1372 states and 1859 transitions. [2020-12-01 15:12:58,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:12:58,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2020-12-01 15:12:58,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:58,204 INFO L225 Difference]: With dead ends: 1372 [2020-12-01 15:12:58,204 INFO L226 Difference]: Without dead ends: 673 [2020-12-01 15:12:58,205 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-12-01 15:12:58,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2020-12-01 15:12:58,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 672. [2020-12-01 15:12:58,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2020-12-01 15:12:58,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 882 transitions. [2020-12-01 15:12:58,253 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 882 transitions. Word has length 186 [2020-12-01 15:12:58,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:58,253 INFO L481 AbstractCegarLoop]: Abstraction has 672 states and 882 transitions. [2020-12-01 15:12:58,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:12:58,253 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 882 transitions. [2020-12-01 15:12:58,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-12-01 15:12:58,256 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:58,256 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] [2020-12-01 15:12:58,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-01 15:12:58,256 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-12-01 15:12:58,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:58,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1150685691, now seen corresponding path program 1 times [2020-12-01 15:12:58,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:58,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219472355] [2020-12-01 15:12:58,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:58,625 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2020-12-01 15:12:58,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219472355] [2020-12-01 15:12:58,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133690481] [2020-12-01 15:12:58,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dc9288e-42ab-45f1-9070-ac5d16c58818/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-12-01 15:12:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:58,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-01 15:12:58,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:12:59,014 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-12-01 15:12:59,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-01 15:12:59,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2020-12-01 15:12:59,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354672552] [2020-12-01 15:12:59,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 15:12:59,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:59,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 15:12:59,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-01 15:12:59,016 INFO L87 Difference]: Start difference. First operand 672 states and 882 transitions. Second operand 7 states. [2020-12-01 15:12:59,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:59,304 INFO L93 Difference]: Finished difference Result 1442 states and 1925 transitions. [2020-12-01 15:12:59,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-01 15:12:59,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 191 [2020-12-01 15:12:59,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:59,320 INFO L225 Difference]: With dead ends: 1442 [2020-12-01 15:12:59,320 INFO L226 Difference]: Without dead ends: 1084 [2020-12-01 15:12:59,321 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2020-12-01 15:12:59,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2020-12-01 15:12:59,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 780. [2020-12-01 15:12:59,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-12-01 15:12:59,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1017 transitions. [2020-12-01 15:12:59,387 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1017 transitions. Word has length 191 [2020-12-01 15:12:59,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:12:59,387 INFO L481 AbstractCegarLoop]: Abstraction has 780 states and 1017 transitions. [2020-12-01 15:12:59,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 15:12:59,387 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1017 transitions. [2020-12-01 15:12:59,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2020-12-01 15:12:59,390 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:12:59,390 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] [2020-12-01 15:12:59,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-01 15:12:59,618 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-12-01 15:12:59,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:12:59,618 INFO L82 PathProgramCache]: Analyzing trace with hash 872323197, now seen corresponding path program 1 times [2020-12-01 15:12:59,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:12:59,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193765297] [2020-12-01 15:12:59,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:12:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:12:59,742 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-12-01 15:12:59,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193765297] [2020-12-01 15:12:59,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:12:59,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 15:12:59,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58106231] [2020-12-01 15:12:59,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 15:12:59,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:12:59,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 15:12:59,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-01 15:12:59,746 INFO L87 Difference]: Start difference. First operand 780 states and 1017 transitions. Second operand 6 states. [2020-12-01 15:12:59,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:12:59,933 INFO L93 Difference]: Finished difference Result 2558 states and 3458 transitions. [2020-12-01 15:12:59,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-01 15:12:59,934 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 197 [2020-12-01 15:12:59,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:12:59,951 INFO L225 Difference]: With dead ends: 2558 [2020-12-01 15:12:59,952 INFO L226 Difference]: Without dead ends: 2086 [2020-12-01 15:12:59,953 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-12-01 15:12:59,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2020-12-01 15:13:00,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 857. [2020-12-01 15:13:00,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2020-12-01 15:13:00,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1115 transitions. [2020-12-01 15:13:00,034 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1115 transitions. Word has length 197 [2020-12-01 15:13:00,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:13:00,034 INFO L481 AbstractCegarLoop]: Abstraction has 857 states and 1115 transitions. [2020-12-01 15:13:00,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 15:13:00,035 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1115 transitions. [2020-12-01 15:13:00,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2020-12-01 15:13:00,038 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:13:00,038 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] [2020-12-01 15:13:00,038 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-01 15:13:00,039 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-12-01 15:13:00,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:13:00,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1630646077, now seen corresponding path program 1 times [2020-12-01 15:13:00,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:13:00,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504436670] [2020-12-01 15:13:00,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:13:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:13:00,316 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-12-01 15:13:00,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504436670] [2020-12-01 15:13:00,317 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:13:00,317 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-01 15:13:00,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941590339] [2020-12-01 15:13:00,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-01 15:13:00,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:13:00,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-01 15:13:00,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-12-01 15:13:00,319 INFO L87 Difference]: Start difference. First operand 857 states and 1115 transitions. Second operand 10 states. [2020-12-01 15:13:01,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:13:01,344 INFO L93 Difference]: Finished difference Result 2251 states and 2973 transitions. [2020-12-01 15:13:01,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-01 15:13:01,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 197 [2020-12-01 15:13:01,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:13:01,350 INFO L225 Difference]: With dead ends: 2251 [2020-12-01 15:13:01,350 INFO L226 Difference]: Without dead ends: 1705 [2020-12-01 15:13:01,352 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-12-01 15:13:01,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2020-12-01 15:13:01,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 852. [2020-12-01 15:13:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2020-12-01 15:13:01,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1107 transitions. [2020-12-01 15:13:01,435 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1107 transitions. Word has length 197 [2020-12-01 15:13:01,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:13:01,436 INFO L481 AbstractCegarLoop]: Abstraction has 852 states and 1107 transitions. [2020-12-01 15:13:01,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-01 15:13:01,436 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1107 transitions. [2020-12-01 15:13:01,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2020-12-01 15:13:01,438 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:13:01,438 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] [2020-12-01 15:13:01,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-01 15:13:01,439 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-12-01 15:13:01,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:13:01,439 INFO L82 PathProgramCache]: Analyzing trace with hash -91486855, now seen corresponding path program 1 times [2020-12-01 15:13:01,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:13:01,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587495631] [2020-12-01 15:13:01,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:13:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:13:01,701 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-12-01 15:13:01,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587495631] [2020-12-01 15:13:01,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:13:01,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-01 15:13:01,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129584364] [2020-12-01 15:13:01,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-01 15:13:01,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:13:01,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-01 15:13:01,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-12-01 15:13:01,704 INFO L87 Difference]: Start difference. First operand 852 states and 1107 transitions. Second operand 10 states. [2020-12-01 15:13:02,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:13:02,513 INFO L93 Difference]: Finished difference Result 2235 states and 2952 transitions. [2020-12-01 15:13:02,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-01 15:13:02,514 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 197 [2020-12-01 15:13:02,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:13:02,518 INFO L225 Difference]: With dead ends: 2235 [2020-12-01 15:13:02,518 INFO L226 Difference]: Without dead ends: 1689 [2020-12-01 15:13:02,520 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2020-12-01 15:13:02,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1689 states. [2020-12-01 15:13:02,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1689 to 840. [2020-12-01 15:13:02,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2020-12-01 15:13:02,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1092 transitions. [2020-12-01 15:13:02,597 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1092 transitions. Word has length 197 [2020-12-01 15:13:02,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:13:02,598 INFO L481 AbstractCegarLoop]: Abstraction has 840 states and 1092 transitions. [2020-12-01 15:13:02,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-01 15:13:02,598 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1092 transitions. [2020-12-01 15:13:02,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2020-12-01 15:13:02,600 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:13:02,601 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 15:13:02,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-01 15:13:02,601 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-12-01 15:13:02,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:13:02,602 INFO L82 PathProgramCache]: Analyzing trace with hash 150538126, now seen corresponding path program 1 times [2020-12-01 15:13:02,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:13:02,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616598441] [2020-12-01 15:13:02,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:13:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:13:02,692 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2020-12-01 15:13:02,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616598441] [2020-12-01 15:13:02,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:13:02,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:13:02,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759990263] [2020-12-01 15:13:02,693 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:13:02,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:13:02,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:13:02,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:13:02,694 INFO L87 Difference]: Start difference. First operand 840 states and 1092 transitions. Second operand 4 states. [2020-12-01 15:13:02,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:13:02,918 INFO L93 Difference]: Finished difference Result 1599 states and 2106 transitions. [2020-12-01 15:13:02,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:13:02,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2020-12-01 15:13:02,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:13:02,922 INFO L225 Difference]: With dead ends: 1599 [2020-12-01 15:13:02,922 INFO L226 Difference]: Without dead ends: 1059 [2020-12-01 15:13:02,923 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-12-01 15:13:02,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2020-12-01 15:13:02,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 814. [2020-12-01 15:13:02,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 814 states. [2020-12-01 15:13:02,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1040 transitions. [2020-12-01 15:13:02,999 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1040 transitions. Word has length 207 [2020-12-01 15:13:02,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:13:02,999 INFO L481 AbstractCegarLoop]: Abstraction has 814 states and 1040 transitions. [2020-12-01 15:13:03,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:13:03,000 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1040 transitions. [2020-12-01 15:13:03,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2020-12-01 15:13:03,002 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:13:03,002 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 15:13:03,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-01 15:13:03,003 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-12-01 15:13:03,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:13:03,004 INFO L82 PathProgramCache]: Analyzing trace with hash 917837052, now seen corresponding path program 1 times [2020-12-01 15:13:03,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:13:03,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840595828] [2020-12-01 15:13:03,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:13:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:13:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-12-01 15:13:03,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840595828] [2020-12-01 15:13:03,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209192769] [2020-12-01 15:13:03,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dc9288e-42ab-45f1-9070-ac5d16c58818/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-12-01 15:13:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:13:03,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-01 15:13:03,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:13:03,919 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 9 proven. 32 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-12-01 15:13:03,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-01 15:13:03,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2020-12-01 15:13:03,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647354072] [2020-12-01 15:13:03,922 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-01 15:13:03,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:13:03,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-01 15:13:03,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2020-12-01 15:13:03,923 INFO L87 Difference]: Start difference. First operand 814 states and 1040 transitions. Second operand 19 states. [2020-12-01 15:13:30,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:13:30,637 INFO L93 Difference]: Finished difference Result 19125 states and 25547 transitions. [2020-12-01 15:13:30,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 608 states. [2020-12-01 15:13:30,638 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 231 [2020-12-01 15:13:30,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:13:30,684 INFO L225 Difference]: With dead ends: 19125 [2020-12-01 15:13:30,684 INFO L226 Difference]: Without dead ends: 18579 [2020-12-01 15:13:30,794 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 848 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 622 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180771 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=32021, Invalid=356731, Unknown=0, NotChecked=0, Total=388752 [2020-12-01 15:13:30,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18579 states. [2020-12-01 15:13:31,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18579 to 2225. [2020-12-01 15:13:31,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2225 states. [2020-12-01 15:13:31,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 2225 states and 2834 transitions. [2020-12-01 15:13:31,329 INFO L78 Accepts]: Start accepts. Automaton has 2225 states and 2834 transitions. Word has length 231 [2020-12-01 15:13:31,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:13:31,330 INFO L481 AbstractCegarLoop]: Abstraction has 2225 states and 2834 transitions. [2020-12-01 15:13:31,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-01 15:13:31,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 2834 transitions. [2020-12-01 15:13:31,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2020-12-01 15:13:31,335 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:13:31,335 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] [2020-12-01 15:13:31,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2020-12-01 15:13:31,550 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-12-01 15:13:31,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:13:31,551 INFO L82 PathProgramCache]: Analyzing trace with hash -278436036, now seen corresponding path program 1 times [2020-12-01 15:13:31,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:13:31,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495848579] [2020-12-01 15:13:31,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:13:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:13:31,786 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2020-12-01 15:13:31,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495848579] [2020-12-01 15:13:31,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:13:31,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:13:31,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153961394] [2020-12-01 15:13:31,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:13:31,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:13:31,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:13:31,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:13:31,788 INFO L87 Difference]: Start difference. First operand 2225 states and 2834 transitions. Second operand 5 states. [2020-12-01 15:13:32,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:13:32,152 INFO L93 Difference]: Finished difference Result 4123 states and 5274 transitions. [2020-12-01 15:13:32,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:13:32,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2020-12-01 15:13:32,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:13:32,158 INFO L225 Difference]: With dead ends: 4123 [2020-12-01 15:13:32,158 INFO L226 Difference]: Without dead ends: 2225 [2020-12-01 15:13:32,161 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12-01 15:13:32,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2225 states. [2020-12-01 15:13:32,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2225 to 2225. [2020-12-01 15:13:32,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2225 states. [2020-12-01 15:13:32,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 2225 states and 2830 transitions. [2020-12-01 15:13:32,399 INFO L78 Accepts]: Start accepts. Automaton has 2225 states and 2830 transitions. Word has length 231 [2020-12-01 15:13:32,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:13:32,399 INFO L481 AbstractCegarLoop]: Abstraction has 2225 states and 2830 transitions. [2020-12-01 15:13:32,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:13:32,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 2830 transitions. [2020-12-01 15:13:32,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2020-12-01 15:13:32,404 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:13:32,404 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] [2020-12-01 15:13:32,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-01 15:13:32,405 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-12-01 15:13:32,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:13:32,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1875897740, now seen corresponding path program 1 times [2020-12-01 15:13:32,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:13:32,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084918131] [2020-12-01 15:13:32,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:13:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:13:32,755 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-12-01 15:13:32,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084918131] [2020-12-01 15:13:32,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710703710] [2020-12-01 15:13:32,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dc9288e-42ab-45f1-9070-ac5d16c58818/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-12-01 15:13:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:13:32,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-01 15:13:32,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:13:33,440 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-12-01 15:13:33,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-01 15:13:33,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2020-12-01 15:13:33,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575307204] [2020-12-01 15:13:33,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-01 15:13:33,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:13:33,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-01 15:13:33,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2020-12-01 15:13:33,442 INFO L87 Difference]: Start difference. First operand 2225 states and 2830 transitions. Second operand 19 states. [2020-12-01 15:13:52,291 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-12-01 15:13:58,841 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2020-12-01 15:14:00,800 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2020-12-01 15:14:03,305 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2020-12-01 15:14:05,415 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2020-12-01 15:14:05,821 WARN L197 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-12-01 15:14:10,411 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2020-12-01 15:14:10,850 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2020-12-01 15:14:13,024 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2020-12-01 15:14:13,411 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2020-12-01 15:14:14,304 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2020-12-01 15:14:14,483 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2020-12-01 15:14:14,675 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2020-12-01 15:14:16,485 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2020-12-01 15:14:31,068 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2020-12-01 15:14:50,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:14:50,982 INFO L93 Difference]: Finished difference Result 35411 states and 45589 transitions. [2020-12-01 15:14:50,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 991 states. [2020-12-01 15:14:50,983 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 232 [2020-12-01 15:14:50,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:14:51,056 INFO L225 Difference]: With dead ends: 35411 [2020-12-01 15:14:51,057 INFO L226 Difference]: Without dead ends: 33587 [2020-12-01 15:14:51,102 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1233 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 1005 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491486 ImplicationChecksByTransitivity, 62.9s TimeCoverageRelationStatistics Valid=56416, Invalid=956626, Unknown=0, NotChecked=0, Total=1013042 [2020-12-01 15:14:51,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33587 states. [2020-12-01 15:14:51,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33587 to 4727. [2020-12-01 15:14:51,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4727 states. [2020-12-01 15:14:51,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4727 states to 4727 states and 6043 transitions. [2020-12-01 15:14:51,867 INFO L78 Accepts]: Start accepts. Automaton has 4727 states and 6043 transitions. Word has length 232 [2020-12-01 15:14:51,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:14:51,867 INFO L481 AbstractCegarLoop]: Abstraction has 4727 states and 6043 transitions. [2020-12-01 15:14:51,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-01 15:14:51,867 INFO L276 IsEmpty]: Start isEmpty. Operand 4727 states and 6043 transitions. [2020-12-01 15:14:51,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2020-12-01 15:14:51,876 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:14:51,876 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] [2020-12-01 15:14:52,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2020-12-01 15:14:52,090 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-12-01 15:14:52,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:14:52,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1705594292, now seen corresponding path program 1 times [2020-12-01 15:14:52,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:14:52,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296664157] [2020-12-01 15:14:52,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:14:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:14:52,525 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2020-12-01 15:14:52,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296664157] [2020-12-01 15:14:52,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:14:52,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:14:52,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24405543] [2020-12-01 15:14:52,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:14:52,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:14:52,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:14:52,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:14:52,529 INFO L87 Difference]: Start difference. First operand 4727 states and 6043 transitions. Second operand 5 states. [2020-12-01 15:14:53,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:14:53,076 INFO L93 Difference]: Finished difference Result 9129 states and 11694 transitions. [2020-12-01 15:14:53,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:14:53,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2020-12-01 15:14:53,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:14:53,087 INFO L225 Difference]: With dead ends: 9129 [2020-12-01 15:14:53,087 INFO L226 Difference]: Without dead ends: 4745 [2020-12-01 15:14:53,093 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12-01 15:14:53,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4745 states. [2020-12-01 15:14:53,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4745 to 4739. [2020-12-01 15:14:53,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4739 states. [2020-12-01 15:14:53,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4739 states to 4739 states and 6043 transitions. [2020-12-01 15:14:53,894 INFO L78 Accepts]: Start accepts. Automaton has 4739 states and 6043 transitions. Word has length 232 [2020-12-01 15:14:53,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:14:53,894 INFO L481 AbstractCegarLoop]: Abstraction has 4739 states and 6043 transitions. [2020-12-01 15:14:53,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:14:53,895 INFO L276 IsEmpty]: Start isEmpty. Operand 4739 states and 6043 transitions. [2020-12-01 15:14:53,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2020-12-01 15:14:53,903 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:14:53,903 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] [2020-12-01 15:14:53,904 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-12-01 15:14:53,904 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-12-01 15:14:53,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:14:53,905 INFO L82 PathProgramCache]: Analyzing trace with hash -152672820, now seen corresponding path program 1 times [2020-12-01 15:14:53,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:14:53,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712042583] [2020-12-01 15:14:53,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:14:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:14:54,015 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2020-12-01 15:14:54,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712042583] [2020-12-01 15:14:54,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:14:54,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:14:54,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047121874] [2020-12-01 15:14:54,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:14:54,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:14:54,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:14:54,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:14:54,018 INFO L87 Difference]: Start difference. First operand 4739 states and 6043 transitions. Second operand 3 states. [2020-12-01 15:14:54,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:14:54,554 INFO L93 Difference]: Finished difference Result 9383 states and 11948 transitions. [2020-12-01 15:14:54,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:14:54,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2020-12-01 15:14:54,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:14:54,563 INFO L225 Difference]: With dead ends: 9383 [2020-12-01 15:14:54,563 INFO L226 Difference]: Without dead ends: 4999 [2020-12-01 15:14:54,569 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-12-01 15:14:54,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4999 states. [2020-12-01 15:14:55,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4999 to 4699. [2020-12-01 15:14:55,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4699 states. [2020-12-01 15:14:55,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4699 states to 4699 states and 5803 transitions. [2020-12-01 15:14:55,429 INFO L78 Accepts]: Start accepts. Automaton has 4699 states and 5803 transitions. Word has length 232 [2020-12-01 15:14:55,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:14:55,430 INFO L481 AbstractCegarLoop]: Abstraction has 4699 states and 5803 transitions. [2020-12-01 15:14:55,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:14:55,430 INFO L276 IsEmpty]: Start isEmpty. Operand 4699 states and 5803 transitions. [2020-12-01 15:14:55,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2020-12-01 15:14:55,439 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:14:55,440 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] [2020-12-01 15:14:55,440 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-12-01 15:14:55,440 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-12-01 15:14:55,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:14:55,441 INFO L82 PathProgramCache]: Analyzing trace with hash 913916498, now seen corresponding path program 1 times [2020-12-01 15:14:55,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:14:55,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003938198] [2020-12-01 15:14:55,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:14:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:14:55,745 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-12-01 15:14:55,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003938198] [2020-12-01 15:14:55,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503259690] [2020-12-01 15:14:55,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dc9288e-42ab-45f1-9070-ac5d16c58818/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-12-01 15:14:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:14:55,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 30 conjunts are in the unsatisfiable core [2020-12-01 15:14:55,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:14:56,577 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 33 proven. 13 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2020-12-01 15:14:56,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-01 15:14:56,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2020-12-01 15:14:56,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473805552] [2020-12-01 15:14:56,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-12-01 15:14:56,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:14:56,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-12-01 15:14:56,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-12-01 15:14:56,580 INFO L87 Difference]: Start difference. First operand 4699 states and 5803 transitions. Second operand 20 states. [2020-12-01 15:15:17,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:15:17,003 INFO L93 Difference]: Finished difference Result 29366 states and 36766 transitions. [2020-12-01 15:15:17,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2020-12-01 15:15:17,005 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 238 [2020-12-01 15:15:17,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:15:17,031 INFO L225 Difference]: With dead ends: 29366 [2020-12-01 15:15:17,031 INFO L226 Difference]: Without dead ends: 25177 [2020-12-01 15:15:17,042 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8726 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=3426, Invalid=21380, Unknown=0, NotChecked=0, Total=24806 [2020-12-01 15:15:17,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25177 states. [2020-12-01 15:15:18,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25177 to 5071. [2020-12-01 15:15:18,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5071 states. [2020-12-01 15:15:18,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5071 states to 5071 states and 6253 transitions. [2020-12-01 15:15:18,184 INFO L78 Accepts]: Start accepts. Automaton has 5071 states and 6253 transitions. Word has length 238 [2020-12-01 15:15:18,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:15:18,185 INFO L481 AbstractCegarLoop]: Abstraction has 5071 states and 6253 transitions. [2020-12-01 15:15:18,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-12-01 15:15:18,185 INFO L276 IsEmpty]: Start isEmpty. Operand 5071 states and 6253 transitions. [2020-12-01 15:15:18,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2020-12-01 15:15:18,196 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:15:18,197 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, 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] [2020-12-01 15:15:18,421 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-01 15:15:18,422 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-12-01 15:15:18,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:15:18,422 INFO L82 PathProgramCache]: Analyzing trace with hash -166386405, now seen corresponding path program 1 times [2020-12-01 15:15:18,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:15:18,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755830812] [2020-12-01 15:15:18,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:15:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:15:18,513 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2020-12-01 15:15:18,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755830812] [2020-12-01 15:15:18,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:15:18,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:15:18,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620416256] [2020-12-01 15:15:18,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:15:18,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:15:18,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:15:18,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:15:18,515 INFO L87 Difference]: Start difference. First operand 5071 states and 6253 transitions. Second operand 3 states. [2020-12-01 15:15:19,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:15:19,153 INFO L93 Difference]: Finished difference Result 9760 states and 12036 transitions. [2020-12-01 15:15:19,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:15:19,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2020-12-01 15:15:19,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:15:19,158 INFO L225 Difference]: With dead ends: 9760 [2020-12-01 15:15:19,159 INFO L226 Difference]: Without dead ends: 4702 [2020-12-01 15:15:19,163 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-12-01 15:15:19,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4702 states. [2020-12-01 15:15:20,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4702 to 4702. [2020-12-01 15:15:20,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4702 states. [2020-12-01 15:15:20,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4702 states to 4702 states and 5789 transitions. [2020-12-01 15:15:20,046 INFO L78 Accepts]: Start accepts. Automaton has 4702 states and 5789 transitions. Word has length 241 [2020-12-01 15:15:20,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:15:20,046 INFO L481 AbstractCegarLoop]: Abstraction has 4702 states and 5789 transitions. [2020-12-01 15:15:20,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:15:20,047 INFO L276 IsEmpty]: Start isEmpty. Operand 4702 states and 5789 transitions. [2020-12-01 15:15:20,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2020-12-01 15:15:20,055 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:15:20,056 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 15:15:20,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-12-01 15:15:20,057 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-12-01 15:15:20,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:15:20,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1375296600, now seen corresponding path program 1 times [2020-12-01 15:15:20,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:15:20,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272492538] [2020-12-01 15:15:20,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:15:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:15:20,279 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2020-12-01 15:15:20,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272492538] [2020-12-01 15:15:20,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:15:20,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:15:20,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430140432] [2020-12-01 15:15:20,280 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:15:20,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:15:20,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:15:20,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:15:20,281 INFO L87 Difference]: Start difference. First operand 4702 states and 5789 transitions. Second operand 5 states. [2020-12-01 15:15:20,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:15:20,993 INFO L93 Difference]: Finished difference Result 9015 states and 11139 transitions. [2020-12-01 15:15:20,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:15:20,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 244 [2020-12-01 15:15:20,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:15:21,000 INFO L225 Difference]: With dead ends: 9015 [2020-12-01 15:15:21,000 INFO L226 Difference]: Without dead ends: 4708 [2020-12-01 15:15:21,004 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12-01 15:15:21,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4708 states. [2020-12-01 15:15:21,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4708 to 4690. [2020-12-01 15:15:21,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4690 states. [2020-12-01 15:15:21,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4690 states to 4690 states and 5771 transitions. [2020-12-01 15:15:21,570 INFO L78 Accepts]: Start accepts. Automaton has 4690 states and 5771 transitions. Word has length 244 [2020-12-01 15:15:21,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:15:21,571 INFO L481 AbstractCegarLoop]: Abstraction has 4690 states and 5771 transitions. [2020-12-01 15:15:21,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:15:21,571 INFO L276 IsEmpty]: Start isEmpty. Operand 4690 states and 5771 transitions. [2020-12-01 15:15:21,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2020-12-01 15:15:21,579 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:15:21,580 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 15:15:21,580 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-12-01 15:15:21,580 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-12-01 15:15:21,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:15:21,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1877614907, now seen corresponding path program 1 times [2020-12-01 15:15:21,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:15:21,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688803964] [2020-12-01 15:15:21,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:15:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:15:22,195 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-12-01 15:15:22,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688803964] [2020-12-01 15:15:22,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17179176] [2020-12-01 15:15:22,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dc9288e-42ab-45f1-9070-ac5d16c58818/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-12-01 15:15:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:15:22,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 30 conjunts are in the unsatisfiable core [2020-12-01 15:15:22,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:15:23,376 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 27 proven. 17 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2020-12-01 15:15:23,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-01 15:15:23,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2020-12-01 15:15:23,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228369850] [2020-12-01 15:15:23,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-12-01 15:15:23,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:15:23,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-12-01 15:15:23,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2020-12-01 15:15:23,378 INFO L87 Difference]: Start difference. First operand 4690 states and 5771 transitions. Second operand 20 states. [2020-12-01 15:15:37,627 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 32 [2020-12-01 15:15:39,579 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2020-12-01 15:15:46,064 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2020-12-01 15:15:48,822 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2020-12-01 15:15:55,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:15:55,497 INFO L93 Difference]: Finished difference Result 43013 states and 54263 transitions. [2020-12-01 15:15:55,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2020-12-01 15:15:55,499 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 245 [2020-12-01 15:15:55,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:15:55,530 INFO L225 Difference]: With dead ends: 43013 [2020-12-01 15:15:55,531 INFO L226 Difference]: Without dead ends: 38824 [2020-12-01 15:15:55,538 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17617 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=5460, Invalid=38430, Unknown=0, NotChecked=0, Total=43890 [2020-12-01 15:15:55,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38824 states. [2020-12-01 15:15:56,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38824 to 4714. [2020-12-01 15:15:56,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4714 states. [2020-12-01 15:15:56,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4714 states to 4714 states and 5802 transitions. [2020-12-01 15:15:56,345 INFO L78 Accepts]: Start accepts. Automaton has 4714 states and 5802 transitions. Word has length 245 [2020-12-01 15:15:56,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:15:56,346 INFO L481 AbstractCegarLoop]: Abstraction has 4714 states and 5802 transitions. [2020-12-01 15:15:56,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-12-01 15:15:56,346 INFO L276 IsEmpty]: Start isEmpty. Operand 4714 states and 5802 transitions. [2020-12-01 15:15:56,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2020-12-01 15:15:56,353 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:15:56,353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 15:15:56,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-01 15:15:56,554 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-12-01 15:15:56,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:15:56,554 INFO L82 PathProgramCache]: Analyzing trace with hash -78930315, now seen corresponding path program 1 times [2020-12-01 15:15:56,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:15:56,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837278969] [2020-12-01 15:15:56,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:15:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:15:56,777 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2020-12-01 15:15:56,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837278969] [2020-12-01 15:15:56,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:15:56,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:15:56,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082446780] [2020-12-01 15:15:56,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:15:56,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:15:56,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:15:56,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:15:56,780 INFO L87 Difference]: Start difference. First operand 4714 states and 5802 transitions. Second operand 5 states. [2020-12-01 15:15:57,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:15:57,562 INFO L93 Difference]: Finished difference Result 9118 states and 11255 transitions. [2020-12-01 15:15:57,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:15:57,564 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 252 [2020-12-01 15:15:57,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:15:57,567 INFO L225 Difference]: With dead ends: 9118 [2020-12-01 15:15:57,567 INFO L226 Difference]: Without dead ends: 4744 [2020-12-01 15:15:57,571 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12-01 15:15:57,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4744 states. [2020-12-01 15:15:58,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4744 to 4690. [2020-12-01 15:15:58,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4690 states. [2020-12-01 15:15:58,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4690 states to 4690 states and 5766 transitions. [2020-12-01 15:15:58,186 INFO L78 Accepts]: Start accepts. Automaton has 4690 states and 5766 transitions. Word has length 252 [2020-12-01 15:15:58,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:15:58,187 INFO L481 AbstractCegarLoop]: Abstraction has 4690 states and 5766 transitions. [2020-12-01 15:15:58,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:15:58,187 INFO L276 IsEmpty]: Start isEmpty. Operand 4690 states and 5766 transitions. [2020-12-01 15:15:58,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2020-12-01 15:15:58,192 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:15:58,192 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 15:15:58,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-12-01 15:15:58,192 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-12-01 15:15:58,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:15:58,193 INFO L82 PathProgramCache]: Analyzing trace with hash -270066059, now seen corresponding path program 1 times [2020-12-01 15:15:58,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:15:58,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70363794] [2020-12-01 15:15:58,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:15:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:15:58,553 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-12-01 15:15:58,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70363794] [2020-12-01 15:15:58,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087213987] [2020-12-01 15:15:58,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dc9288e-42ab-45f1-9070-ac5d16c58818/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-12-01 15:15:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:15:58,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-01 15:15:58,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:15:59,464 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-12-01 15:15:59,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-01 15:15:59,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2020-12-01 15:15:59,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078677498] [2020-12-01 15:15:59,466 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-01 15:15:59,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:15:59,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-01 15:15:59,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-01 15:15:59,467 INFO L87 Difference]: Start difference. First operand 4690 states and 5766 transitions. Second operand 9 states. [2020-12-01 15:16:04,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:16:04,306 INFO L93 Difference]: Finished difference Result 25592 states and 31902 transitions. [2020-12-01 15:16:04,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-12-01 15:16:04,308 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 252 [2020-12-01 15:16:04,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:16:04,326 INFO L225 Difference]: With dead ends: 25592 [2020-12-01 15:16:04,326 INFO L226 Difference]: Without dead ends: 21433 [2020-12-01 15:16:04,332 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 259 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=340, Invalid=1382, Unknown=0, NotChecked=0, Total=1722 [2020-12-01 15:16:04,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21433 states. [2020-12-01 15:16:06,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21433 to 12294. [2020-12-01 15:16:06,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12294 states. [2020-12-01 15:16:06,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12294 states to 12294 states and 15141 transitions. [2020-12-01 15:16:06,112 INFO L78 Accepts]: Start accepts. Automaton has 12294 states and 15141 transitions. Word has length 252 [2020-12-01 15:16:06,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:16:06,112 INFO L481 AbstractCegarLoop]: Abstraction has 12294 states and 15141 transitions. [2020-12-01 15:16:06,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-01 15:16:06,113 INFO L276 IsEmpty]: Start isEmpty. Operand 12294 states and 15141 transitions. [2020-12-01 15:16:06,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2020-12-01 15:16:06,124 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:16:06,124 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 15:16:06,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2020-12-01 15:16:06,326 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-12-01 15:16:06,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:16:06,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1162436395, now seen corresponding path program 1 times [2020-12-01 15:16:06,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:16:06,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099746154] [2020-12-01 15:16:06,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:16:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:16:06,712 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-12-01 15:16:06,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099746154] [2020-12-01 15:16:06,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157929582] [2020-12-01 15:16:06,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dc9288e-42ab-45f1-9070-ac5d16c58818/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-12-01 15:16:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:16:06,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 30 conjunts are in the unsatisfiable core [2020-12-01 15:16:06,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:16:07,716 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 39 proven. 21 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2020-12-01 15:16:07,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-01 15:16:07,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2020-12-01 15:16:07,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463239951] [2020-12-01 15:16:07,717 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-12-01 15:16:07,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:16:07,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-12-01 15:16:07,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-12-01 15:16:07,718 INFO L87 Difference]: Start difference. First operand 12294 states and 15141 transitions. Second operand 20 states. [2020-12-01 15:16:52,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:16:52,952 INFO L93 Difference]: Finished difference Result 94027 states and 119415 transitions. [2020-12-01 15:16:52,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2020-12-01 15:16:52,955 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 252 [2020-12-01 15:16:52,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:16:53,075 INFO L225 Difference]: With dead ends: 94027 [2020-12-01 15:16:53,075 INFO L226 Difference]: Without dead ends: 82416 [2020-12-01 15:16:53,096 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23163 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=6181, Invalid=49751, Unknown=0, NotChecked=0, Total=55932 [2020-12-01 15:16:53,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82416 states. [2020-12-01 15:16:55,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82416 to 12314. [2020-12-01 15:16:55,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12314 states. [2020-12-01 15:16:55,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12314 states to 12314 states and 15162 transitions. [2020-12-01 15:16:55,874 INFO L78 Accepts]: Start accepts. Automaton has 12314 states and 15162 transitions. Word has length 252 [2020-12-01 15:16:55,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:16:55,874 INFO L481 AbstractCegarLoop]: Abstraction has 12314 states and 15162 transitions. [2020-12-01 15:16:55,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-12-01 15:16:55,874 INFO L276 IsEmpty]: Start isEmpty. Operand 12314 states and 15162 transitions. [2020-12-01 15:16:55,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2020-12-01 15:16:55,888 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:16:55,889 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 15:16:56,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2020-12-01 15:16:56,090 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-12-01 15:16:56,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:16:56,090 INFO L82 PathProgramCache]: Analyzing trace with hash 348190835, now seen corresponding path program 1 times [2020-12-01 15:16:56,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:16:56,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287242009] [2020-12-01 15:16:56,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:16:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:16:56,383 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2020-12-01 15:16:56,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287242009] [2020-12-01 15:16:56,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:16:56,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:16:56,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949882440] [2020-12-01 15:16:56,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:16:56,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:16:56,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:16:56,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:16:56,386 INFO L87 Difference]: Start difference. First operand 12314 states and 15162 transitions. Second operand 5 states. [2020-12-01 15:16:58,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:16:58,842 INFO L93 Difference]: Finished difference Result 24098 states and 29742 transitions. [2020-12-01 15:16:58,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:16:58,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 268 [2020-12-01 15:16:58,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:16:58,858 INFO L225 Difference]: With dead ends: 24098 [2020-12-01 15:16:58,858 INFO L226 Difference]: Without dead ends: 12324 [2020-12-01 15:16:58,865 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:16:58,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12324 states. [2020-12-01 15:17:00,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12324 to 12294. [2020-12-01 15:17:00,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12294 states. [2020-12-01 15:17:00,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12294 states to 12294 states and 15132 transitions. [2020-12-01 15:17:00,970 INFO L78 Accepts]: Start accepts. Automaton has 12294 states and 15132 transitions. Word has length 268 [2020-12-01 15:17:00,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:17:00,971 INFO L481 AbstractCegarLoop]: Abstraction has 12294 states and 15132 transitions. [2020-12-01 15:17:00,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:17:00,971 INFO L276 IsEmpty]: Start isEmpty. Operand 12294 states and 15132 transitions. [2020-12-01 15:17:00,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2020-12-01 15:17:00,980 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:17:00,980 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 15:17:00,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-12-01 15:17:00,980 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-12-01 15:17:00,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:17:00,981 INFO L82 PathProgramCache]: Analyzing trace with hash 751370227, now seen corresponding path program 1 times [2020-12-01 15:17:00,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:17:00,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004709860] [2020-12-01 15:17:00,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:17:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:17:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2020-12-01 15:17:01,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004709860] [2020-12-01 15:17:01,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:17:01,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:17:01,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107860167] [2020-12-01 15:17:01,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:17:01,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:17:01,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:17:01,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:17:01,103 INFO L87 Difference]: Start difference. First operand 12294 states and 15132 transitions. Second operand 3 states. [2020-12-01 15:17:02,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:17:02,420 INFO L93 Difference]: Finished difference Result 17981 states and 22158 transitions. [2020-12-01 15:17:02,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:17:02,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2020-12-01 15:17:02,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:17:02,429 INFO L225 Difference]: With dead ends: 17981 [2020-12-01 15:17:02,429 INFO L226 Difference]: Without dead ends: 6217 [2020-12-01 15:17:02,435 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-12-01 15:17:02,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6217 states. [2020-12-01 15:17:03,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6217 to 6217. [2020-12-01 15:17:03,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2020-12-01 15:17:03,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 7599 transitions. [2020-12-01 15:17:03,513 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 7599 transitions. Word has length 268 [2020-12-01 15:17:03,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:17:03,513 INFO L481 AbstractCegarLoop]: Abstraction has 6217 states and 7599 transitions. [2020-12-01 15:17:03,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:17:03,513 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 7599 transitions. [2020-12-01 15:17:03,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2020-12-01 15:17:03,518 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:17:03,518 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:17:03,518 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-12-01 15:17:03,519 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-12-01 15:17:03,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:17:03,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1534864033, now seen corresponding path program 1 times [2020-12-01 15:17:03,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:17:03,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821151587] [2020-12-01 15:17:03,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:17:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:17:03,995 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-12-01 15:17:03,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821151587] [2020-12-01 15:17:03,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570346058] [2020-12-01 15:17:03,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dc9288e-42ab-45f1-9070-ac5d16c58818/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-12-01 15:17:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:17:04,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 1110 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-01 15:17:04,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:17:05,243 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2020-12-01 15:17:05,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-01 15:17:05,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 19 [2020-12-01 15:17:05,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128384748] [2020-12-01 15:17:05,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-01 15:17:05,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:17:05,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-01 15:17:05,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2020-12-01 15:17:05,244 INFO L87 Difference]: Start difference. First operand 6217 states and 7599 transitions. Second operand 8 states. [2020-12-01 15:17:09,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:17:09,408 INFO L93 Difference]: Finished difference Result 16925 states and 21028 transitions. [2020-12-01 15:17:09,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-01 15:17:09,411 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 269 [2020-12-01 15:17:09,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:17:09,420 INFO L225 Difference]: With dead ends: 16925 [2020-12-01 15:17:09,421 INFO L226 Difference]: Without dead ends: 11244 [2020-12-01 15:17:09,425 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=183, Invalid=1007, Unknown=0, NotChecked=0, Total=1190 [2020-12-01 15:17:09,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11244 states. [2020-12-01 15:17:09,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11244 to 2761. [2020-12-01 15:17:09,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2761 states. [2020-12-01 15:17:09,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3318 transitions. [2020-12-01 15:17:09,970 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3318 transitions. Word has length 269 [2020-12-01 15:17:09,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:17:09,970 INFO L481 AbstractCegarLoop]: Abstraction has 2761 states and 3318 transitions. [2020-12-01 15:17:09,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-01 15:17:09,970 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3318 transitions. [2020-12-01 15:17:09,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2020-12-01 15:17:09,973 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:17:09,973 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 15:17:10,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2020-12-01 15:17:10,175 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-12-01 15:17:10,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:17:10,175 INFO L82 PathProgramCache]: Analyzing trace with hash -498407841, now seen corresponding path program 1 times [2020-12-01 15:17:10,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:17:10,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095482150] [2020-12-01 15:17:10,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:17:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:17:10,503 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 26 [2020-12-01 15:17:10,853 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-12-01 15:17:10,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095482150] [2020-12-01 15:17:10,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980419204] [2020-12-01 15:17:10,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2dc9288e-42ab-45f1-9070-ac5d16c58818/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-12-01 15:17:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:17:11,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 1109 conjuncts, 28 conjunts are in the unsatisfiable core [2020-12-01 15:17:11,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:17:12,580 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-12-01 15:17:12,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-01 15:17:12,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2020-12-01 15:17:12,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356052601] [2020-12-01 15:17:12,582 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-12-01 15:17:12,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:17:12,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-12-01 15:17:12,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2020-12-01 15:17:12,583 INFO L87 Difference]: Start difference. First operand 2761 states and 3318 transitions. Second operand 24 states. [2020-12-01 15:17:31,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:17:31,942 INFO L93 Difference]: Finished difference Result 23454 states and 28829 transitions. [2020-12-01 15:17:31,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2020-12-01 15:17:31,956 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 269 [2020-12-01 15:17:31,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:17:31,977 INFO L225 Difference]: With dead ends: 23454 [2020-12-01 15:17:31,977 INFO L226 Difference]: Without dead ends: 21126 [2020-12-01 15:17:31,984 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6088 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=3010, Invalid=14020, Unknown=0, NotChecked=0, Total=17030 [2020-12-01 15:17:31,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21126 states. [2020-12-01 15:17:33,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21126 to 4339. [2020-12-01 15:17:33,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4339 states. [2020-12-01 15:17:33,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4339 states to 4339 states and 5295 transitions. [2020-12-01 15:17:33,125 INFO L78 Accepts]: Start accepts. Automaton has 4339 states and 5295 transitions. Word has length 269 [2020-12-01 15:17:33,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:17:33,126 INFO L481 AbstractCegarLoop]: Abstraction has 4339 states and 5295 transitions. [2020-12-01 15:17:33,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-12-01 15:17:33,126 INFO L276 IsEmpty]: Start isEmpty. Operand 4339 states and 5295 transitions. [2020-12-01 15:17:33,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2020-12-01 15:17:33,128 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:17:33,129 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 15:17:33,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-01 15:17:33,329 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-12-01 15:17:33,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:17:33,330 INFO L82 PathProgramCache]: Analyzing trace with hash 448630045, now seen corresponding path program 1 times [2020-12-01 15:17:33,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:17:33,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742496261] [2020-12-01 15:17:33,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:17:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:17:33,599 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2020-12-01 15:17:33,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742496261] [2020-12-01 15:17:33,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:17:33,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:17:33,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16739603] [2020-12-01 15:17:33,600 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:17:33,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:17:33,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:17:33,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:17:33,601 INFO L87 Difference]: Start difference. First operand 4339 states and 5295 transitions. Second operand 5 states. [2020-12-01 15:17:34,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:17:34,670 INFO L93 Difference]: Finished difference Result 8283 states and 10152 transitions. [2020-12-01 15:17:34,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:17:34,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 269 [2020-12-01 15:17:34,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:17:34,676 INFO L225 Difference]: With dead ends: 8283 [2020-12-01 15:17:34,677 INFO L226 Difference]: Without dead ends: 4339 [2020-12-01 15:17:34,679 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12-01 15:17:34,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4339 states. [2020-12-01 15:17:35,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4339 to 4339. [2020-12-01 15:17:35,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4339 states. [2020-12-01 15:17:35,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4339 states to 4339 states and 5281 transitions. [2020-12-01 15:17:35,633 INFO L78 Accepts]: Start accepts. Automaton has 4339 states and 5281 transitions. Word has length 269 [2020-12-01 15:17:35,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:17:35,634 INFO L481 AbstractCegarLoop]: Abstraction has 4339 states and 5281 transitions. [2020-12-01 15:17:35,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:17:35,634 INFO L276 IsEmpty]: Start isEmpty. Operand 4339 states and 5281 transitions. [2020-12-01 15:17:35,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2020-12-01 15:17:35,637 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:17:35,637 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 15:17:35,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-12-01 15:17:35,637 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-12-01 15:17:35,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:17:35,637 INFO L82 PathProgramCache]: Analyzing trace with hash -928066147, now seen corresponding path program 1 times [2020-12-01 15:17:35,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:17:35,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865450508] [2020-12-01 15:17:35,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:17:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:17:35,748 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2020-12-01 15:17:35,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865450508] [2020-12-01 15:17:35,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:17:35,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:17:35,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246432563] [2020-12-01 15:17:35,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:17:35,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:17:35,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:17:35,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:17:35,751 INFO L87 Difference]: Start difference. First operand 4339 states and 5281 transitions. Second operand 3 states. [2020-12-01 15:17:36,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:17:36,808 INFO L93 Difference]: Finished difference Result 7052 states and 8618 transitions. [2020-12-01 15:17:36,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:17:36,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2020-12-01 15:17:36,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:17:36,812 INFO L225 Difference]: With dead ends: 7052 [2020-12-01 15:17:36,812 INFO L226 Difference]: Without dead ends: 3094 [2020-12-01 15:17:36,815 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-12-01 15:17:36,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2020-12-01 15:17:37,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 3094. [2020-12-01 15:17:37,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3094 states. [2020-12-01 15:17:37,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3094 states to 3094 states and 3745 transitions. [2020-12-01 15:17:37,578 INFO L78 Accepts]: Start accepts. Automaton has 3094 states and 3745 transitions. Word has length 269 [2020-12-01 15:17:37,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:17:37,578 INFO L481 AbstractCegarLoop]: Abstraction has 3094 states and 3745 transitions. [2020-12-01 15:17:37,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:17:37,578 INFO L276 IsEmpty]: Start isEmpty. Operand 3094 states and 3745 transitions. [2020-12-01 15:17:37,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2020-12-01 15:17:37,580 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:17:37,580 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, 1, 1, 1, 1, 1] [2020-12-01 15:17:37,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-12-01 15:17:37,581 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-12-01 15:17:37,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:17:37,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1838516557, now seen corresponding path program 1 times [2020-12-01 15:17:37,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:17:37,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202265406] [2020-12-01 15:17:37,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:17:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:17:37,733 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2020-12-01 15:17:37,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202265406] [2020-12-01 15:17:37,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:17:37,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-01 15:17:37,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600148428] [2020-12-01 15:17:37,734 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 15:17:37,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:17:37,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 15:17:37,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-01 15:17:37,735 INFO L87 Difference]: Start difference. First operand 3094 states and 3745 transitions. Second operand 7 states. [2020-12-01 15:17:39,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:17:39,611 INFO L93 Difference]: Finished difference Result 6989 states and 8601 transitions. [2020-12-01 15:17:39,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-01 15:17:39,613 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 271 [2020-12-01 15:17:39,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:17:39,618 INFO L225 Difference]: With dead ends: 6989 [2020-12-01 15:17:39,618 INFO L226 Difference]: Without dead ends: 4391 [2020-12-01 15:17:39,620 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-12-01 15:17:39,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4391 states. [2020-12-01 15:17:40,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4391 to 3074. [2020-12-01 15:17:40,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3074 states. [2020-12-01 15:17:40,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 3074 states and 3715 transitions. [2020-12-01 15:17:40,412 INFO L78 Accepts]: Start accepts. Automaton has 3074 states and 3715 transitions. Word has length 271 [2020-12-01 15:17:40,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:17:40,412 INFO L481 AbstractCegarLoop]: Abstraction has 3074 states and 3715 transitions. [2020-12-01 15:17:40,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 15:17:40,412 INFO L276 IsEmpty]: Start isEmpty. Operand 3074 states and 3715 transitions. [2020-12-01 15:17:40,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2020-12-01 15:17:40,414 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:17:40,415 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, 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-12-01 15:17:40,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2020-12-01 15:17:40,415 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-12-01 15:17:40,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:17:40,415 INFO L82 PathProgramCache]: Analyzing trace with hash 806412456, now seen corresponding path program 1 times [2020-12-01 15:17:40,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:17:40,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551904868] [2020-12-01 15:17:40,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:17:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:17:40,613 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2020-12-01 15:17:40,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551904868] [2020-12-01 15:17:40,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:17:40,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-01 15:17:40,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203893726] [2020-12-01 15:17:40,615 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 15:17:40,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:17:40,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 15:17:40,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-01 15:17:40,616 INFO L87 Difference]: Start difference. First operand 3074 states and 3715 transitions. Second operand 7 states. [2020-12-01 15:17:43,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:17:43,063 INFO L93 Difference]: Finished difference Result 7983 states and 9813 transitions. [2020-12-01 15:17:43,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-01 15:17:43,065 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 274 [2020-12-01 15:17:43,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:17:43,071 INFO L225 Difference]: With dead ends: 7983 [2020-12-01 15:17:43,071 INFO L226 Difference]: Without dead ends: 5405 [2020-12-01 15:17:43,073 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-12-01 15:17:43,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5405 states. [2020-12-01 15:17:43,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5405 to 2994. [2020-12-01 15:17:43,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2994 states. [2020-12-01 15:17:43,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2994 states to 2994 states and 3590 transitions. [2020-12-01 15:17:43,902 INFO L78 Accepts]: Start accepts. Automaton has 2994 states and 3590 transitions. Word has length 274 [2020-12-01 15:17:43,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:17:43,902 INFO L481 AbstractCegarLoop]: Abstraction has 2994 states and 3590 transitions. [2020-12-01 15:17:43,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 15:17:43,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2994 states and 3590 transitions. [2020-12-01 15:17:43,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2020-12-01 15:17:43,906 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:17:43,906 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, 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-12-01 15:17:43,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2020-12-01 15:17:43,906 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-12-01 15:17:43,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:17:43,907 INFO L82 PathProgramCache]: Analyzing trace with hash -915720476, now seen corresponding path program 1 times [2020-12-01 15:17:43,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:17:43,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536202138] [2020-12-01 15:17:43,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:17:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:17:44,066 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2020-12-01 15:17:44,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536202138] [2020-12-01 15:17:44,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:17:44,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-01 15:17:44,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337033946] [2020-12-01 15:17:44,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 15:17:44,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:17:44,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 15:17:44,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-01 15:17:44,068 INFO L87 Difference]: Start difference. First operand 2994 states and 3590 transitions. Second operand 7 states. [2020-12-01 15:17:46,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:17:46,327 INFO L93 Difference]: Finished difference Result 7458 states and 9128 transitions. [2020-12-01 15:17:46,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-01 15:17:46,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 274 [2020-12-01 15:17:46,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:17:46,332 INFO L225 Difference]: With dead ends: 7458 [2020-12-01 15:17:46,332 INFO L226 Difference]: Without dead ends: 4960 [2020-12-01 15:17:46,335 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-12-01 15:17:46,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4960 states. [2020-12-01 15:17:47,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4960 to 2809. [2020-12-01 15:17:47,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2809 states. [2020-12-01 15:17:47,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2809 states to 2809 states and 3355 transitions. [2020-12-01 15:17:47,126 INFO L78 Accepts]: Start accepts. Automaton has 2809 states and 3355 transitions. Word has length 274 [2020-12-01 15:17:47,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:17:47,127 INFO L481 AbstractCegarLoop]: Abstraction has 2809 states and 3355 transitions. [2020-12-01 15:17:47,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 15:17:47,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2809 states and 3355 transitions. [2020-12-01 15:17:47,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2020-12-01 15:17:47,129 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:17:47,129 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 15:17:47,129 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2020-12-01 15:17:47,129 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-12-01 15:17:47,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:17:47,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1431201432, now seen corresponding path program 1 times [2020-12-01 15:17:47,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:17:47,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398108488] [2020-12-01 15:17:47,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:17:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:17:47,188 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:17:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:17:47,256 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:17:47,380 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-01 15:17:47,380 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-01 15:17:47,381 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2020-12-01 15:17:47,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 03:17:47 BoogieIcfgContainer [2020-12-01 15:17:47,678 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-01 15:17:47,678 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 15:17:47,678 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 15:17:47,678 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 15:17:47,679 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:12:47" (3/4) ... [2020-12-01 15:17:47,681 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-01 15:17:48,005 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2dc9288e-42ab-45f1-9070-ac5d16c58818/bin/uautomizer/witness.graphml [2020-12-01 15:17:48,006 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 15:17:48,007 INFO L168 Benchmark]: Toolchain (without parser) took 302560.46 ms. Allocated memory was 86.0 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 53.9 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 577.4 MB. Max. memory is 16.1 GB. [2020-12-01 15:17:48,007 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 86.0 MB. Free memory was 43.7 MB in the beginning and 43.7 MB in the end (delta: 39.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 15:17:48,008 INFO L168 Benchmark]: CACSL2BoogieTranslator took 521.30 ms. Allocated memory is still 86.0 MB. Free memory was 53.7 MB in the beginning and 56.4 MB in the end (delta: -2.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-01 15:17:48,008 INFO L168 Benchmark]: Boogie Procedure Inliner took 128.83 ms. Allocated memory is still 86.0 MB. Free memory was 56.4 MB in the beginning and 50.1 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-01 15:17:48,009 INFO L168 Benchmark]: Boogie Preprocessor took 133.26 ms. Allocated memory is still 86.0 MB. Free memory was 50.1 MB in the beginning and 44.8 MB in the end (delta: 5.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-01 15:17:48,009 INFO L168 Benchmark]: RCFGBuilder took 1741.15 ms. Allocated memory was 86.0 MB in the beginning and 144.7 MB in the end (delta: 58.7 MB). Free memory was 44.8 MB in the beginning and 107.9 MB in the end (delta: -63.1 MB). Peak memory consumption was 33.9 MB. Max. memory is 16.1 GB. [2020-12-01 15:17:48,010 INFO L168 Benchmark]: TraceAbstraction took 299696.66 ms. Allocated memory was 144.7 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 107.9 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 507.1 MB. Max. memory is 16.1 GB. [2020-12-01 15:17:48,010 INFO L168 Benchmark]: Witness Printer took 327.76 ms. Allocated memory is still 3.0 GB. Free memory was 2.5 GB in the beginning and 2.4 GB in the end (delta: 67.1 MB). Peak memory consumption was 67.1 MB. Max. memory is 16.1 GB. [2020-12-01 15:17:48,014 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.29 ms. Allocated memory is still 86.0 MB. Free memory was 43.7 MB in the beginning and 43.7 MB in the end (delta: 39.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 521.30 ms. Allocated memory is still 86.0 MB. Free memory was 53.7 MB in the beginning and 56.4 MB in the end (delta: -2.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 128.83 ms. Allocated memory is still 86.0 MB. Free memory was 56.4 MB in the beginning and 50.1 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 133.26 ms. Allocated memory is still 86.0 MB. Free memory was 50.1 MB in the beginning and 44.8 MB in the end (delta: 5.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1741.15 ms. Allocated memory was 86.0 MB in the beginning and 144.7 MB in the end (delta: 58.7 MB). Free memory was 44.8 MB in the beginning and 107.9 MB in the end (delta: -63.1 MB). Peak memory consumption was 33.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 299696.66 ms. Allocated memory was 144.7 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 107.9 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 507.1 MB. Max. memory is 16.1 GB. * Witness Printer took 327.76 ms. Allocated memory is still 3.0 GB. Free memory was 2.5 GB in the beginning and 2.4 GB in the end (delta: 67.1 MB). Peak memory consumption was 67.1 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 ; [L36] _Bool gate1Failed ; [L37] _Bool gate2Failed ; [L38] _Bool gate3Failed ; [L39] msg_t VALUE1 ; [L40] msg_t VALUE2 ; [L41] msg_t VALUE3 ; [L43] _Bool gate1Failed_History_0 ; [L44] _Bool gate1Failed_History_1 ; [L45] _Bool gate1Failed_History_2 ; [L46] _Bool gate2Failed_History_0 ; [L47] _Bool gate2Failed_History_1 ; [L48] _Bool gate2Failed_History_2 ; [L49] _Bool gate3Failed_History_0 ; [L50] _Bool gate3Failed_History_1 ; [L51] _Bool gate3Failed_History_2 ; [L52] int8_t votedValue_History_0 ; [L53] int8_t votedValue_History_1 ; [L54] 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] [L476] int c1 ; [L477] int i2 ; [L480] c1 = 0 [L481] gate1Failed = __VERIFIER_nondet_bool() [L482] gate2Failed = __VERIFIER_nondet_bool() [L483] gate3Failed = __VERIFIER_nondet_bool() [L484] VALUE1 = __VERIFIER_nondet_char() [L485] VALUE2 = __VERIFIER_nondet_char() [L486] VALUE3 = __VERIFIER_nondet_char() [L487] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L488] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L489] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L490] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L491] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L492] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L493] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L494] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L495] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L496] votedValue_History_0 = __VERIFIER_nondet_char() [L497] votedValue_History_1 = __VERIFIER_nondet_char() [L498] votedValue_History_2 = __VERIFIER_nondet_char() [L203] int tmp ; [L204] int tmp___0 ; [L205] int tmp___1 ; [L206] int tmp___2 ; [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] 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] [L71] 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] [L72] COND TRUE history_id == 0 [L126] 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] [L127] COND TRUE historyIndex == 0 [L128] 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] [L73] tmp = (int )read_history_bool(0, 0) [L74] 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] [L96] 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] [L71] 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] [L72] COND TRUE history_id == 0 [L126] 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] [L127] COND TRUE historyIndex == 0 [L128] 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] [L73] tmp = (int )read_history_bool(0, 0) [L74] 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] [L96] 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] [L71] 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] [L72] COND TRUE history_id == 0 [L126] 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] [L127] COND TRUE historyIndex == 0 [L128] 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] [L73] tmp = (int )read_history_bool(0, 0) [L74] 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] [L96] 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] [L71] 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] [L98] 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] [L209] tmp = add_history_type(0) [L210] COND FALSE !(! tmp) [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] 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] [L71] 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] [L72] 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] [L78] COND TRUE history_id == 1 [L126] 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] [L136] 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] [L137] COND TRUE historyIndex == 0 [L138] 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] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] 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] [L96] 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] [L71] 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] [L72] 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] [L78] COND TRUE history_id == 1 [L126] 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] [L136] 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] [L137] COND TRUE historyIndex == 0 [L138] 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] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] 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] [L96] 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] [L71] 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] [L72] 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] [L78] COND TRUE history_id == 1 [L126] 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] [L136] 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] [L137] COND TRUE historyIndex == 0 [L138] 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] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] 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] [L96] 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] [L71] 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] [L98] 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] [L213] tmp___0 = add_history_type(1) [L214] COND FALSE !(! tmp___0) [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] 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] [L71] 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] [L72] 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] [L78] 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] [L84] COND TRUE history_id == 2 [L126] 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] [L136] 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] [L146] 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] [L147] COND TRUE historyIndex == 0 [L148] 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] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] 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] [L96] 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] [L71] 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] [L72] 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] [L78] 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] [L84] COND TRUE history_id == 2 [L126] 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] [L136] 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] [L146] 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] [L147] COND TRUE historyIndex == 0 [L148] 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] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] 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] [L96] 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] [L71] 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] [L72] 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] [L78] 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] [L84] COND TRUE history_id == 2 [L126] 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] [L136] 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] [L146] 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] [L147] COND TRUE historyIndex == 0 [L148] 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] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] 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] [L96] 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] [L71] 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] [L98] 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] [L217] tmp___1 = add_history_type(2) [L218] COND FALSE !(! tmp___1) [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] 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] [L71] 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] [L72] 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] [L78] 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] [L84] 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] [L90] COND TRUE history_id == 3 [L106] 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] [L107] COND TRUE historyIndex == 0 [L108] 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] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] 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] [L96] 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] [L71] 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] [L72] 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] [L78] 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] [L84] 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] [L90] COND TRUE history_id == 3 [L106] 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] [L107] COND TRUE historyIndex == 0 [L108] 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] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] 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] [L96] 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] [L71] 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] [L72] 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] [L78] 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] [L84] 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] [L90] COND TRUE history_id == 3 [L106] 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] [L107] COND TRUE historyIndex == 0 [L108] 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] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] 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] [L96] 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] [L71] 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] [L98] 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] [L221] tmp___2 = add_history_type(3) [L222] COND FALSE !(! tmp___2) [L225] 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] [L499] i2 = init() [L500] COND FALSE !(!(i2)) 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] [L501] g1v_old = nomsg [L502] g1v_new = nomsg [L503] g2v_old = nomsg [L504] g2v_new = nomsg [L505] g3v_old = nomsg [L506] g3v_new = nomsg [L507] 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] [L508] COND TRUE i2 < 10 [L338] int8_t next_state ; [L339] msg_t tmp ; [L340] int tmp___0 ; [L343] gate1Failed = __VERIFIER_nondet_bool() [L181] COND TRUE history_id == 0 [L182] gate1Failed_History_2 = gate1Failed_History_1 [L183] gate1Failed_History_1 = gate1Failed_History_0 [L184] 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=1, gate1Failed_History_0=1, 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] [L345] COND TRUE \read(gate1Failed) 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=1, gate1Failed_History_0=1, 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] [L346] EXPR nomsg != nomsg && g1v_new == nomsg ? nomsg : 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=1, gate1Failed_History_0=1, 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] [L346] g1v_new = nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new [L369] int8_t next_state ; [L370] msg_t tmp ; [L371] int tmp___0 ; [L374] gate2Failed = __VERIFIER_nondet_bool() [L181] 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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, 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] [L186] COND TRUE history_id == 1 [L187] gate2Failed_History_2 = gate2Failed_History_1 [L188] gate2Failed_History_1 = gate2Failed_History_0 [L189] 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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L376] COND TRUE \read(gate2Failed) 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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L377] EXPR nomsg != nomsg && g2v_new == nomsg ? nomsg : 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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L377] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L400] int8_t next_state ; [L401] msg_t tmp ; [L402] int tmp___0 ; [L405] gate3Failed = __VERIFIER_nondet_bool() [L181] 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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L186] COND FALSE !(history_id == 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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L191] COND TRUE history_id == 2 [L192] gate3Failed_History_2 = gate3Failed_History_1 [L193] gate3Failed_History_1 = gate3Failed_History_0 [L194] gate3Failed_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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L407] COND FALSE !(\read(gate3Failed)) [L411] tmp = __VERIFIER_nondet_char() [L412] 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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L413] COND TRUE (int )next_state == 0 [L414] 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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L424] COND FALSE !(!((_Bool )tmp___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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L425] EXPR next_state != nomsg && g3v_new == nomsg ? next_state : g3v_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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L425] g3v_new = next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new [L431] int8_t voted_value ; [L434] voted_value = nomsg [L435] VALUE1 = g1v_old [L436] g1v_old = nomsg [L437] VALUE2 = g2v_old [L438] g2v_old = nomsg [L439] VALUE3 = g3v_old [L440] g3v_old = nomsg VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L441] COND TRUE (int )VALUE1 == (int )VALUE2 [L442] voted_value = VALUE1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L166] COND TRUE history_id == 3 [L167] votedValue_History_2 = votedValue_History_1 [L168] votedValue_History_1 = votedValue_History_0 [L169] votedValue_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L514] g1v_old = g1v_new [L515] g1v_new = nomsg [L516] g2v_old = g2v_new [L517] g2v_new = nomsg [L518] g3v_old = g3v_new [L519] g3v_new = nomsg [L230] int tmp ; [L231] int temp_count ; [L232] int8_t tmp___0 ; [L233] int8_t tmp___1 ; [L234] int8_t tmp___2 ; [L235] _Bool tmp___3 ; [L236] _Bool tmp___4 ; [L237] _Bool tmp___5 ; [L238] int8_t tmp___6 ; [L239] _Bool tmp___7 ; [L240] _Bool tmp___8 ; [L241] _Bool tmp___9 ; [L242] int8_t tmp___10 ; [L243] int8_t tmp___11 ; [L244] int8_t tmp___12 ; [L245] int8_t tmp___13 ; [L246] int8_t tmp___14 ; VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L249] COND FALSE !(! gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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 FALSE !(! gate2Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L255] COND TRUE ! gate3Failed [L256] tmp = 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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L260] COND FALSE !(!((_Bool )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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L126] COND TRUE 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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L127] COND FALSE !(historyIndex == 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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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 TRUE historyIndex == 1 [L131] return (gate1Failed_History_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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L261] tmp___3 = read_history_bool(0, 1) [L262] COND TRUE ! tmp___3 [L126] 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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L136] COND TRUE history_id == 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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L137] COND FALSE !(historyIndex == 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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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 TRUE historyIndex == 1 [L141] return (gate2Failed_History_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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L263] tmp___4 = read_history_bool(1, 1) [L264] COND TRUE ! tmp___4 [L126] 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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L136] COND FALSE !(history_id == 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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L146] COND TRUE history_id == 2 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L147] COND FALSE !(historyIndex == 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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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 TRUE historyIndex == 1 [L151] return (gate3Failed_History_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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L265] tmp___5 = read_history_bool(2, 1) [L266] COND TRUE ! tmp___5 [L267] temp_count = 0 [L106] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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___0 = read_history_int8(3, 0) [L269] COND TRUE (int )VALUE1 == (int )tmp___0 [L270] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L106] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L272] tmp___1 = read_history_int8(3, 0) [L273] COND TRUE (int )VALUE2 == (int )tmp___1 [L274] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L106] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L276] tmp___2 = read_history_int8(3, 0) [L277] COND TRUE (int )VALUE3 == (int )tmp___2 [L278] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L280] COND FALSE !((int )VALUE1 != (int )VALUE2) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L294] COND FALSE !(! (temp_count > 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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L106] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L107] COND FALSE !(historyIndex == 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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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 == 1 [L111] return (votedValue_History_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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L300] tmp___10 = read_history_int8(3, 1) [L301] COND FALSE !((int )tmp___10 > -2) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L106] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L320] tmp___11 = read_history_int8(3, 0) [L321] COND FALSE !((int )tmp___11 != (int )nomsg) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L333] return (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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L520] c1 = check() [L533] COND FALSE !(! arg) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L522] i2 ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, 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] [L508] COND TRUE i2 < 10 [L338] int8_t next_state ; [L339] msg_t tmp ; [L340] int tmp___0 ; [L343] gate1Failed = __VERIFIER_nondet_bool() [L181] COND TRUE history_id == 0 [L182] gate1Failed_History_2 = gate1Failed_History_1 [L183] gate1Failed_History_1 = gate1Failed_History_0 [L184] 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=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, 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] [L345] COND FALSE !(\read(gate1Failed)) [L349] tmp = __VERIFIER_nondet_char() [L350] 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=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, 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] [L351] COND TRUE (int )next_state == 0 [L352] 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=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, 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] [L362] COND FALSE !(!((_Bool )tmp___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=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, 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] [L363] 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=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, 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] [L363] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new [L369] int8_t next_state ; [L370] msg_t tmp ; [L371] int tmp___0 ; [L374] gate2Failed = __VERIFIER_nondet_bool() [L181] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, 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] [L186] COND TRUE history_id == 1 [L187] gate2Failed_History_2 = gate2Failed_History_1 [L188] gate2Failed_History_1 = gate2Failed_History_0 [L189] gate2Failed_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=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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] [L376] COND TRUE \read(gate2Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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] [L377] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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] [L377] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L400] int8_t next_state ; [L401] msg_t tmp ; [L402] int tmp___0 ; [L405] gate3Failed = __VERIFIER_nondet_bool() [L181] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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] [L186] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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] [L191] COND TRUE history_id == 2 [L192] gate3Failed_History_2 = gate3Failed_History_1 [L193] gate3Failed_History_1 = gate3Failed_History_0 [L194] gate3Failed_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=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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] [L407] COND TRUE \read(gate3Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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] [L408] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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] [L408] g3v_new = nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new [L431] int8_t voted_value ; [L434] voted_value = nomsg [L435] VALUE1 = g1v_old [L436] g1v_old = nomsg [L437] VALUE2 = g2v_old [L438] g2v_old = nomsg [L439] VALUE3 = g3v_old [L440] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L441] COND TRUE (int )VALUE1 == (int )VALUE2 [L442] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L166] COND TRUE history_id == 3 [L167] votedValue_History_2 = votedValue_History_1 [L168] votedValue_History_1 = votedValue_History_0 [L169] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L514] g1v_old = g1v_new [L515] g1v_new = nomsg [L516] g2v_old = g2v_new [L517] g2v_new = nomsg [L518] g3v_old = g3v_new [L519] g3v_new = nomsg [L230] int tmp ; [L231] int temp_count ; [L232] int8_t tmp___0 ; [L233] int8_t tmp___1 ; [L234] int8_t tmp___2 ; [L235] _Bool tmp___3 ; [L236] _Bool tmp___4 ; [L237] _Bool tmp___5 ; [L238] int8_t tmp___6 ; [L239] _Bool tmp___7 ; [L240] _Bool tmp___8 ; [L241] _Bool tmp___9 ; [L242] int8_t tmp___10 ; [L243] int8_t tmp___11 ; [L244] int8_t tmp___12 ; [L245] int8_t tmp___13 ; [L246] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L249] COND TRUE ! gate1Failed [L250] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L260] COND FALSE !(!((_Bool )tmp)) 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L127] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND TRUE historyIndex == 1 [L131] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] tmp___3 = read_history_bool(0, 1) [L262] COND FALSE !(! tmp___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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L106] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L107] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L110] COND TRUE historyIndex == 1 [L111] return (votedValue_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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L300] tmp___10 = read_history_int8(3, 1) [L301] COND TRUE (int )tmp___10 > -2 [L106] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L107] COND TRUE historyIndex == 0 [L108] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L302] tmp___6 = read_history_int8(3, 0) [L303] COND TRUE (int )tmp___6 == (int )nomsg [L126] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L127] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND TRUE historyIndex == 1 [L131] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L304] tmp___7 = read_history_bool(0, 1) [L305] COND TRUE \read(tmp___7) [L126] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L136] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L137] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L140] COND TRUE historyIndex == 1 [L141] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] tmp___8 = read_history_bool(1, 1) [L307] COND TRUE \read(tmp___8) [L126] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L136] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L146] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L147] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L150] COND TRUE historyIndex == 1 [L151] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] tmp___9 = read_history_bool(2, 1) [L309] COND TRUE ! tmp___9 [L310] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L520] c1 = check() [L533] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L3] __assert_fail("0", "pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 555 locations, 37 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 299.3s, OverallIterations: 59, TraceHistogramMax: 3, AutomataDifference: 252.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 30511 SDtfs, 51831 SDslu, 144078 SDs, 0 SdLazy, 41736 SolverSat, 1035 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5502 GetRequests, 2888 SyntacticMatches, 2 SemanticMatches, 2612 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728678 ImplicationChecksByTransitivity, 126.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12314occurred in iteration=49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 22.0s AutomataMinimizationTime, 58 MinimizatonAttempts, 222977 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 13.1s InterpolantComputationTime, 12788 NumberOfCodeBlocks, 12788 NumberOfCodeBlocksAsserted, 73 NumberOfCheckSat, 12441 ConstructedInterpolants, 0 QuantifiedInterpolants, 7416743 SizeOfPredicates, 62 NumberOfNonLiveVariables, 11847 ConjunctsInSsa, 212 ConjunctsInUnsatCore, 72 InterpolantComputations, 49 PerfectInterpolantSequences, 7713/8211 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...