./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dc59d56a03b0e275b4f62d2522e0dff35f3e7a25 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.1.24-678e011 [2019-11-20 01:17:30,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 01:17:30,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 01:17:30,143 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 01:17:30,144 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 01:17:30,145 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 01:17:30,146 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 01:17:30,148 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 01:17:30,150 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 01:17:30,151 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 01:17:30,152 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 01:17:30,153 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 01:17:30,153 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 01:17:30,154 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 01:17:30,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 01:17:30,156 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 01:17:30,157 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 01:17:30,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 01:17:30,160 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 01:17:30,162 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 01:17:30,163 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 01:17:30,164 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 01:17:30,165 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 01:17:30,166 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 01:17:30,168 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 01:17:30,168 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 01:17:30,169 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 01:17:30,169 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 01:17:30,170 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 01:17:30,171 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 01:17:30,171 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 01:17:30,172 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 01:17:30,172 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 01:17:30,173 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 01:17:30,174 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 01:17:30,174 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 01:17:30,175 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 01:17:30,175 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 01:17:30,175 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 01:17:30,176 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 01:17:30,177 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 01:17:30,177 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 01:17:30,190 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 01:17:30,190 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 01:17:30,191 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 01:17:30,191 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 01:17:30,192 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 01:17:30,192 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 01:17:30,192 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 01:17:30,192 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 01:17:30,192 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 01:17:30,193 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 01:17:30,193 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 01:17:30,193 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 01:17:30,193 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 01:17:30,194 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 01:17:30,194 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 01:17:30,194 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 01:17:30,194 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 01:17:30,194 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 01:17:30,195 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 01:17:30,195 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 01:17:30,195 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 01:17:30,195 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:17:30,196 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 01:17:30,196 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 01:17:30,196 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 01:17:30,196 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 01:17:30,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 01:17:30,197 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 01:17:30,197 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/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(__VERIFIER_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 -> dc59d56a03b0e275b4f62d2522e0dff35f3e7a25 [2019-11-20 01:17:30,330 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 01:17:30,339 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 01:17:30,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 01:17:30,344 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 01:17:30,344 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 01:17:30,345 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2019-11-20 01:17:30,393 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/bin/uautomizer/data/61d6f18f7/5288469f724449b4aba0949b60780b7c/FLAG9f7e73bf5 [2019-11-20 01:17:30,864 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 01:17:30,865 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2019-11-20 01:17:30,881 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/bin/uautomizer/data/61d6f18f7/5288469f724449b4aba0949b60780b7c/FLAG9f7e73bf5 [2019-11-20 01:17:31,366 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/bin/uautomizer/data/61d6f18f7/5288469f724449b4aba0949b60780b7c [2019-11-20 01:17:31,369 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 01:17:31,370 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 01:17:31,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 01:17:31,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 01:17:31,375 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 01:17:31,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:17:31" (1/1) ... [2019-11-20 01:17:31,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3440089a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:17:31, skipping insertion in model container [2019-11-20 01:17:31,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:17:31" (1/1) ... [2019-11-20 01:17:31,392 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 01:17:31,435 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 01:17:31,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:17:31,721 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 01:17:31,777 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:17:31,794 INFO L192 MainTranslator]: Completed translation [2019-11-20 01:17:31,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:17:31 WrapperNode [2019-11-20 01:17:31,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 01:17:31,795 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 01:17:31,795 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 01:17:31,795 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 01:17:31,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:17:31" (1/1) ... [2019-11-20 01:17:31,813 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:17:31" (1/1) ... [2019-11-20 01:17:31,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 01:17:31,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 01:17:31,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 01:17:31,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 01:17:31,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:17:31" (1/1) ... [2019-11-20 01:17:31,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:17:31" (1/1) ... [2019-11-20 01:17:31,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:17:31" (1/1) ... [2019-11-20 01:17:31,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:17:31" (1/1) ... [2019-11-20 01:17:31,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:17:31" (1/1) ... [2019-11-20 01:17:31,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:17:31" (1/1) ... [2019-11-20 01:17:31,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:17:31" (1/1) ... [2019-11-20 01:17:32,016 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 01:17:32,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 01:17:32,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 01:17:32,018 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 01:17:32,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:17:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/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 [2019-11-20 01:17:32,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 01:17:32,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 01:17:33,642 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 01:17:33,643 INFO L285 CfgBuilder]: Removed 173 assume(true) statements. [2019-11-20 01:17:33,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:17:33 BoogieIcfgContainer [2019-11-20 01:17:33,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 01:17:33,645 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 01:17:33,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 01:17:33,650 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 01:17:33,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:17:31" (1/3) ... [2019-11-20 01:17:33,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ad6ade7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:17:33, skipping insertion in model container [2019-11-20 01:17:33,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:17:31" (2/3) ... [2019-11-20 01:17:33,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ad6ade7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:17:33, skipping insertion in model container [2019-11-20 01:17:33,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:17:33" (3/3) ... [2019-11-20 01:17:33,657 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2019-11-20 01:17:33,666 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 01:17:33,676 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2019-11-20 01:17:33,686 INFO L249 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2019-11-20 01:17:33,712 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 01:17:33,712 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 01:17:33,712 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 01:17:33,712 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 01:17:33,712 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 01:17:33,712 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 01:17:33,713 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 01:17:33,713 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 01:17:33,742 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states. [2019-11-20 01:17:33,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 01:17:33,749 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:33,749 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:17:33,751 INFO L410 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]=== [2019-11-20 01:17:33,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:33,756 INFO L82 PathProgramCache]: Analyzing trace with hash 595705480, now seen corresponding path program 1 times [2019-11-20 01:17:33,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:33,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586780055] [2019-11-20 01:17:33,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:33,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:17:33,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586780055] [2019-11-20 01:17:33,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:33,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:17:33,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550392032] [2019-11-20 01:17:33,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:17:33,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:33,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:17:33,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:33,984 INFO L87 Difference]: Start difference. First operand 514 states. Second operand 3 states. [2019-11-20 01:17:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:34,296 INFO L93 Difference]: Finished difference Result 1232 states and 2027 transitions. [2019-11-20 01:17:34,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:17:34,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-20 01:17:34,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:34,317 INFO L225 Difference]: With dead ends: 1232 [2019-11-20 01:17:34,317 INFO L226 Difference]: Without dead ends: 712 [2019-11-20 01:17:34,323 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:34,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-11-20 01:17:34,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 450. [2019-11-20 01:17:34,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-11-20 01:17:34,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 704 transitions. [2019-11-20 01:17:34,406 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 704 transitions. Word has length 9 [2019-11-20 01:17:34,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:34,407 INFO L462 AbstractCegarLoop]: Abstraction has 450 states and 704 transitions. [2019-11-20 01:17:34,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:17:34,407 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 704 transitions. [2019-11-20 01:17:34,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 01:17:34,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:34,410 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:17:34,411 INFO L410 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]=== [2019-11-20 01:17:34,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:34,412 INFO L82 PathProgramCache]: Analyzing trace with hash -503954138, now seen corresponding path program 1 times [2019-11-20 01:17:34,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:34,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554880331] [2019-11-20 01:17:34,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:34,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:17:34,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554880331] [2019-11-20 01:17:34,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:34,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:17:34,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30828143] [2019-11-20 01:17:34,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:17:34,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:34,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:17:34,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:34,488 INFO L87 Difference]: Start difference. First operand 450 states and 704 transitions. Second operand 3 states. [2019-11-20 01:17:34,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:34,574 INFO L93 Difference]: Finished difference Result 1110 states and 1722 transitions. [2019-11-20 01:17:34,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:17:34,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-20 01:17:34,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:34,580 INFO L225 Difference]: With dead ends: 1110 [2019-11-20 01:17:34,580 INFO L226 Difference]: Without dead ends: 662 [2019-11-20 01:17:34,583 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:34,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-11-20 01:17:34,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 417. [2019-11-20 01:17:34,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-11-20 01:17:34,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 646 transitions. [2019-11-20 01:17:34,608 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 646 transitions. Word has length 10 [2019-11-20 01:17:34,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:34,608 INFO L462 AbstractCegarLoop]: Abstraction has 417 states and 646 transitions. [2019-11-20 01:17:34,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:17:34,609 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 646 transitions. [2019-11-20 01:17:34,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 01:17:34,610 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:34,610 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:17:34,611 INFO L410 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]=== [2019-11-20 01:17:34,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:34,611 INFO L82 PathProgramCache]: Analyzing trace with hash -674152124, now seen corresponding path program 1 times [2019-11-20 01:17:34,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:34,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422611305] [2019-11-20 01:17:34,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:34,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:17:34,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422611305] [2019-11-20 01:17:34,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:34,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:17:34,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986584259] [2019-11-20 01:17:34,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:17:34,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:34,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:17:34,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:34,657 INFO L87 Difference]: Start difference. First operand 417 states and 646 transitions. Second operand 3 states. [2019-11-20 01:17:34,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:34,726 INFO L93 Difference]: Finished difference Result 1229 states and 1909 transitions. [2019-11-20 01:17:34,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:17:34,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-20 01:17:34,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:34,732 INFO L225 Difference]: With dead ends: 1229 [2019-11-20 01:17:34,733 INFO L226 Difference]: Without dead ends: 822 [2019-11-20 01:17:34,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:34,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2019-11-20 01:17:34,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 421. [2019-11-20 01:17:34,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-11-20 01:17:34,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 650 transitions. [2019-11-20 01:17:34,753 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 650 transitions. Word has length 13 [2019-11-20 01:17:34,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:34,754 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 650 transitions. [2019-11-20 01:17:34,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:17:34,754 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 650 transitions. [2019-11-20 01:17:34,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 01:17:34,758 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:34,758 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:17:34,758 INFO L410 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]=== [2019-11-20 01:17:34,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:34,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1826556945, now seen corresponding path program 1 times [2019-11-20 01:17:34,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:34,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023931640] [2019-11-20 01:17:34,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:34,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:17:34,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023931640] [2019-11-20 01:17:34,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:34,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:17:34,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101887871] [2019-11-20 01:17:34,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:17:34,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:34,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:17:34,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:34,862 INFO L87 Difference]: Start difference. First operand 421 states and 650 transitions. Second operand 3 states. [2019-11-20 01:17:34,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:34,887 INFO L93 Difference]: Finished difference Result 657 states and 1008 transitions. [2019-11-20 01:17:34,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:17:34,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-20 01:17:34,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:34,891 INFO L225 Difference]: With dead ends: 657 [2019-11-20 01:17:34,891 INFO L226 Difference]: Without dead ends: 421 [2019-11-20 01:17:34,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:34,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-11-20 01:17:34,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2019-11-20 01:17:34,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-11-20 01:17:34,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 646 transitions. [2019-11-20 01:17:34,907 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 646 transitions. Word has length 17 [2019-11-20 01:17:34,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:34,908 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 646 transitions. [2019-11-20 01:17:34,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:17:34,908 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 646 transitions. [2019-11-20 01:17:34,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 01:17:34,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:34,910 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:17:34,910 INFO L410 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]=== [2019-11-20 01:17:34,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:34,911 INFO L82 PathProgramCache]: Analyzing trace with hash -35486156, now seen corresponding path program 1 times [2019-11-20 01:17:34,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:34,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004850383] [2019-11-20 01:17:34,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:34,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:17:34,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004850383] [2019-11-20 01:17:34,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:34,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:17:34,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979568362] [2019-11-20 01:17:34,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:17:34,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:34,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:17:34,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:17:34,972 INFO L87 Difference]: Start difference. First operand 421 states and 646 transitions. Second operand 4 states. [2019-11-20 01:17:35,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:35,043 INFO L93 Difference]: Finished difference Result 1072 states and 1640 transitions. [2019-11-20 01:17:35,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:17:35,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-20 01:17:35,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:35,048 INFO L225 Difference]: With dead ends: 1072 [2019-11-20 01:17:35,049 INFO L226 Difference]: Without dead ends: 663 [2019-11-20 01:17:35,050 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:17:35,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-11-20 01:17:35,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 421. [2019-11-20 01:17:35,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-11-20 01:17:35,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 645 transitions. [2019-11-20 01:17:35,064 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 645 transitions. Word has length 18 [2019-11-20 01:17:35,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:35,064 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 645 transitions. [2019-11-20 01:17:35,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:17:35,065 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 645 transitions. [2019-11-20 01:17:35,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 01:17:35,065 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:35,066 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:17:35,066 INFO L410 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]=== [2019-11-20 01:17:35,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:35,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1967275947, now seen corresponding path program 1 times [2019-11-20 01:17:35,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:35,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296223852] [2019-11-20 01:17:35,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:35,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 01:17:35,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296223852] [2019-11-20 01:17:35,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:35,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:17:35,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691625214] [2019-11-20 01:17:35,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:17:35,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:35,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:17:35,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:35,097 INFO L87 Difference]: Start difference. First operand 421 states and 645 transitions. Second operand 3 states. [2019-11-20 01:17:35,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:35,221 INFO L93 Difference]: Finished difference Result 1014 states and 1542 transitions. [2019-11-20 01:17:35,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:17:35,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-20 01:17:35,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:35,225 INFO L225 Difference]: With dead ends: 1014 [2019-11-20 01:17:35,225 INFO L226 Difference]: Without dead ends: 608 [2019-11-20 01:17:35,226 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:35,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-11-20 01:17:35,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 376. [2019-11-20 01:17:35,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-11-20 01:17:35,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 565 transitions. [2019-11-20 01:17:35,239 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 565 transitions. Word has length 21 [2019-11-20 01:17:35,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:35,239 INFO L462 AbstractCegarLoop]: Abstraction has 376 states and 565 transitions. [2019-11-20 01:17:35,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:17:35,239 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 565 transitions. [2019-11-20 01:17:35,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 01:17:35,240 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:35,240 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:17:35,241 INFO L410 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]=== [2019-11-20 01:17:35,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:35,241 INFO L82 PathProgramCache]: Analyzing trace with hash -385095713, now seen corresponding path program 1 times [2019-11-20 01:17:35,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:35,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910234952] [2019-11-20 01:17:35,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:35,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 01:17:35,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910234952] [2019-11-20 01:17:35,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:35,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:17:35,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263178134] [2019-11-20 01:17:35,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:17:35,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:35,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:17:35,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:35,268 INFO L87 Difference]: Start difference. First operand 376 states and 565 transitions. Second operand 3 states. [2019-11-20 01:17:35,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:35,330 INFO L93 Difference]: Finished difference Result 935 states and 1404 transitions. [2019-11-20 01:17:35,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:17:35,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-20 01:17:35,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:35,334 INFO L225 Difference]: With dead ends: 935 [2019-11-20 01:17:35,334 INFO L226 Difference]: Without dead ends: 574 [2019-11-20 01:17:35,335 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:35,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-11-20 01:17:35,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 350. [2019-11-20 01:17:35,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-11-20 01:17:35,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 519 transitions. [2019-11-20 01:17:35,347 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 519 transitions. Word has length 21 [2019-11-20 01:17:35,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:35,347 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 519 transitions. [2019-11-20 01:17:35,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:17:35,348 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 519 transitions. [2019-11-20 01:17:35,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 01:17:35,348 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:35,349 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:17:35,349 INFO L410 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]=== [2019-11-20 01:17:35,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:35,349 INFO L82 PathProgramCache]: Analyzing trace with hash 2032684668, now seen corresponding path program 1 times [2019-11-20 01:17:35,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:35,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71299721] [2019-11-20 01:17:35,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:35,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 01:17:35,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71299721] [2019-11-20 01:17:35,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:35,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:17:35,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158741271] [2019-11-20 01:17:35,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:17:35,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:35,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:17:35,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:17:35,398 INFO L87 Difference]: Start difference. First operand 350 states and 519 transitions. Second operand 4 states. [2019-11-20 01:17:35,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:35,466 INFO L93 Difference]: Finished difference Result 896 states and 1335 transitions. [2019-11-20 01:17:35,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:17:35,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-20 01:17:35,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:35,471 INFO L225 Difference]: With dead ends: 896 [2019-11-20 01:17:35,471 INFO L226 Difference]: Without dead ends: 572 [2019-11-20 01:17:35,472 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:17:35,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-11-20 01:17:35,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 350. [2019-11-20 01:17:35,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-11-20 01:17:35,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 518 transitions. [2019-11-20 01:17:35,484 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 518 transitions. Word has length 31 [2019-11-20 01:17:35,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:35,484 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 518 transitions. [2019-11-20 01:17:35,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:17:35,485 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 518 transitions. [2019-11-20 01:17:35,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 01:17:35,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:35,487 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:17:35,487 INFO L410 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]=== [2019-11-20 01:17:35,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:35,488 INFO L82 PathProgramCache]: Analyzing trace with hash -290926641, now seen corresponding path program 1 times [2019-11-20 01:17:35,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:35,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422589135] [2019-11-20 01:17:35,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:35,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 01:17:35,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422589135] [2019-11-20 01:17:35,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:35,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:17:35,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234978498] [2019-11-20 01:17:35,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:17:35,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:35,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:17:35,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:35,543 INFO L87 Difference]: Start difference. First operand 350 states and 518 transitions. Second operand 3 states. [2019-11-20 01:17:35,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:35,597 INFO L93 Difference]: Finished difference Result 869 states and 1298 transitions. [2019-11-20 01:17:35,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:17:35,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-20 01:17:35,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:35,602 INFO L225 Difference]: With dead ends: 869 [2019-11-20 01:17:35,602 INFO L226 Difference]: Without dead ends: 548 [2019-11-20 01:17:35,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:35,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-11-20 01:17:35,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 327. [2019-11-20 01:17:35,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-11-20 01:17:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 480 transitions. [2019-11-20 01:17:35,615 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 480 transitions. Word has length 34 [2019-11-20 01:17:35,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:35,615 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 480 transitions. [2019-11-20 01:17:35,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:17:35,616 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 480 transitions. [2019-11-20 01:17:35,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 01:17:35,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:35,618 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:17:35,618 INFO L410 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]=== [2019-11-20 01:17:35,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:35,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1984299198, now seen corresponding path program 1 times [2019-11-20 01:17:35,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:35,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898999192] [2019-11-20 01:17:35,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:35,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 01:17:35,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898999192] [2019-11-20 01:17:35,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:35,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:17:35,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990811284] [2019-11-20 01:17:35,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:17:35,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:35,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:17:35,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:35,664 INFO L87 Difference]: Start difference. First operand 327 states and 480 transitions. Second operand 3 states. [2019-11-20 01:17:35,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:35,754 INFO L93 Difference]: Finished difference Result 731 states and 1074 transitions. [2019-11-20 01:17:35,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:17:35,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-20 01:17:35,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:35,760 INFO L225 Difference]: With dead ends: 731 [2019-11-20 01:17:35,761 INFO L226 Difference]: Without dead ends: 433 [2019-11-20 01:17:35,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:35,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-11-20 01:17:35,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 295. [2019-11-20 01:17:35,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-11-20 01:17:35,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 420 transitions. [2019-11-20 01:17:35,771 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 420 transitions. Word has length 35 [2019-11-20 01:17:35,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:35,773 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 420 transitions. [2019-11-20 01:17:35,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:17:35,774 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 420 transitions. [2019-11-20 01:17:35,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-20 01:17:35,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:35,775 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:17:35,775 INFO L410 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]=== [2019-11-20 01:17:35,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:35,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1766202321, now seen corresponding path program 1 times [2019-11-20 01:17:35,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:35,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038348735] [2019-11-20 01:17:35,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:35,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 01:17:35,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038348735] [2019-11-20 01:17:35,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:35,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:17:35,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087839847] [2019-11-20 01:17:35,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:17:35,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:35,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:17:35,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:17:35,828 INFO L87 Difference]: Start difference. First operand 295 states and 420 transitions. Second operand 4 states. [2019-11-20 01:17:35,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:35,883 INFO L93 Difference]: Finished difference Result 752 states and 1086 transitions. [2019-11-20 01:17:35,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:17:35,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-11-20 01:17:35,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:35,888 INFO L225 Difference]: With dead ends: 752 [2019-11-20 01:17:35,888 INFO L226 Difference]: Without dead ends: 499 [2019-11-20 01:17:35,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:17:35,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-11-20 01:17:35,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 295. [2019-11-20 01:17:35,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-11-20 01:17:35,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 419 transitions. [2019-11-20 01:17:35,899 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 419 transitions. Word has length 46 [2019-11-20 01:17:35,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:35,899 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 419 transitions. [2019-11-20 01:17:35,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:17:35,900 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 419 transitions. [2019-11-20 01:17:35,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 01:17:35,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:35,901 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:17:35,902 INFO L410 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]=== [2019-11-20 01:17:35,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:35,902 INFO L82 PathProgramCache]: Analyzing trace with hash -544708160, now seen corresponding path program 1 times [2019-11-20 01:17:35,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:35,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014880378] [2019-11-20 01:17:35,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:35,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:17:35,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014880378] [2019-11-20 01:17:35,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:35,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:17:35,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773651534] [2019-11-20 01:17:35,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:17:35,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:35,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:17:35,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:35,961 INFO L87 Difference]: Start difference. First operand 295 states and 419 transitions. Second operand 3 states. [2019-11-20 01:17:36,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:36,005 INFO L93 Difference]: Finished difference Result 633 states and 933 transitions. [2019-11-20 01:17:36,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:17:36,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-20 01:17:36,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:36,008 INFO L225 Difference]: With dead ends: 633 [2019-11-20 01:17:36,009 INFO L226 Difference]: Without dead ends: 383 [2019-11-20 01:17:36,009 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:36,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-11-20 01:17:36,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 255. [2019-11-20 01:17:36,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-20 01:17:36,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 369 transitions. [2019-11-20 01:17:36,018 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 369 transitions. Word has length 49 [2019-11-20 01:17:36,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:36,019 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 369 transitions. [2019-11-20 01:17:36,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:17:36,019 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 369 transitions. [2019-11-20 01:17:36,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 01:17:36,020 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:36,020 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:17:36,021 INFO L410 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]=== [2019-11-20 01:17:36,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:36,021 INFO L82 PathProgramCache]: Analyzing trace with hash 390941353, now seen corresponding path program 1 times [2019-11-20 01:17:36,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:36,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210624514] [2019-11-20 01:17:36,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:36,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:17:36,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210624514] [2019-11-20 01:17:36,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:36,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:17:36,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225712485] [2019-11-20 01:17:36,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:17:36,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:36,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:17:36,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:36,070 INFO L87 Difference]: Start difference. First operand 255 states and 369 transitions. Second operand 3 states. [2019-11-20 01:17:36,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:36,110 INFO L93 Difference]: Finished difference Result 435 states and 642 transitions. [2019-11-20 01:17:36,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:17:36,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-20 01:17:36,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:36,113 INFO L225 Difference]: With dead ends: 435 [2019-11-20 01:17:36,113 INFO L226 Difference]: Without dead ends: 225 [2019-11-20 01:17:36,114 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:36,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-11-20 01:17:36,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2019-11-20 01:17:36,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-11-20 01:17:36,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 323 transitions. [2019-11-20 01:17:36,122 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 323 transitions. Word has length 56 [2019-11-20 01:17:36,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:36,123 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 323 transitions. [2019-11-20 01:17:36,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:17:36,123 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 323 transitions. [2019-11-20 01:17:36,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 01:17:36,124 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:36,124 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:17:36,124 INFO L410 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]=== [2019-11-20 01:17:36,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:36,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1746044383, now seen corresponding path program 1 times [2019-11-20 01:17:36,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:36,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733660550] [2019-11-20 01:17:36,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:36,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:17:36,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733660550] [2019-11-20 01:17:36,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:36,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:17:36,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218177492] [2019-11-20 01:17:36,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:17:36,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:36,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:17:36,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:17:36,168 INFO L87 Difference]: Start difference. First operand 225 states and 323 transitions. Second operand 4 states. [2019-11-20 01:17:36,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:36,208 INFO L93 Difference]: Finished difference Result 393 states and 576 transitions. [2019-11-20 01:17:36,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:17:36,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-20 01:17:36,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:36,210 INFO L225 Difference]: With dead ends: 393 [2019-11-20 01:17:36,210 INFO L226 Difference]: Without dead ends: 225 [2019-11-20 01:17:36,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:17:36,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-11-20 01:17:36,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2019-11-20 01:17:36,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-11-20 01:17:36,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 322 transitions. [2019-11-20 01:17:36,218 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 322 transitions. Word has length 59 [2019-11-20 01:17:36,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:36,218 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 322 transitions. [2019-11-20 01:17:36,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:17:36,218 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 322 transitions. [2019-11-20 01:17:36,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-20 01:17:36,219 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:36,219 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:17:36,219 INFO L410 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]=== [2019-11-20 01:17:36,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:36,219 INFO L82 PathProgramCache]: Analyzing trace with hash 621112538, now seen corresponding path program 1 times [2019-11-20 01:17:36,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:36,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924684985] [2019-11-20 01:17:36,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:36,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:17:36,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924684985] [2019-11-20 01:17:36,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:36,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:17:36,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703740359] [2019-11-20 01:17:36,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:17:36,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:36,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:17:36,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:36,255 INFO L87 Difference]: Start difference. First operand 225 states and 322 transitions. Second operand 3 states. [2019-11-20 01:17:36,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:36,284 INFO L93 Difference]: Finished difference Result 522 states and 773 transitions. [2019-11-20 01:17:36,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:17:36,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-11-20 01:17:36,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:36,287 INFO L225 Difference]: With dead ends: 522 [2019-11-20 01:17:36,287 INFO L226 Difference]: Without dead ends: 357 [2019-11-20 01:17:36,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:36,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-11-20 01:17:36,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 220. [2019-11-20 01:17:36,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-20 01:17:36,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 314 transitions. [2019-11-20 01:17:36,296 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 314 transitions. Word has length 62 [2019-11-20 01:17:36,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:36,297 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 314 transitions. [2019-11-20 01:17:36,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:17:36,297 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 314 transitions. [2019-11-20 01:17:36,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-20 01:17:36,297 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:36,298 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:17:36,298 INFO L410 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]=== [2019-11-20 01:17:36,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:36,298 INFO L82 PathProgramCache]: Analyzing trace with hash 114301335, now seen corresponding path program 1 times [2019-11-20 01:17:36,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:36,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385461744] [2019-11-20 01:17:36,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:36,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:17:36,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385461744] [2019-11-20 01:17:36,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:36,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:17:36,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878752565] [2019-11-20 01:17:36,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:17:36,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:36,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:17:36,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:36,375 INFO L87 Difference]: Start difference. First operand 220 states and 314 transitions. Second operand 3 states. [2019-11-20 01:17:36,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:36,402 INFO L93 Difference]: Finished difference Result 503 states and 744 transitions. [2019-11-20 01:17:36,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:17:36,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-20 01:17:36,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:36,405 INFO L225 Difference]: With dead ends: 503 [2019-11-20 01:17:36,405 INFO L226 Difference]: Without dead ends: 343 [2019-11-20 01:17:36,405 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:36,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-11-20 01:17:36,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 216. [2019-11-20 01:17:36,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-20 01:17:36,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 307 transitions. [2019-11-20 01:17:36,415 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 307 transitions. Word has length 67 [2019-11-20 01:17:36,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:36,415 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 307 transitions. [2019-11-20 01:17:36,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:17:36,415 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 307 transitions. [2019-11-20 01:17:36,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 01:17:36,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:36,416 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:17:36,416 INFO L410 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]=== [2019-11-20 01:17:36,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:36,416 INFO L82 PathProgramCache]: Analyzing trace with hash 2093726931, now seen corresponding path program 1 times [2019-11-20 01:17:36,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:36,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545925268] [2019-11-20 01:17:36,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:36,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:17:36,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545925268] [2019-11-20 01:17:36,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:36,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:17:36,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379437166] [2019-11-20 01:17:36,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:17:36,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:36,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:17:36,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:36,463 INFO L87 Difference]: Start difference. First operand 216 states and 307 transitions. Second operand 3 states. [2019-11-20 01:17:36,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:36,485 INFO L93 Difference]: Finished difference Result 370 states and 540 transitions. [2019-11-20 01:17:36,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:17:36,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-20 01:17:36,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:36,487 INFO L225 Difference]: With dead ends: 370 [2019-11-20 01:17:36,488 INFO L226 Difference]: Without dead ends: 214 [2019-11-20 01:17:36,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:36,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-11-20 01:17:36,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2019-11-20 01:17:36,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-11-20 01:17:36,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 301 transitions. [2019-11-20 01:17:36,496 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 301 transitions. Word has length 73 [2019-11-20 01:17:36,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:36,497 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 301 transitions. [2019-11-20 01:17:36,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:17:36,497 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 301 transitions. [2019-11-20 01:17:36,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 01:17:36,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:36,503 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:17:36,503 INFO L410 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]=== [2019-11-20 01:17:36,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:36,503 INFO L82 PathProgramCache]: Analyzing trace with hash 450137978, now seen corresponding path program 1 times [2019-11-20 01:17:36,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:36,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481615697] [2019-11-20 01:17:36,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:36,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:17:36,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481615697] [2019-11-20 01:17:36,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:36,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:17:36,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141816690] [2019-11-20 01:17:36,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:17:36,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:36,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:17:36,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:36,547 INFO L87 Difference]: Start difference. First operand 213 states and 301 transitions. Second operand 3 states. [2019-11-20 01:17:36,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:36,559 INFO L93 Difference]: Finished difference Result 411 states and 597 transitions. [2019-11-20 01:17:36,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:17:36,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-11-20 01:17:36,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:36,561 INFO L225 Difference]: With dead ends: 411 [2019-11-20 01:17:36,561 INFO L226 Difference]: Without dead ends: 258 [2019-11-20 01:17:36,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:36,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-20 01:17:36,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 210. [2019-11-20 01:17:36,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-20 01:17:36,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 297 transitions. [2019-11-20 01:17:36,570 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 297 transitions. Word has length 81 [2019-11-20 01:17:36,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:36,571 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 297 transitions. [2019-11-20 01:17:36,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:17:36,571 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 297 transitions. [2019-11-20 01:17:36,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-20 01:17:36,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:36,572 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:17:36,572 INFO L410 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]=== [2019-11-20 01:17:36,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:36,573 INFO L82 PathProgramCache]: Analyzing trace with hash 17499620, now seen corresponding path program 1 times [2019-11-20 01:17:36,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:36,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810840755] [2019-11-20 01:17:36,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:36,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:17:36,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810840755] [2019-11-20 01:17:36,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:36,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:17:36,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992930558] [2019-11-20 01:17:36,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:17:36,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:36,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:17:36,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:17:36,694 INFO L87 Difference]: Start difference. First operand 210 states and 297 transitions. Second operand 4 states. [2019-11-20 01:17:36,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:36,796 INFO L93 Difference]: Finished difference Result 535 states and 778 transitions. [2019-11-20 01:17:36,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:17:36,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-20 01:17:36,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:36,799 INFO L225 Difference]: With dead ends: 535 [2019-11-20 01:17:36,799 INFO L226 Difference]: Without dead ends: 385 [2019-11-20 01:17:36,800 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:17:36,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-11-20 01:17:36,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 291. [2019-11-20 01:17:36,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-11-20 01:17:36,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 414 transitions. [2019-11-20 01:17:36,816 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 414 transitions. Word has length 82 [2019-11-20 01:17:36,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:36,816 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 414 transitions. [2019-11-20 01:17:36,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:17:36,816 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 414 transitions. [2019-11-20 01:17:36,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 01:17:36,817 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:36,817 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:17:36,818 INFO L410 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]=== [2019-11-20 01:17:36,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:36,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1027173863, now seen corresponding path program 1 times [2019-11-20 01:17:36,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:36,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565934107] [2019-11-20 01:17:36,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:36,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:17:36,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565934107] [2019-11-20 01:17:36,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:36,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:17:36,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173179247] [2019-11-20 01:17:36,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:17:36,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:36,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:17:36,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:36,885 INFO L87 Difference]: Start difference. First operand 291 states and 414 transitions. Second operand 3 states. [2019-11-20 01:17:36,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:36,923 INFO L93 Difference]: Finished difference Result 690 states and 1006 transitions. [2019-11-20 01:17:36,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:17:36,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-20 01:17:36,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:36,927 INFO L225 Difference]: With dead ends: 690 [2019-11-20 01:17:36,927 INFO L226 Difference]: Without dead ends: 497 [2019-11-20 01:17:36,927 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:36,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-11-20 01:17:36,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 360. [2019-11-20 01:17:36,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-11-20 01:17:36,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 511 transitions. [2019-11-20 01:17:36,946 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 511 transitions. Word has length 100 [2019-11-20 01:17:36,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:36,947 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 511 transitions. [2019-11-20 01:17:36,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:17:36,947 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 511 transitions. [2019-11-20 01:17:36,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 01:17:36,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:36,948 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:17:36,949 INFO L410 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]=== [2019-11-20 01:17:36,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:36,949 INFO L82 PathProgramCache]: Analyzing trace with hash -2145780492, now seen corresponding path program 1 times [2019-11-20 01:17:36,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:36,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807161172] [2019-11-20 01:17:36,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:37,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:17:37,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807161172] [2019-11-20 01:17:37,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:37,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:17:37,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534403841] [2019-11-20 01:17:37,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:17:37,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:37,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:17:37,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:37,003 INFO L87 Difference]: Start difference. First operand 360 states and 511 transitions. Second operand 3 states. [2019-11-20 01:17:37,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:37,043 INFO L93 Difference]: Finished difference Result 836 states and 1213 transitions. [2019-11-20 01:17:37,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:17:37,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-20 01:17:37,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:37,047 INFO L225 Difference]: With dead ends: 836 [2019-11-20 01:17:37,047 INFO L226 Difference]: Without dead ends: 601 [2019-11-20 01:17:37,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:37,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-11-20 01:17:37,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 452. [2019-11-20 01:17:37,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-11-20 01:17:37,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 641 transitions. [2019-11-20 01:17:37,075 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 641 transitions. Word has length 101 [2019-11-20 01:17:37,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:37,076 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 641 transitions. [2019-11-20 01:17:37,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:17:37,076 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 641 transitions. [2019-11-20 01:17:37,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 01:17:37,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:37,077 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:17:37,078 INFO L410 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]=== [2019-11-20 01:17:37,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:37,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1333981650, now seen corresponding path program 1 times [2019-11-20 01:17:37,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:37,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526022189] [2019-11-20 01:17:37,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:37,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:17:37,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526022189] [2019-11-20 01:17:37,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383425311] [2019-11-20 01:17:37,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/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 [2019-11-20 01:17:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:37,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 01:17:37,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:17:37,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:17:37,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:17:37,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-20 01:17:37,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502360190] [2019-11-20 01:17:37,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 01:17:37,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:37,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 01:17:37,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:17:37,338 INFO L87 Difference]: Start difference. First operand 452 states and 641 transitions. Second operand 6 states. [2019-11-20 01:17:37,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:37,723 INFO L93 Difference]: Finished difference Result 1188 states and 1640 transitions. [2019-11-20 01:17:37,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 01:17:37,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-11-20 01:17:37,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:37,729 INFO L225 Difference]: With dead ends: 1188 [2019-11-20 01:17:37,729 INFO L226 Difference]: Without dead ends: 747 [2019-11-20 01:17:37,730 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-20 01:17:37,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-11-20 01:17:37,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 493. [2019-11-20 01:17:37,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-11-20 01:17:37,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 681 transitions. [2019-11-20 01:17:37,762 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 681 transitions. Word has length 102 [2019-11-20 01:17:37,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:37,762 INFO L462 AbstractCegarLoop]: Abstraction has 493 states and 681 transitions. [2019-11-20 01:17:37,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 01:17:37,762 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 681 transitions. [2019-11-20 01:17:37,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-20 01:17:37,764 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:37,764 INFO L410 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, 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] [2019-11-20 01:17:37,976 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:17:37,976 INFO L410 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]=== [2019-11-20 01:17:37,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:37,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1623171890, now seen corresponding path program 1 times [2019-11-20 01:17:37,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:37,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564928518] [2019-11-20 01:17:37,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:38,090 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-20 01:17:38,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564928518] [2019-11-20 01:17:38,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749472706] [2019-11-20 01:17:38,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/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 [2019-11-20 01:17:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:38,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 01:17:38,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:17:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-20 01:17:38,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:17:38,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-11-20 01:17:38,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534063597] [2019-11-20 01:17:38,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 01:17:38,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:38,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 01:17:38,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:17:38,310 INFO L87 Difference]: Start difference. First operand 493 states and 681 transitions. Second operand 7 states. [2019-11-20 01:17:38,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:38,615 INFO L93 Difference]: Finished difference Result 1386 states and 1914 transitions. [2019-11-20 01:17:38,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 01:17:38,616 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2019-11-20 01:17:38,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:38,621 INFO L225 Difference]: With dead ends: 1386 [2019-11-20 01:17:38,621 INFO L226 Difference]: Without dead ends: 912 [2019-11-20 01:17:38,622 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-11-20 01:17:38,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-11-20 01:17:38,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 534. [2019-11-20 01:17:38,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-11-20 01:17:38,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 729 transitions. [2019-11-20 01:17:38,655 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 729 transitions. Word has length 140 [2019-11-20 01:17:38,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:38,656 INFO L462 AbstractCegarLoop]: Abstraction has 534 states and 729 transitions. [2019-11-20 01:17:38,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 01:17:38,656 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 729 transitions. [2019-11-20 01:17:38,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-20 01:17:38,658 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:38,658 INFO L410 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] [2019-11-20 01:17:38,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:17:38,863 INFO L410 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]=== [2019-11-20 01:17:38,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:38,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1233898508, now seen corresponding path program 1 times [2019-11-20 01:17:38,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:38,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601516772] [2019-11-20 01:17:38,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:39,006 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:17:39,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601516772] [2019-11-20 01:17:39,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:39,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:17:39,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085718155] [2019-11-20 01:17:39,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:17:39,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:39,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:17:39,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:17:39,010 INFO L87 Difference]: Start difference. First operand 534 states and 729 transitions. Second operand 4 states. [2019-11-20 01:17:39,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:39,092 INFO L93 Difference]: Finished difference Result 845 states and 1172 transitions. [2019-11-20 01:17:39,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:17:39,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-20 01:17:39,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:39,098 INFO L225 Difference]: With dead ends: 845 [2019-11-20 01:17:39,098 INFO L226 Difference]: Without dead ends: 843 [2019-11-20 01:17:39,099 INFO L630 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 [2019-11-20 01:17:39,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2019-11-20 01:17:39,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 536. [2019-11-20 01:17:39,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-11-20 01:17:39,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 731 transitions. [2019-11-20 01:17:39,130 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 731 transitions. Word has length 178 [2019-11-20 01:17:39,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:39,131 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 731 transitions. [2019-11-20 01:17:39,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:17:39,131 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 731 transitions. [2019-11-20 01:17:39,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-20 01:17:39,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:39,133 INFO L410 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] [2019-11-20 01:17:39,133 INFO L410 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]=== [2019-11-20 01:17:39,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:39,134 INFO L82 PathProgramCache]: Analyzing trace with hash -834811533, now seen corresponding path program 1 times [2019-11-20 01:17:39,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:39,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084919086] [2019-11-20 01:17:39,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:39,373 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-20 01:17:39,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084919086] [2019-11-20 01:17:39,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689883007] [2019-11-20 01:17:39,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/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 [2019-11-20 01:17:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:39,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 01:17:39,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:17:39,658 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-20 01:17:39,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:17:39,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-11-20 01:17:39,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739040458] [2019-11-20 01:17:39,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 01:17:39,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:39,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 01:17:39,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-20 01:17:39,661 INFO L87 Difference]: Start difference. First operand 536 states and 731 transitions. Second operand 11 states. [2019-11-20 01:17:40,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:40,486 INFO L93 Difference]: Finished difference Result 2971 states and 4180 transitions. [2019-11-20 01:17:40,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-20 01:17:40,487 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 181 [2019-11-20 01:17:40,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:40,501 INFO L225 Difference]: With dead ends: 2971 [2019-11-20 01:17:40,501 INFO L226 Difference]: Without dead ends: 2672 [2019-11-20 01:17:40,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2019-11-20 01:17:40,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-11-20 01:17:40,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 728. [2019-11-20 01:17:40,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2019-11-20 01:17:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 988 transitions. [2019-11-20 01:17:40,562 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 988 transitions. Word has length 181 [2019-11-20 01:17:40,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:40,562 INFO L462 AbstractCegarLoop]: Abstraction has 728 states and 988 transitions. [2019-11-20 01:17:40,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 01:17:40,562 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 988 transitions. [2019-11-20 01:17:40,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-20 01:17:40,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:40,565 INFO L410 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] [2019-11-20 01:17:40,769 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:17:40,770 INFO L410 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]=== [2019-11-20 01:17:40,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:40,770 INFO L82 PathProgramCache]: Analyzing trace with hash -2114675211, now seen corresponding path program 1 times [2019-11-20 01:17:40,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:40,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002113714] [2019-11-20 01:17:40,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:40,855 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:17:40,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002113714] [2019-11-20 01:17:40,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:40,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:17:40,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741725119] [2019-11-20 01:17:40,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:17:40,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:40,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:17:40,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:40,857 INFO L87 Difference]: Start difference. First operand 728 states and 988 transitions. Second operand 3 states. [2019-11-20 01:17:40,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:40,998 INFO L93 Difference]: Finished difference Result 1571 states and 2161 transitions. [2019-11-20 01:17:40,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:17:40,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-11-20 01:17:41,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:41,007 INFO L225 Difference]: With dead ends: 1571 [2019-11-20 01:17:41,007 INFO L226 Difference]: Without dead ends: 1272 [2019-11-20 01:17:41,008 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:41,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2019-11-20 01:17:41,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 728. [2019-11-20 01:17:41,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2019-11-20 01:17:41,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 986 transitions. [2019-11-20 01:17:41,062 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 986 transitions. Word has length 181 [2019-11-20 01:17:41,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:41,062 INFO L462 AbstractCegarLoop]: Abstraction has 728 states and 986 transitions. [2019-11-20 01:17:41,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:17:41,062 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 986 transitions. [2019-11-20 01:17:41,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-20 01:17:41,065 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:41,065 INFO L410 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] [2019-11-20 01:17:41,066 INFO L410 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]=== [2019-11-20 01:17:41,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:41,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1034293647, now seen corresponding path program 1 times [2019-11-20 01:17:41,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:41,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275878391] [2019-11-20 01:17:41,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:41,155 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-11-20 01:17:41,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275878391] [2019-11-20 01:17:41,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:41,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:17:41,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742846651] [2019-11-20 01:17:41,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:17:41,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:41,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:17:41,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:41,157 INFO L87 Difference]: Start difference. First operand 728 states and 986 transitions. Second operand 3 states. [2019-11-20 01:17:41,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:41,252 INFO L93 Difference]: Finished difference Result 1194 states and 1630 transitions. [2019-11-20 01:17:41,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:17:41,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-11-20 01:17:41,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:41,256 INFO L225 Difference]: With dead ends: 1194 [2019-11-20 01:17:41,256 INFO L226 Difference]: Without dead ends: 587 [2019-11-20 01:17:41,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:41,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-11-20 01:17:41,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 586. [2019-11-20 01:17:41,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-11-20 01:17:41,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 770 transitions. [2019-11-20 01:17:41,293 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 770 transitions. Word has length 184 [2019-11-20 01:17:41,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:41,294 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 770 transitions. [2019-11-20 01:17:41,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:17:41,294 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 770 transitions. [2019-11-20 01:17:41,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-20 01:17:41,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:41,296 INFO L410 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] [2019-11-20 01:17:41,297 INFO L410 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]=== [2019-11-20 01:17:41,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:41,297 INFO L82 PathProgramCache]: Analyzing trace with hash -802814983, now seen corresponding path program 1 times [2019-11-20 01:17:41,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:41,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861053734] [2019-11-20 01:17:41,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:41,513 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:17:41,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861053734] [2019-11-20 01:17:41,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:41,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-20 01:17:41,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131558567] [2019-11-20 01:17:41,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 01:17:41,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:41,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 01:17:41,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-20 01:17:41,515 INFO L87 Difference]: Start difference. First operand 586 states and 770 transitions. Second operand 9 states. [2019-11-20 01:17:42,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:42,666 INFO L93 Difference]: Finished difference Result 1813 states and 2449 transitions. [2019-11-20 01:17:42,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-20 01:17:42,666 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 189 [2019-11-20 01:17:42,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:42,674 INFO L225 Difference]: With dead ends: 1813 [2019-11-20 01:17:42,675 INFO L226 Difference]: Without dead ends: 1525 [2019-11-20 01:17:42,676 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=265, Invalid=791, Unknown=0, NotChecked=0, Total=1056 [2019-11-20 01:17:42,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2019-11-20 01:17:42,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 736. [2019-11-20 01:17:42,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-11-20 01:17:42,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 960 transitions. [2019-11-20 01:17:42,734 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 960 transitions. Word has length 189 [2019-11-20 01:17:42,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:42,734 INFO L462 AbstractCegarLoop]: Abstraction has 736 states and 960 transitions. [2019-11-20 01:17:42,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 01:17:42,734 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 960 transitions. [2019-11-20 01:17:42,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-20 01:17:42,737 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:42,737 INFO L410 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] [2019-11-20 01:17:42,737 INFO L410 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]=== [2019-11-20 01:17:42,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:42,738 INFO L82 PathProgramCache]: Analyzing trace with hash -143283461, now seen corresponding path program 1 times [2019-11-20 01:17:42,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:42,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410282906] [2019-11-20 01:17:42,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:42,911 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:17:42,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410282906] [2019-11-20 01:17:42,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:42,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 01:17:42,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122891557] [2019-11-20 01:17:42,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 01:17:42,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:42,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 01:17:42,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:17:42,915 INFO L87 Difference]: Start difference. First operand 736 states and 960 transitions. Second operand 5 states. [2019-11-20 01:17:43,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:43,119 INFO L93 Difference]: Finished difference Result 1368 states and 1805 transitions. [2019-11-20 01:17:43,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 01:17:43,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-11-20 01:17:43,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:43,125 INFO L225 Difference]: With dead ends: 1368 [2019-11-20 01:17:43,125 INFO L226 Difference]: Without dead ends: 930 [2019-11-20 01:17:43,128 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:17:43,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2019-11-20 01:17:43,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 676. [2019-11-20 01:17:43,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-11-20 01:17:43,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 882 transitions. [2019-11-20 01:17:43,206 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 882 transitions. Word has length 189 [2019-11-20 01:17:43,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:43,207 INFO L462 AbstractCegarLoop]: Abstraction has 676 states and 882 transitions. [2019-11-20 01:17:43,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 01:17:43,207 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 882 transitions. [2019-11-20 01:17:43,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-20 01:17:43,209 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:43,210 INFO L410 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] [2019-11-20 01:17:43,210 INFO L410 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]=== [2019-11-20 01:17:43,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:43,210 INFO L82 PathProgramCache]: Analyzing trace with hash 802518291, now seen corresponding path program 1 times [2019-11-20 01:17:43,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:43,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268937074] [2019-11-20 01:17:43,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:43,334 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:17:43,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268937074] [2019-11-20 01:17:43,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:43,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 01:17:43,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577843119] [2019-11-20 01:17:43,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 01:17:43,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:43,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 01:17:43,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:17:43,336 INFO L87 Difference]: Start difference. First operand 676 states and 882 transitions. Second operand 6 states. [2019-11-20 01:17:43,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:43,497 INFO L93 Difference]: Finished difference Result 2078 states and 2788 transitions. [2019-11-20 01:17:43,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 01:17:43,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2019-11-20 01:17:43,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:43,506 INFO L225 Difference]: With dead ends: 2078 [2019-11-20 01:17:43,507 INFO L226 Difference]: Without dead ends: 1694 [2019-11-20 01:17:43,508 INFO L630 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 [2019-11-20 01:17:43,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2019-11-20 01:17:43,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 753. [2019-11-20 01:17:43,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2019-11-20 01:17:43,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 980 transitions. [2019-11-20 01:17:43,566 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 980 transitions. Word has length 195 [2019-11-20 01:17:43,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:43,567 INFO L462 AbstractCegarLoop]: Abstraction has 753 states and 980 transitions. [2019-11-20 01:17:43,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 01:17:43,567 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 980 transitions. [2019-11-20 01:17:43,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-20 01:17:43,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:43,570 INFO L410 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] [2019-11-20 01:17:43,570 INFO L410 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]=== [2019-11-20 01:17:43,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:43,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1560841171, now seen corresponding path program 1 times [2019-11-20 01:17:43,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:43,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274421463] [2019-11-20 01:17:43,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:43,765 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:17:43,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274421463] [2019-11-20 01:17:43,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:43,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-20 01:17:43,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661917285] [2019-11-20 01:17:43,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 01:17:43,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:43,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 01:17:43,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-20 01:17:43,767 INFO L87 Difference]: Start difference. First operand 753 states and 980 transitions. Second operand 9 states. [2019-11-20 01:17:44,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:44,820 INFO L93 Difference]: Finished difference Result 2402 states and 3172 transitions. [2019-11-20 01:17:44,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-20 01:17:44,820 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 195 [2019-11-20 01:17:44,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:44,830 INFO L225 Difference]: With dead ends: 2402 [2019-11-20 01:17:44,830 INFO L226 Difference]: Without dead ends: 1944 [2019-11-20 01:17:44,832 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-11-20 01:17:44,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2019-11-20 01:17:44,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 800. [2019-11-20 01:17:44,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2019-11-20 01:17:44,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1035 transitions. [2019-11-20 01:17:44,904 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1035 transitions. Word has length 195 [2019-11-20 01:17:44,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:44,905 INFO L462 AbstractCegarLoop]: Abstraction has 800 states and 1035 transitions. [2019-11-20 01:17:44,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 01:17:44,905 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1035 transitions. [2019-11-20 01:17:44,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-20 01:17:44,907 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:44,907 INFO L410 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] [2019-11-20 01:17:44,908 INFO L410 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]=== [2019-11-20 01:17:44,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:44,909 INFO L82 PathProgramCache]: Analyzing trace with hash -161291761, now seen corresponding path program 1 times [2019-11-20 01:17:44,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:44,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894906181] [2019-11-20 01:17:44,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:45,143 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:17:45,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894906181] [2019-11-20 01:17:45,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:45,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-20 01:17:45,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487893408] [2019-11-20 01:17:45,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 01:17:45,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:45,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 01:17:45,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-20 01:17:45,146 INFO L87 Difference]: Start difference. First operand 800 states and 1035 transitions. Second operand 9 states. [2019-11-20 01:17:46,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:46,333 INFO L93 Difference]: Finished difference Result 2727 states and 3576 transitions. [2019-11-20 01:17:46,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-20 01:17:46,333 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 195 [2019-11-20 01:17:46,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:46,360 INFO L225 Difference]: With dead ends: 2727 [2019-11-20 01:17:46,360 INFO L226 Difference]: Without dead ends: 2217 [2019-11-20 01:17:46,362 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-11-20 01:17:46,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2019-11-20 01:17:46,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 985. [2019-11-20 01:17:46,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 985 states. [2019-11-20 01:17:46,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1263 transitions. [2019-11-20 01:17:46,446 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1263 transitions. Word has length 195 [2019-11-20 01:17:46,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:46,446 INFO L462 AbstractCegarLoop]: Abstraction has 985 states and 1263 transitions. [2019-11-20 01:17:46,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 01:17:46,447 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1263 transitions. [2019-11-20 01:17:46,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-20 01:17:46,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:46,450 INFO L410 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] [2019-11-20 01:17:46,450 INFO L410 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]=== [2019-11-20 01:17:46,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:46,451 INFO L82 PathProgramCache]: Analyzing trace with hash 686616138, now seen corresponding path program 1 times [2019-11-20 01:17:46,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:46,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587338640] [2019-11-20 01:17:46,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:46,537 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-11-20 01:17:46,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587338640] [2019-11-20 01:17:46,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:46,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:17:46,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510553765] [2019-11-20 01:17:46,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:17:46,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:46,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:17:46,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:17:46,539 INFO L87 Difference]: Start difference. First operand 985 states and 1263 transitions. Second operand 4 states. [2019-11-20 01:17:46,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:46,728 INFO L93 Difference]: Finished difference Result 1827 states and 2369 transitions. [2019-11-20 01:17:46,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:17:46,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2019-11-20 01:17:46,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:46,733 INFO L225 Difference]: With dead ends: 1827 [2019-11-20 01:17:46,734 INFO L226 Difference]: Without dead ends: 1140 [2019-11-20 01:17:46,735 INFO L630 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 [2019-11-20 01:17:46,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2019-11-20 01:17:46,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 816. [2019-11-20 01:17:46,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2019-11-20 01:17:46,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1031 transitions. [2019-11-20 01:17:46,797 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1031 transitions. Word has length 204 [2019-11-20 01:17:46,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:46,798 INFO L462 AbstractCegarLoop]: Abstraction has 816 states and 1031 transitions. [2019-11-20 01:17:46,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:17:46,798 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1031 transitions. [2019-11-20 01:17:46,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-20 01:17:46,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:46,802 INFO L410 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] [2019-11-20 01:17:46,802 INFO L410 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]=== [2019-11-20 01:17:46,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:46,803 INFO L82 PathProgramCache]: Analyzing trace with hash -234066135, now seen corresponding path program 1 times [2019-11-20 01:17:46,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:46,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199807959] [2019-11-20 01:17:46,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:17:47,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199807959] [2019-11-20 01:17:47,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90370736] [2019-11-20 01:17:47,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/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 [2019-11-20 01:17:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:47,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 949 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 01:17:47,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:17:47,484 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 9 proven. 32 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:17:47,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:17:47,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2019-11-20 01:17:47,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538322632] [2019-11-20 01:17:47,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 01:17:47,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:47,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 01:17:47,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-11-20 01:17:47,486 INFO L87 Difference]: Start difference. First operand 816 states and 1031 transitions. Second operand 14 states. [2019-11-20 01:17:56,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:56,966 INFO L93 Difference]: Finished difference Result 11511 states and 15023 transitions. [2019-11-20 01:17:56,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 263 states. [2019-11-20 01:17:56,966 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 229 [2019-11-20 01:17:56,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:56,983 INFO L225 Difference]: With dead ends: 11511 [2019-11-20 01:17:56,984 INFO L226 Difference]: Without dead ends: 10949 [2019-11-20 01:17:57,012 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31635 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9654, Invalid=65148, Unknown=0, NotChecked=0, Total=74802 [2019-11-20 01:17:57,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10949 states. [2019-11-20 01:17:57,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10949 to 1980. [2019-11-20 01:17:57,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1980 states. [2019-11-20 01:17:57,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1980 states to 1980 states and 2485 transitions. [2019-11-20 01:17:57,422 INFO L78 Accepts]: Start accepts. Automaton has 1980 states and 2485 transitions. Word has length 229 [2019-11-20 01:17:57,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:57,422 INFO L462 AbstractCegarLoop]: Abstraction has 1980 states and 2485 transitions. [2019-11-20 01:17:57,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 01:17:57,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 2485 transitions. [2019-11-20 01:17:57,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-20 01:17:57,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:57,431 INFO L410 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] [2019-11-20 01:17:57,644 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:17:57,644 INFO L410 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]=== [2019-11-20 01:17:57,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:57,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1574839085, now seen corresponding path program 1 times [2019-11-20 01:17:57,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:57,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839826629] [2019-11-20 01:17:57,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:57,751 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-11-20 01:17:57,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839826629] [2019-11-20 01:17:57,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:57,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:17:57,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391608395] [2019-11-20 01:17:57,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:17:57,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:57,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:17:57,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:57,755 INFO L87 Difference]: Start difference. First operand 1980 states and 2485 transitions. Second operand 3 states. [2019-11-20 01:17:57,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:57,961 INFO L93 Difference]: Finished difference Result 3911 states and 4900 transitions. [2019-11-20 01:17:57,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:17:57,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-11-20 01:17:57,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:57,965 INFO L225 Difference]: With dead ends: 3911 [2019-11-20 01:17:57,965 INFO L226 Difference]: Without dead ends: 2215 [2019-11-20 01:17:57,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:57,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2019-11-20 01:17:58,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1980. [2019-11-20 01:17:58,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1980 states. [2019-11-20 01:17:58,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1980 states to 1980 states and 2395 transitions. [2019-11-20 01:17:58,174 INFO L78 Accepts]: Start accepts. Automaton has 1980 states and 2395 transitions. Word has length 229 [2019-11-20 01:17:58,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:58,175 INFO L462 AbstractCegarLoop]: Abstraction has 1980 states and 2395 transitions. [2019-11-20 01:17:58,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:17:58,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 2395 transitions. [2019-11-20 01:17:58,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-20 01:17:58,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:58,179 INFO L410 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] [2019-11-20 01:17:58,180 INFO L410 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]=== [2019-11-20 01:17:58,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:58,180 INFO L82 PathProgramCache]: Analyzing trace with hash -537962891, now seen corresponding path program 1 times [2019-11-20 01:17:58,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:58,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492340868] [2019-11-20 01:17:58,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:58,281 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-11-20 01:17:58,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492340868] [2019-11-20 01:17:58,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:58,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:17:58,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653967393] [2019-11-20 01:17:58,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:17:58,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:58,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:17:58,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:58,283 INFO L87 Difference]: Start difference. First operand 1980 states and 2395 transitions. Second operand 3 states. [2019-11-20 01:17:58,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:58,622 INFO L93 Difference]: Finished difference Result 5191 states and 6240 transitions. [2019-11-20 01:17:58,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:17:58,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-11-20 01:17:58,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:58,629 INFO L225 Difference]: With dead ends: 5191 [2019-11-20 01:17:58,629 INFO L226 Difference]: Without dead ends: 3575 [2019-11-20 01:17:58,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:58,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3575 states. [2019-11-20 01:17:58,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3575 to 2169. [2019-11-20 01:17:58,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2169 states. [2019-11-20 01:17:58,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 2621 transitions. [2019-11-20 01:17:58,834 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 2621 transitions. Word has length 229 [2019-11-20 01:17:58,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:58,834 INFO L462 AbstractCegarLoop]: Abstraction has 2169 states and 2621 transitions. [2019-11-20 01:17:58,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:17:58,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 2621 transitions. [2019-11-20 01:17:58,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-20 01:17:58,839 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:58,839 INFO L410 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] [2019-11-20 01:17:58,839 INFO L410 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]=== [2019-11-20 01:17:58,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:58,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1845961847, now seen corresponding path program 1 times [2019-11-20 01:17:58,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:58,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278160661] [2019-11-20 01:17:58,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:58,931 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-20 01:17:58,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278160661] [2019-11-20 01:17:58,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:58,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:17:58,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544117080] [2019-11-20 01:17:58,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:17:58,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:58,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:17:58,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:58,933 INFO L87 Difference]: Start difference. First operand 2169 states and 2621 transitions. Second operand 3 states. [2019-11-20 01:17:59,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:59,137 INFO L93 Difference]: Finished difference Result 3969 states and 4799 transitions. [2019-11-20 01:17:59,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:17:59,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-11-20 01:17:59,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:59,141 INFO L225 Difference]: With dead ends: 3969 [2019-11-20 01:17:59,141 INFO L226 Difference]: Without dead ends: 2060 [2019-11-20 01:17:59,143 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:17:59,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2060 states. [2019-11-20 01:17:59,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2060 to 2060. [2019-11-20 01:17:59,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2060 states. [2019-11-20 01:17:59,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 2060 states and 2470 transitions. [2019-11-20 01:17:59,312 INFO L78 Accepts]: Start accepts. Automaton has 2060 states and 2470 transitions. Word has length 229 [2019-11-20 01:17:59,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:59,312 INFO L462 AbstractCegarLoop]: Abstraction has 2060 states and 2470 transitions. [2019-11-20 01:17:59,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:17:59,312 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 2470 transitions. [2019-11-20 01:17:59,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-20 01:17:59,316 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:59,317 INFO L410 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] [2019-11-20 01:17:59,317 INFO L410 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]=== [2019-11-20 01:17:59,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:59,317 INFO L82 PathProgramCache]: Analyzing trace with hash 276242594, now seen corresponding path program 1 times [2019-11-20 01:17:59,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:17:59,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263044775] [2019-11-20 01:17:59,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:17:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:59,649 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 18 proven. 17 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:17:59,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263044775] [2019-11-20 01:17:59,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287516063] [2019-11-20 01:17:59,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/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 [2019-11-20 01:17:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:59,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 950 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 01:17:59,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:17:59,960 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:17:59,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:17:59,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2019-11-20 01:17:59,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332623915] [2019-11-20 01:17:59,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-20 01:17:59,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:17:59,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-20 01:17:59,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-11-20 01:17:59,962 INFO L87 Difference]: Start difference. First operand 2060 states and 2470 transitions. Second operand 17 states. [2019-11-20 01:18:18,092 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-11-20 01:18:23,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:18:23,944 INFO L93 Difference]: Finished difference Result 27157 states and 34256 transitions. [2019-11-20 01:18:23,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 509 states. [2019-11-20 01:18:23,944 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 230 [2019-11-20 01:18:23,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:18:23,983 INFO L225 Difference]: With dead ends: 27157 [2019-11-20 01:18:23,983 INFO L226 Difference]: Without dead ends: 25513 [2019-11-20 01:18:24,004 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 521 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124944 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=19199, Invalid=253807, Unknown=0, NotChecked=0, Total=273006 [2019-11-20 01:18:24,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25513 states. [2019-11-20 01:18:24,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25513 to 4519. [2019-11-20 01:18:24,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4519 states. [2019-11-20 01:18:24,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4519 states to 4519 states and 5420 transitions. [2019-11-20 01:18:24,526 INFO L78 Accepts]: Start accepts. Automaton has 4519 states and 5420 transitions. Word has length 230 [2019-11-20 01:18:24,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:18:24,526 INFO L462 AbstractCegarLoop]: Abstraction has 4519 states and 5420 transitions. [2019-11-20 01:18:24,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-20 01:18:24,526 INFO L276 IsEmpty]: Start isEmpty. Operand 4519 states and 5420 transitions. [2019-11-20 01:18:24,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-20 01:18:24,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:18:24,531 INFO L410 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] [2019-11-20 01:18:24,731 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:18:24,732 INFO L410 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]=== [2019-11-20 01:18:24,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:18:24,732 INFO L82 PathProgramCache]: Analyzing trace with hash 2140525141, now seen corresponding path program 1 times [2019-11-20 01:18:24,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:18:24,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235040506] [2019-11-20 01:18:24,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:18:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:18:24,851 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-11-20 01:18:24,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235040506] [2019-11-20 01:18:24,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:18:24,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 01:18:24,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463936201] [2019-11-20 01:18:24,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 01:18:24,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:18:24,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 01:18:24,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:18:24,856 INFO L87 Difference]: Start difference. First operand 4519 states and 5420 transitions. Second operand 7 states. [2019-11-20 01:18:26,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:18:26,233 INFO L93 Difference]: Finished difference Result 14039 states and 17187 transitions. [2019-11-20 01:18:26,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 01:18:26,233 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 235 [2019-11-20 01:18:26,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:18:26,246 INFO L225 Difference]: With dead ends: 14039 [2019-11-20 01:18:26,247 INFO L226 Difference]: Without dead ends: 10084 [2019-11-20 01:18:26,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-11-20 01:18:26,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10084 states. [2019-11-20 01:18:26,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10084 to 4209. [2019-11-20 01:18:26,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4209 states. [2019-11-20 01:18:26,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4209 states to 4209 states and 5055 transitions. [2019-11-20 01:18:26,861 INFO L78 Accepts]: Start accepts. Automaton has 4209 states and 5055 transitions. Word has length 235 [2019-11-20 01:18:26,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:18:26,862 INFO L462 AbstractCegarLoop]: Abstraction has 4209 states and 5055 transitions. [2019-11-20 01:18:26,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 01:18:26,862 INFO L276 IsEmpty]: Start isEmpty. Operand 4209 states and 5055 transitions. [2019-11-20 01:18:26,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-20 01:18:26,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:18:26,868 INFO L410 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] [2019-11-20 01:18:26,868 INFO L410 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]=== [2019-11-20 01:18:26,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:18:26,869 INFO L82 PathProgramCache]: Analyzing trace with hash 587060113, now seen corresponding path program 1 times [2019-11-20 01:18:26,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:18:26,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103258315] [2019-11-20 01:18:26,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:18:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:18:26,981 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 35 proven. 6 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:18:26,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103258315] [2019-11-20 01:18:26,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319916488] [2019-11-20 01:18:26,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/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 [2019-11-20 01:18:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:18:27,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 01:18:27,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:18:27,279 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-11-20 01:18:27,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 01:18:27,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2019-11-20 01:18:27,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500903912] [2019-11-20 01:18:27,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 01:18:27,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:18:27,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 01:18:27,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-20 01:18:27,281 INFO L87 Difference]: Start difference. First operand 4209 states and 5055 transitions. Second operand 5 states. [2019-11-20 01:18:27,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:18:27,646 INFO L93 Difference]: Finished difference Result 8020 states and 9646 transitions. [2019-11-20 01:18:27,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:18:27,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 235 [2019-11-20 01:18:27,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:18:27,651 INFO L225 Difference]: With dead ends: 8020 [2019-11-20 01:18:27,651 INFO L226 Difference]: Without dead ends: 4227 [2019-11-20 01:18:27,655 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-20 01:18:27,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4227 states. [2019-11-20 01:18:28,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4227 to 4221. [2019-11-20 01:18:28,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4221 states. [2019-11-20 01:18:28,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4221 states to 4221 states and 5061 transitions. [2019-11-20 01:18:28,072 INFO L78 Accepts]: Start accepts. Automaton has 4221 states and 5061 transitions. Word has length 235 [2019-11-20 01:18:28,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:18:28,072 INFO L462 AbstractCegarLoop]: Abstraction has 4221 states and 5061 transitions. [2019-11-20 01:18:28,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 01:18:28,073 INFO L276 IsEmpty]: Start isEmpty. Operand 4221 states and 5061 transitions. [2019-11-20 01:18:28,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-11-20 01:18:28,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:18:28,077 INFO L410 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] [2019-11-20 01:18:28,277 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:18:28,278 INFO L410 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]=== [2019-11-20 01:18:28,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:18:28,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1715823498, now seen corresponding path program 1 times [2019-11-20 01:18:28,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:18:28,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814185166] [2019-11-20 01:18:28,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:18:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:18:28,516 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:18:28,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814185166] [2019-11-20 01:18:28,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358455722] [2019-11-20 01:18:28,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/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 [2019-11-20 01:18:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:18:28,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-20 01:18:28,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:18:28,912 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 33 proven. 13 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-11-20 01:18:28,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:18:28,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 15 [2019-11-20 01:18:28,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118311208] [2019-11-20 01:18:28,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 01:18:28,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:18:28,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 01:18:28,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-11-20 01:18:28,915 INFO L87 Difference]: Start difference. First operand 4221 states and 5061 transitions. Second operand 15 states. [2019-11-20 01:18:32,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:18:32,955 INFO L93 Difference]: Finished difference Result 16287 states and 20268 transitions. [2019-11-20 01:18:32,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-11-20 01:18:32,956 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 236 [2019-11-20 01:18:32,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:18:32,967 INFO L225 Difference]: With dead ends: 16287 [2019-11-20 01:18:32,967 INFO L226 Difference]: Without dead ends: 12577 [2019-11-20 01:18:32,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1218 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=720, Invalid=3836, Unknown=0, NotChecked=0, Total=4556 [2019-11-20 01:18:32,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12577 states. [2019-11-20 01:18:33,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12577 to 4580. [2019-11-20 01:18:33,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4580 states. [2019-11-20 01:18:33,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4580 states to 4580 states and 5493 transitions. [2019-11-20 01:18:33,414 INFO L78 Accepts]: Start accepts. Automaton has 4580 states and 5493 transitions. Word has length 236 [2019-11-20 01:18:33,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:18:33,414 INFO L462 AbstractCegarLoop]: Abstraction has 4580 states and 5493 transitions. [2019-11-20 01:18:33,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 01:18:33,414 INFO L276 IsEmpty]: Start isEmpty. Operand 4580 states and 5493 transitions. [2019-11-20 01:18:33,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-20 01:18:33,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:18:33,419 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:18:33,619 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:18:33,619 INFO L410 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]=== [2019-11-20 01:18:33,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:18:33,620 INFO L82 PathProgramCache]: Analyzing trace with hash -318096811, now seen corresponding path program 1 times [2019-11-20 01:18:33,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:18:33,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660670118] [2019-11-20 01:18:33,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:18:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:18:33,676 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-20 01:18:33,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660670118] [2019-11-20 01:18:33,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:18:33,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:18:33,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998211613] [2019-11-20 01:18:33,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:18:33,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:18:33,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:18:33,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:18:33,678 INFO L87 Difference]: Start difference. First operand 4580 states and 5493 transitions. Second operand 3 states. [2019-11-20 01:18:34,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:18:34,081 INFO L93 Difference]: Finished difference Result 8779 states and 10516 transitions. [2019-11-20 01:18:34,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:18:34,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-11-20 01:18:34,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:18:34,084 INFO L225 Difference]: With dead ends: 8779 [2019-11-20 01:18:34,084 INFO L226 Difference]: Without dead ends: 4212 [2019-11-20 01:18:34,087 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:18:34,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4212 states. [2019-11-20 01:18:34,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4212 to 4212. [2019-11-20 01:18:34,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4212 states. [2019-11-20 01:18:34,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4212 states to 4212 states and 5029 transitions. [2019-11-20 01:18:34,454 INFO L78 Accepts]: Start accepts. Automaton has 4212 states and 5029 transitions. Word has length 239 [2019-11-20 01:18:34,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:18:34,454 INFO L462 AbstractCegarLoop]: Abstraction has 4212 states and 5029 transitions. [2019-11-20 01:18:34,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:18:34,454 INFO L276 IsEmpty]: Start isEmpty. Operand 4212 states and 5029 transitions. [2019-11-20 01:18:34,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-11-20 01:18:34,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:18:34,458 INFO L410 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] [2019-11-20 01:18:34,459 INFO L410 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]=== [2019-11-20 01:18:34,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:18:34,459 INFO L82 PathProgramCache]: Analyzing trace with hash -572936860, now seen corresponding path program 1 times [2019-11-20 01:18:34,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:18:34,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462422069] [2019-11-20 01:18:34,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:18:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:18:34,747 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-11-20 01:18:34,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462422069] [2019-11-20 01:18:34,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:18:34,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:18:34,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774997832] [2019-11-20 01:18:34,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 01:18:34,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:18:34,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 01:18:34,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:18:34,750 INFO L87 Difference]: Start difference. First operand 4212 states and 5029 transitions. Second operand 5 states. [2019-11-20 01:18:35,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:18:35,173 INFO L93 Difference]: Finished difference Result 8132 states and 9737 transitions. [2019-11-20 01:18:35,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:18:35,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 242 [2019-11-20 01:18:35,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:18:35,177 INFO L225 Difference]: With dead ends: 8132 [2019-11-20 01:18:35,177 INFO L226 Difference]: Without dead ends: 4266 [2019-11-20 01:18:35,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:18:35,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4266 states. [2019-11-20 01:18:35,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4266 to 4248. [2019-11-20 01:18:35,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4248 states. [2019-11-20 01:18:35,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4248 states to 4248 states and 5053 transitions. [2019-11-20 01:18:35,538 INFO L78 Accepts]: Start accepts. Automaton has 4248 states and 5053 transitions. Word has length 242 [2019-11-20 01:18:35,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:18:35,538 INFO L462 AbstractCegarLoop]: Abstraction has 4248 states and 5053 transitions. [2019-11-20 01:18:35,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 01:18:35,539 INFO L276 IsEmpty]: Start isEmpty. Operand 4248 states and 5053 transitions. [2019-11-20 01:18:35,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-11-20 01:18:35,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:18:35,544 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:18:35,544 INFO L410 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]=== [2019-11-20 01:18:35,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:18:35,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1787820344, now seen corresponding path program 1 times [2019-11-20 01:18:35,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:18:35,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303785440] [2019-11-20 01:18:35,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:18:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:18:35,777 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 24 proven. 23 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:18:35,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303785440] [2019-11-20 01:18:35,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428108165] [2019-11-20 01:18:35,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/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 [2019-11-20 01:18:35,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:18:35,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 991 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-20 01:18:35,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:18:36,317 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 39 proven. 30 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-20 01:18:36,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:18:36,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 17] total 23 [2019-11-20 01:18:36,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345579597] [2019-11-20 01:18:36,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-20 01:18:36,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:18:36,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-20 01:18:36,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2019-11-20 01:18:36,319 INFO L87 Difference]: Start difference. First operand 4248 states and 5053 transitions. Second operand 23 states. [2019-11-20 01:18:40,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:18:40,996 INFO L93 Difference]: Finished difference Result 15971 states and 19768 transitions. [2019-11-20 01:18:40,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-11-20 01:18:40,997 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 243 [2019-11-20 01:18:40,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:18:41,004 INFO L225 Difference]: With dead ends: 15971 [2019-11-20 01:18:41,005 INFO L226 Difference]: Without dead ends: 12231 [2019-11-20 01:18:41,008 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2890 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1110, Invalid=8010, Unknown=0, NotChecked=0, Total=9120 [2019-11-20 01:18:41,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12231 states. [2019-11-20 01:18:41,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12231 to 4236. [2019-11-20 01:18:41,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4236 states. [2019-11-20 01:18:41,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4236 states to 4236 states and 5036 transitions. [2019-11-20 01:18:41,426 INFO L78 Accepts]: Start accepts. Automaton has 4236 states and 5036 transitions. Word has length 243 [2019-11-20 01:18:41,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:18:41,426 INFO L462 AbstractCegarLoop]: Abstraction has 4236 states and 5036 transitions. [2019-11-20 01:18:41,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-20 01:18:41,427 INFO L276 IsEmpty]: Start isEmpty. Operand 4236 states and 5036 transitions. [2019-11-20 01:18:41,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-11-20 01:18:41,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:18:41,431 INFO L410 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] [2019-11-20 01:18:41,632 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:18:41,633 INFO L410 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]=== [2019-11-20 01:18:41,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:18:41,634 INFO L82 PathProgramCache]: Analyzing trace with hash 267079925, now seen corresponding path program 1 times [2019-11-20 01:18:41,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:18:41,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496486067] [2019-11-20 01:18:41,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:18:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:18:41,771 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-11-20 01:18:41,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496486067] [2019-11-20 01:18:41,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:18:41,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:18:41,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923626360] [2019-11-20 01:18:41,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:18:41,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:18:41,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:18:41,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:18:41,773 INFO L87 Difference]: Start difference. First operand 4236 states and 5036 transitions. Second operand 3 states. [2019-11-20 01:18:42,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:18:42,021 INFO L93 Difference]: Finished difference Result 5921 states and 7047 transitions. [2019-11-20 01:18:42,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:18:42,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2019-11-20 01:18:42,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:18:42,023 INFO L225 Difference]: With dead ends: 5921 [2019-11-20 01:18:42,023 INFO L226 Difference]: Without dead ends: 2091 [2019-11-20 01:18:42,026 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:18:42,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2019-11-20 01:18:42,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 2091. [2019-11-20 01:18:42,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2091 states. [2019-11-20 01:18:42,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 2091 states and 2458 transitions. [2019-11-20 01:18:42,210 INFO L78 Accepts]: Start accepts. Automaton has 2091 states and 2458 transitions. Word has length 250 [2019-11-20 01:18:42,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:18:42,211 INFO L462 AbstractCegarLoop]: Abstraction has 2091 states and 2458 transitions. [2019-11-20 01:18:42,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:18:42,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 2458 transitions. [2019-11-20 01:18:42,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-11-20 01:18:42,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:18:42,213 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:18:42,214 INFO L410 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]=== [2019-11-20 01:18:42,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:18:42,214 INFO L82 PathProgramCache]: Analyzing trace with hash 505441727, now seen corresponding path program 1 times [2019-11-20 01:18:42,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:18:42,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680095160] [2019-11-20 01:18:42,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:18:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:18:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-20 01:18:42,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680095160] [2019-11-20 01:18:42,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:18:42,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 01:18:42,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401464038] [2019-11-20 01:18:42,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:18:42,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:18:42,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:18:42,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:18:42,340 INFO L87 Difference]: Start difference. First operand 2091 states and 2458 transitions. Second operand 8 states. [2019-11-20 01:18:43,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:18:43,544 INFO L93 Difference]: Finished difference Result 6915 states and 8386 transitions. [2019-11-20 01:18:43,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-20 01:18:43,544 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 250 [2019-11-20 01:18:43,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:18:43,547 INFO L225 Difference]: With dead ends: 6915 [2019-11-20 01:18:43,547 INFO L226 Difference]: Without dead ends: 5233 [2019-11-20 01:18:43,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=235, Invalid=695, Unknown=0, NotChecked=0, Total=930 [2019-11-20 01:18:43,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5233 states. [2019-11-20 01:18:43,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5233 to 2049. [2019-11-20 01:18:43,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2049 states. [2019-11-20 01:18:43,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2049 states to 2049 states and 2410 transitions. [2019-11-20 01:18:43,756 INFO L78 Accepts]: Start accepts. Automaton has 2049 states and 2410 transitions. Word has length 250 [2019-11-20 01:18:43,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:18:43,756 INFO L462 AbstractCegarLoop]: Abstraction has 2049 states and 2410 transitions. [2019-11-20 01:18:43,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:18:43,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2049 states and 2410 transitions. [2019-11-20 01:18:43,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-11-20 01:18:43,758 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:18:43,759 INFO L410 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] [2019-11-20 01:18:43,759 INFO L410 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]=== [2019-11-20 01:18:43,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:18:43,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1034916000, now seen corresponding path program 1 times [2019-11-20 01:18:43,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:18:43,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998194537] [2019-11-20 01:18:43,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:18:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:18:44,134 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 18 proven. 17 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:18:44,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998194537] [2019-11-20 01:18:44,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656532976] [2019-11-20 01:18:44,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/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 [2019-11-20 01:18:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:18:44,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-20 01:18:44,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:18:44,969 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 27 proven. 34 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-20 01:18:44,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:18:44,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17] total 26 [2019-11-20 01:18:44,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599104078] [2019-11-20 01:18:44,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-20 01:18:44,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:18:44,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-20 01:18:44,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2019-11-20 01:18:44,971 INFO L87 Difference]: Start difference. First operand 2049 states and 2410 transitions. Second operand 26 states. [2019-11-20 01:18:51,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:18:51,066 INFO L93 Difference]: Finished difference Result 11184 states and 13839 transitions. [2019-11-20 01:18:51,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-11-20 01:18:51,067 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 250 [2019-11-20 01:18:51,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:18:51,073 INFO L225 Difference]: With dead ends: 11184 [2019-11-20 01:18:51,073 INFO L226 Difference]: Without dead ends: 9511 [2019-11-20 01:18:51,077 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5353 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1915, Invalid=13585, Unknown=0, NotChecked=0, Total=15500 [2019-11-20 01:18:51,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9511 states. [2019-11-20 01:18:51,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9511 to 2049. [2019-11-20 01:18:51,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2049 states. [2019-11-20 01:18:51,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2049 states to 2049 states and 2407 transitions. [2019-11-20 01:18:51,339 INFO L78 Accepts]: Start accepts. Automaton has 2049 states and 2407 transitions. Word has length 250 [2019-11-20 01:18:51,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:18:51,340 INFO L462 AbstractCegarLoop]: Abstraction has 2049 states and 2407 transitions. [2019-11-20 01:18:51,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-20 01:18:51,340 INFO L276 IsEmpty]: Start isEmpty. Operand 2049 states and 2407 transitions. [2019-11-20 01:18:51,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-11-20 01:18:51,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:18:51,343 INFO L410 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] [2019-11-20 01:18:51,544 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:18:51,544 INFO L410 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]=== [2019-11-20 01:18:51,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:18:51,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1060234671, now seen corresponding path program 1 times [2019-11-20 01:18:51,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:18:51,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256379986] [2019-11-20 01:18:51,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:18:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:18:51,887 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:18:51,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256379986] [2019-11-20 01:18:51,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536999596] [2019-11-20 01:18:51,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/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 [2019-11-20 01:18:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:18:52,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 01:18:52,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:18:52,388 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:18:52,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:18:52,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2019-11-20 01:18:52,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807918272] [2019-11-20 01:18:52,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-20 01:18:52,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:18:52,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-20 01:18:52,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2019-11-20 01:18:52,390 INFO L87 Difference]: Start difference. First operand 2049 states and 2407 transitions. Second operand 19 states. [2019-11-20 01:18:59,832 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-20 01:19:16,466 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-11-20 01:20:11,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:20:11,344 INFO L93 Difference]: Finished difference Result 115287 states and 139038 transitions. [2019-11-20 01:20:11,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1619 states. [2019-11-20 01:20:11,344 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 266 [2019-11-20 01:20:11,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:20:11,462 INFO L225 Difference]: With dead ends: 115287 [2019-11-20 01:20:11,462 INFO L226 Difference]: Without dead ends: 113647 [2019-11-20 01:20:11,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2049 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 1633 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1304448 ImplicationChecksByTransitivity, 49.4s TimeCoverageRelationStatistics Valid=115286, Invalid=2556304, Unknown=0, NotChecked=0, Total=2671590 [2019-11-20 01:20:11,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113647 states. [2019-11-20 01:20:12,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113647 to 3829. [2019-11-20 01:20:12,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3829 states. [2019-11-20 01:20:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3829 states to 3829 states and 4523 transitions. [2019-11-20 01:20:12,491 INFO L78 Accepts]: Start accepts. Automaton has 3829 states and 4523 transitions. Word has length 266 [2019-11-20 01:20:12,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:20:12,491 INFO L462 AbstractCegarLoop]: Abstraction has 3829 states and 4523 transitions. [2019-11-20 01:20:12,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-20 01:20:12,491 INFO L276 IsEmpty]: Start isEmpty. Operand 3829 states and 4523 transitions. [2019-11-20 01:20:12,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-11-20 01:20:12,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:20:12,496 INFO L410 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] [2019-11-20 01:20:12,696 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:20:12,696 INFO L410 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]=== [2019-11-20 01:20:12,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:20:12,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1407314781, now seen corresponding path program 1 times [2019-11-20 01:20:12,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:20:12,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283350549] [2019-11-20 01:20:12,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:20:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:20:12,838 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-11-20 01:20:12,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283350549] [2019-11-20 01:20:12,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:20:12,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 01:20:12,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452809737] [2019-11-20 01:20:12,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 01:20:12,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:20:12,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 01:20:12,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:20:12,840 INFO L87 Difference]: Start difference. First operand 3829 states and 4523 transitions. Second operand 7 states. [2019-11-20 01:20:14,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:20:14,109 INFO L93 Difference]: Finished difference Result 9156 states and 11092 transitions. [2019-11-20 01:20:14,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 01:20:14,110 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 267 [2019-11-20 01:20:14,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:20:14,113 INFO L225 Difference]: With dead ends: 9156 [2019-11-20 01:20:14,114 INFO L226 Difference]: Without dead ends: 5851 [2019-11-20 01:20:14,116 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-20 01:20:14,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5851 states. [2019-11-20 01:20:14,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5851 to 4174. [2019-11-20 01:20:14,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4174 states. [2019-11-20 01:20:14,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 4943 transitions. [2019-11-20 01:20:14,686 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 4943 transitions. Word has length 267 [2019-11-20 01:20:14,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:20:14,686 INFO L462 AbstractCegarLoop]: Abstraction has 4174 states and 4943 transitions. [2019-11-20 01:20:14,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 01:20:14,686 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 4943 transitions. [2019-11-20 01:20:14,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-11-20 01:20:14,690 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:20:14,691 INFO L410 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] [2019-11-20 01:20:14,691 INFO L410 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]=== [2019-11-20 01:20:14,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:20:14,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1009169254, now seen corresponding path program 1 times [2019-11-20 01:20:14,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:20:14,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687259110] [2019-11-20 01:20:14,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:20:14,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:20:15,026 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 18 proven. 17 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:20:15,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687259110] [2019-11-20 01:20:15,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2464918] [2019-11-20 01:20:15,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/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 [2019-11-20 01:20:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:20:15,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 1084 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 01:20:15,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:20:15,384 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 25 proven. 10 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:20:15,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:20:15,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2019-11-20 01:20:15,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760986844] [2019-11-20 01:20:15,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 01:20:15,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:20:15,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 01:20:15,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-11-20 01:20:15,387 INFO L87 Difference]: Start difference. First operand 4174 states and 4943 transitions. Second operand 18 states. [2019-11-20 01:20:20,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:20:20,984 INFO L93 Difference]: Finished difference Result 21662 states and 26569 transitions. [2019-11-20 01:20:20,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-11-20 01:20:20,984 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 267 [2019-11-20 01:20:20,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:20:20,996 INFO L225 Difference]: With dead ends: 21662 [2019-11-20 01:20:20,996 INFO L226 Difference]: Without dead ends: 18012 [2019-11-20 01:20:21,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=984, Invalid=3048, Unknown=0, NotChecked=0, Total=4032 [2019-11-20 01:20:21,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18012 states. [2019-11-20 01:20:21,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18012 to 4162. [2019-11-20 01:20:21,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4162 states. [2019-11-20 01:20:21,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4162 states to 4162 states and 4931 transitions. [2019-11-20 01:20:21,678 INFO L78 Accepts]: Start accepts. Automaton has 4162 states and 4931 transitions. Word has length 267 [2019-11-20 01:20:21,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:20:21,678 INFO L462 AbstractCegarLoop]: Abstraction has 4162 states and 4931 transitions. [2019-11-20 01:20:21,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 01:20:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 4162 states and 4931 transitions. [2019-11-20 01:20:21,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-11-20 01:20:21,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:20:21,682 INFO L410 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] [2019-11-20 01:20:21,883 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:20:21,883 INFO L410 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]=== [2019-11-20 01:20:21,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:20:21,884 INFO L82 PathProgramCache]: Analyzing trace with hash 579510948, now seen corresponding path program 1 times [2019-11-20 01:20:21,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:20:21,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023781976] [2019-11-20 01:20:21,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:20:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:20:21,980 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-11-20 01:20:21,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023781976] [2019-11-20 01:20:21,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:20:21,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:20:21,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145776554] [2019-11-20 01:20:21,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:20:21,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:20:21,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:20:21,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:20:21,982 INFO L87 Difference]: Start difference. First operand 4162 states and 4931 transitions. Second operand 3 states. [2019-11-20 01:20:22,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:20:22,463 INFO L93 Difference]: Finished difference Result 6722 states and 7950 transitions. [2019-11-20 01:20:22,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:20:22,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 267 [2019-11-20 01:20:22,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:20:22,465 INFO L225 Difference]: With dead ends: 6722 [2019-11-20 01:20:22,466 INFO L226 Difference]: Without dead ends: 2822 [2019-11-20 01:20:22,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:20:22,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2822 states. [2019-11-20 01:20:22,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 2822. [2019-11-20 01:20:22,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2019-11-20 01:20:22,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 3298 transitions. [2019-11-20 01:20:22,937 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 3298 transitions. Word has length 267 [2019-11-20 01:20:22,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:20:22,938 INFO L462 AbstractCegarLoop]: Abstraction has 2822 states and 3298 transitions. [2019-11-20 01:20:22,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:20:22,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 3298 transitions. [2019-11-20 01:20:22,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-11-20 01:20:22,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:20:22,941 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:20:22,941 INFO L410 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]=== [2019-11-20 01:20:22,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:20:22,942 INFO L82 PathProgramCache]: Analyzing trace with hash 410747493, now seen corresponding path program 1 times [2019-11-20 01:20:22,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:20:22,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889619439] [2019-11-20 01:20:22,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:20:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:20:23,071 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-20 01:20:23,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889619439] [2019-11-20 01:20:23,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:20:23,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 01:20:23,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552100017] [2019-11-20 01:20:23,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 01:20:23,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:20:23,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 01:20:23,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:20:23,074 INFO L87 Difference]: Start difference. First operand 2822 states and 3298 transitions. Second operand 7 states. [2019-11-20 01:20:24,011 WARN L191 SmtUtils]: Spent 370.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-11-20 01:20:24,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:20:24,741 INFO L93 Difference]: Finished difference Result 6343 states and 7573 transitions. [2019-11-20 01:20:24,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 01:20:24,741 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 268 [2019-11-20 01:20:24,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:20:24,744 INFO L225 Difference]: With dead ends: 6343 [2019-11-20 01:20:24,744 INFO L226 Difference]: Without dead ends: 3952 [2019-11-20 01:20:24,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-20 01:20:24,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2019-11-20 01:20:25,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 2922. [2019-11-20 01:20:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2922 states. [2019-11-20 01:20:25,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 3414 transitions. [2019-11-20 01:20:25,253 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 3414 transitions. Word has length 268 [2019-11-20 01:20:25,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:20:25,253 INFO L462 AbstractCegarLoop]: Abstraction has 2922 states and 3414 transitions. [2019-11-20 01:20:25,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 01:20:25,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 3414 transitions. [2019-11-20 01:20:25,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-11-20 01:20:25,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:20:25,257 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:20:25,258 INFO L410 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]=== [2019-11-20 01:20:25,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:20:25,258 INFO L82 PathProgramCache]: Analyzing trace with hash 620593089, now seen corresponding path program 1 times [2019-11-20 01:20:25,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:20:25,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351439263] [2019-11-20 01:20:25,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:20:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:20:25,382 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-11-20 01:20:25,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351439263] [2019-11-20 01:20:25,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:20:25,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 01:20:25,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619904310] [2019-11-20 01:20:25,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 01:20:25,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:20:25,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 01:20:25,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:20:25,383 INFO L87 Difference]: Start difference. First operand 2922 states and 3414 transitions. Second operand 7 states. [2019-11-20 01:20:26,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:20:26,331 INFO L93 Difference]: Finished difference Result 6107 states and 7253 transitions. [2019-11-20 01:20:26,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 01:20:26,332 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 268 [2019-11-20 01:20:26,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:20:26,334 INFO L225 Difference]: With dead ends: 6107 [2019-11-20 01:20:26,334 INFO L226 Difference]: Without dead ends: 3616 [2019-11-20 01:20:26,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-20 01:20:26,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3616 states. [2019-11-20 01:20:26,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3616 to 2922. [2019-11-20 01:20:26,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2922 states. [2019-11-20 01:20:26,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 3410 transitions. [2019-11-20 01:20:26,847 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 3410 transitions. Word has length 268 [2019-11-20 01:20:26,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:20:26,847 INFO L462 AbstractCegarLoop]: Abstraction has 2922 states and 3410 transitions. [2019-11-20 01:20:26,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 01:20:26,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 3410 transitions. [2019-11-20 01:20:26,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-11-20 01:20:26,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:20:26,850 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:20:26,851 INFO L410 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]=== [2019-11-20 01:20:26,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:20:26,851 INFO L82 PathProgramCache]: Analyzing trace with hash -134489264, now seen corresponding path program 1 times [2019-11-20 01:20:26,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:20:26,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444184905] [2019-11-20 01:20:26,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:20:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:20:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-20 01:20:26,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444184905] [2019-11-20 01:20:26,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:20:26,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 01:20:26,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670415763] [2019-11-20 01:20:26,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:20:26,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:20:26,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:20:26,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:20:26,990 INFO L87 Difference]: Start difference. First operand 2922 states and 3410 transitions. Second operand 8 states. [2019-11-20 01:20:29,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:20:29,134 INFO L93 Difference]: Finished difference Result 8445 states and 10156 transitions. [2019-11-20 01:20:29,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 01:20:29,134 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 272 [2019-11-20 01:20:29,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:20:29,138 INFO L225 Difference]: With dead ends: 8445 [2019-11-20 01:20:29,138 INFO L226 Difference]: Without dead ends: 5954 [2019-11-20 01:20:29,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2019-11-20 01:20:29,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2019-11-20 01:20:29,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 2898. [2019-11-20 01:20:29,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2898 states. [2019-11-20 01:20:29,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 3378 transitions. [2019-11-20 01:20:29,946 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 3378 transitions. Word has length 272 [2019-11-20 01:20:29,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:20:29,946 INFO L462 AbstractCegarLoop]: Abstraction has 2898 states and 3378 transitions. [2019-11-20 01:20:29,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:20:29,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 3378 transitions. [2019-11-20 01:20:29,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-11-20 01:20:29,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:20:29,948 INFO L410 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] [2019-11-20 01:20:29,949 INFO L410 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]=== [2019-11-20 01:20:29,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:20:29,949 INFO L82 PathProgramCache]: Analyzing trace with hash 824938307, now seen corresponding path program 1 times [2019-11-20 01:20:29,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:20:29,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027646900] [2019-11-20 01:20:29,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:20:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:20:30,073 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:20:30,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027646900] [2019-11-20 01:20:30,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808902015] [2019-11-20 01:20:30,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/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 [2019-11-20 01:20:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:20:30,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 01:20:30,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:20:30,374 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-20 01:20:30,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 01:20:30,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2019-11-20 01:20:30,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895017272] [2019-11-20 01:20:30,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 01:20:30,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:20:30,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 01:20:30,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-20 01:20:30,376 INFO L87 Difference]: Start difference. First operand 2898 states and 3378 transitions. Second operand 5 states. [2019-11-20 01:20:30,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:20:30,916 INFO L93 Difference]: Finished difference Result 5576 states and 6522 transitions. [2019-11-20 01:20:30,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:20:30,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 273 [2019-11-20 01:20:30,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:20:30,919 INFO L225 Difference]: With dead ends: 5576 [2019-11-20 01:20:30,919 INFO L226 Difference]: Without dead ends: 2943 [2019-11-20 01:20:30,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-20 01:20:30,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2019-11-20 01:20:31,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 2928. [2019-11-20 01:20:31,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2928 states. [2019-11-20 01:20:31,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 3403 transitions. [2019-11-20 01:20:31,432 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 3403 transitions. Word has length 273 [2019-11-20 01:20:31,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:20:31,432 INFO L462 AbstractCegarLoop]: Abstraction has 2928 states and 3403 transitions. [2019-11-20 01:20:31,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 01:20:31,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 3403 transitions. [2019-11-20 01:20:31,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-11-20 01:20:31,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:20:31,434 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:20:31,635 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:20:31,635 INFO L410 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]=== [2019-11-20 01:20:31,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:20:31,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1144412815, now seen corresponding path program 1 times [2019-11-20 01:20:31,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:20:31,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128924969] [2019-11-20 01:20:31,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:20:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:20:31,739 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-20 01:20:31,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128924969] [2019-11-20 01:20:31,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:20:31,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:20:31,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837571087] [2019-11-20 01:20:31,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:20:31,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:20:31,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:20:31,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:20:31,741 INFO L87 Difference]: Start difference. First operand 2928 states and 3403 transitions. Second operand 3 states. [2019-11-20 01:20:32,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:20:32,510 INFO L93 Difference]: Finished difference Result 5973 states and 7014 transitions. [2019-11-20 01:20:32,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:20:32,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2019-11-20 01:20:32,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:20:32,512 INFO L225 Difference]: With dead ends: 5973 [2019-11-20 01:20:32,512 INFO L226 Difference]: Without dead ends: 3482 [2019-11-20 01:20:32,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:20:32,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3482 states. [2019-11-20 01:20:33,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3482 to 2928. [2019-11-20 01:20:33,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2928 states. [2019-11-20 01:20:33,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 3387 transitions. [2019-11-20 01:20:33,031 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 3387 transitions. Word has length 274 [2019-11-20 01:20:33,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:20:33,031 INFO L462 AbstractCegarLoop]: Abstraction has 2928 states and 3387 transitions. [2019-11-20 01:20:33,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:20:33,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 3387 transitions. [2019-11-20 01:20:33,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-11-20 01:20:33,033 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:20:33,033 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:20:33,034 INFO L410 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]=== [2019-11-20 01:20:33,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:20:33,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1429805359, now seen corresponding path program 1 times [2019-11-20 01:20:33,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:20:33,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745828823] [2019-11-20 01:20:33,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:20:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:20:33,166 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-20 01:20:33,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745828823] [2019-11-20 01:20:33,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:20:33,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 01:20:33,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058799806] [2019-11-20 01:20:33,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:20:33,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:20:33,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:20:33,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:20:33,167 INFO L87 Difference]: Start difference. First operand 2928 states and 3387 transitions. Second operand 8 states. [2019-11-20 01:20:35,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:20:35,439 INFO L93 Difference]: Finished difference Result 8819 states and 10461 transitions. [2019-11-20 01:20:35,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 01:20:35,439 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 274 [2019-11-20 01:20:35,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:20:35,443 INFO L225 Difference]: With dead ends: 8819 [2019-11-20 01:20:35,443 INFO L226 Difference]: Without dead ends: 6276 [2019-11-20 01:20:35,444 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2019-11-20 01:20:35,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6276 states. [2019-11-20 01:20:35,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6276 to 2852. [2019-11-20 01:20:35,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-11-20 01:20:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3275 transitions. [2019-11-20 01:20:35,964 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3275 transitions. Word has length 274 [2019-11-20 01:20:35,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:20:35,964 INFO L462 AbstractCegarLoop]: Abstraction has 2852 states and 3275 transitions. [2019-11-20 01:20:35,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:20:35,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3275 transitions. [2019-11-20 01:20:35,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-11-20 01:20:35,966 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:20:35,966 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:20:35,967 INFO L410 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]=== [2019-11-20 01:20:35,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:20:35,967 INFO L82 PathProgramCache]: Analyzing trace with hash 649075739, now seen corresponding path program 1 times [2019-11-20 01:20:35,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:20:35,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927535176] [2019-11-20 01:20:35,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:20:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:20:36,227 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:20:36,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927535176] [2019-11-20 01:20:36,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540131420] [2019-11-20 01:20:36,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/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 [2019-11-20 01:20:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:20:36,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 1112 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 01:20:36,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:20:36,512 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:20:36,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:20:36,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-11-20 01:20:36,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076538143] [2019-11-20 01:20:36,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:20:36,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:20:36,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:20:36,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:20:36,513 INFO L87 Difference]: Start difference. First operand 2852 states and 3275 transitions. Second operand 8 states. [2019-11-20 01:20:37,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:20:37,966 INFO L93 Difference]: Finished difference Result 6079 states and 7108 transitions. [2019-11-20 01:20:37,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-20 01:20:37,966 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 274 [2019-11-20 01:20:37,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:20:37,969 INFO L225 Difference]: With dead ends: 6079 [2019-11-20 01:20:37,969 INFO L226 Difference]: Without dead ends: 3664 [2019-11-20 01:20:37,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 273 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=355, Invalid=1205, Unknown=0, NotChecked=0, Total=1560 [2019-11-20 01:20:37,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3664 states. [2019-11-20 01:20:38,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3664 to 2023. [2019-11-20 01:20:38,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2023 states. [2019-11-20 01:20:38,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 2023 states and 2311 transitions. [2019-11-20 01:20:38,407 INFO L78 Accepts]: Start accepts. Automaton has 2023 states and 2311 transitions. Word has length 274 [2019-11-20 01:20:38,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:20:38,407 INFO L462 AbstractCegarLoop]: Abstraction has 2023 states and 2311 transitions. [2019-11-20 01:20:38,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:20:38,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 2311 transitions. [2019-11-20 01:20:38,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-11-20 01:20:38,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:20:38,409 INFO L410 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] [2019-11-20 01:20:38,609 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:20:38,610 INFO L410 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]=== [2019-11-20 01:20:38,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:20:38,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1087114658, now seen corresponding path program 1 times [2019-11-20 01:20:38,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:20:38,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628567510] [2019-11-20 01:20:38,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:20:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:20:38,914 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:20:38,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628567510] [2019-11-20 01:20:38,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105284881] [2019-11-20 01:20:38,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/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 [2019-11-20 01:20:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:20:39,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 1104 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-20 01:20:39,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:20:39,538 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 16 proven. 19 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:20:39,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:20:39,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2019-11-20 01:20:39,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030217570] [2019-11-20 01:20:39,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-20 01:20:39,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:20:39,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-20 01:20:39,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2019-11-20 01:20:39,540 INFO L87 Difference]: Start difference. First operand 2023 states and 2311 transitions. Second operand 24 states. [2019-11-20 01:20:53,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:20:53,324 INFO L93 Difference]: Finished difference Result 20454 states and 24008 transitions. [2019-11-20 01:20:53,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2019-11-20 01:20:53,324 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 274 [2019-11-20 01:20:53,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:20:53,335 INFO L225 Difference]: With dead ends: 20454 [2019-11-20 01:20:53,335 INFO L226 Difference]: Without dead ends: 18868 [2019-11-20 01:20:53,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21985 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=7665, Invalid=47325, Unknown=0, NotChecked=0, Total=54990 [2019-11-20 01:20:53,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18868 states. [2019-11-20 01:20:53,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18868 to 2023. [2019-11-20 01:20:53,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2023 states. [2019-11-20 01:20:53,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 2023 states and 2311 transitions. [2019-11-20 01:20:53,877 INFO L78 Accepts]: Start accepts. Automaton has 2023 states and 2311 transitions. Word has length 274 [2019-11-20 01:20:53,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:20:53,877 INFO L462 AbstractCegarLoop]: Abstraction has 2023 states and 2311 transitions. [2019-11-20 01:20:53,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-20 01:20:53,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 2311 transitions. [2019-11-20 01:20:53,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-11-20 01:20:53,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:20:53,879 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:20:54,079 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:20:54,080 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:20:54,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:20:54,080 INFO L82 PathProgramCache]: Analyzing trace with hash -121179036, now seen corresponding path program 1 times [2019-11-20 01:20:54,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:20:54,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623753336] [2019-11-20 01:20:54,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:20:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:20:54,213 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-20 01:20:54,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623753336] [2019-11-20 01:20:54,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:20:54,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 01:20:54,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606858916] [2019-11-20 01:20:54,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:20:54,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:20:54,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:20:54,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:20:54,216 INFO L87 Difference]: Start difference. First operand 2023 states and 2311 transitions. Second operand 8 states. [2019-11-20 01:20:55,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:20:55,592 INFO L93 Difference]: Finished difference Result 4894 states and 5734 transitions. [2019-11-20 01:20:55,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 01:20:55,592 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 275 [2019-11-20 01:20:55,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:20:55,594 INFO L225 Difference]: With dead ends: 4894 [2019-11-20 01:20:55,594 INFO L226 Difference]: Without dead ends: 3308 [2019-11-20 01:20:55,595 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-11-20 01:20:55,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3308 states. [2019-11-20 01:20:56,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3308 to 2003. [2019-11-20 01:20:56,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2003 states. [2019-11-20 01:20:56,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 2003 states and 2279 transitions. [2019-11-20 01:20:56,081 INFO L78 Accepts]: Start accepts. Automaton has 2003 states and 2279 transitions. Word has length 275 [2019-11-20 01:20:56,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:20:56,081 INFO L462 AbstractCegarLoop]: Abstraction has 2003 states and 2279 transitions. [2019-11-20 01:20:56,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:20:56,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2003 states and 2279 transitions. [2019-11-20 01:20:56,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-11-20 01:20:56,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:20:56,083 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:20:56,083 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:20:56,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:20:56,084 INFO L82 PathProgramCache]: Analyzing trace with hash -707985050, now seen corresponding path program 1 times [2019-11-20 01:20:56,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:20:56,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523245270] [2019-11-20 01:20:56,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:20:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:20:56,229 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-20 01:20:56,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523245270] [2019-11-20 01:20:56,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:20:56,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 01:20:56,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867720047] [2019-11-20 01:20:56,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:20:56,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:20:56,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:20:56,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:20:56,232 INFO L87 Difference]: Start difference. First operand 2003 states and 2279 transitions. Second operand 8 states. [2019-11-20 01:20:57,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:20:57,932 INFO L93 Difference]: Finished difference Result 5441 states and 6370 transitions. [2019-11-20 01:20:57,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 01:20:57,932 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 275 [2019-11-20 01:20:57,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:20:57,934 INFO L225 Difference]: With dead ends: 5441 [2019-11-20 01:20:57,934 INFO L226 Difference]: Without dead ends: 3875 [2019-11-20 01:20:57,935 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-11-20 01:20:57,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3875 states. [2019-11-20 01:20:58,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3875 to 1987. [2019-11-20 01:20:58,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1987 states. [2019-11-20 01:20:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 2255 transitions. [2019-11-20 01:20:58,427 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 2255 transitions. Word has length 275 [2019-11-20 01:20:58,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:20:58,427 INFO L462 AbstractCegarLoop]: Abstraction has 1987 states and 2255 transitions. [2019-11-20 01:20:58,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:20:58,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2255 transitions. [2019-11-20 01:20:58,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-11-20 01:20:58,429 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:20:58,429 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:20:58,429 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:20:58,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:20:58,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1517331676, now seen corresponding path program 1 times [2019-11-20 01:20:58,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:20:58,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077763490] [2019-11-20 01:20:58,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:20:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:20:58,544 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-11-20 01:20:58,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077763490] [2019-11-20 01:20:58,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:20:58,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:20:58,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407616572] [2019-11-20 01:20:58,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:20:58,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:20:58,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:20:58,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:20:58,545 INFO L87 Difference]: Start difference. First operand 1987 states and 2255 transitions. Second operand 4 states. [2019-11-20 01:20:59,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:20:59,321 INFO L93 Difference]: Finished difference Result 4163 states and 4824 transitions. [2019-11-20 01:20:59,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:20:59,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 275 [2019-11-20 01:20:59,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:20:59,323 INFO L225 Difference]: With dead ends: 4163 [2019-11-20 01:20:59,323 INFO L226 Difference]: Without dead ends: 2613 [2019-11-20 01:20:59,324 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:20:59,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2613 states. [2019-11-20 01:20:59,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2613 to 1987. [2019-11-20 01:20:59,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1987 states. [2019-11-20 01:20:59,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 2247 transitions. [2019-11-20 01:20:59,831 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 2247 transitions. Word has length 275 [2019-11-20 01:20:59,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:20:59,832 INFO L462 AbstractCegarLoop]: Abstraction has 1987 states and 2247 transitions. [2019-11-20 01:20:59,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:20:59,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2247 transitions. [2019-11-20 01:20:59,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-11-20 01:20:59,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:20:59,833 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:20:59,834 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:20:59,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:20:59,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1510449955, now seen corresponding path program 1 times [2019-11-20 01:20:59,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:20:59,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161255301] [2019-11-20 01:20:59,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:20:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:21:00,037 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 33 proven. 30 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:21:00,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161255301] [2019-11-20 01:21:00,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209299067] [2019-11-20 01:21:00,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:21:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:21:00,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 1111 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 01:21:00,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:21:00,330 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 33 proven. 30 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:21:00,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:21:00,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-11-20 01:21:00,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82402509] [2019-11-20 01:21:00,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:21:00,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:21:00,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:21:00,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:21:00,331 INFO L87 Difference]: Start difference. First operand 1987 states and 2247 transitions. Second operand 8 states. [2019-11-20 01:21:03,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:21:03,206 INFO L93 Difference]: Finished difference Result 7809 states and 9108 transitions. [2019-11-20 01:21:03,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-20 01:21:03,207 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 275 [2019-11-20 01:21:03,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:21:03,210 INFO L225 Difference]: With dead ends: 7809 [2019-11-20 01:21:03,211 INFO L226 Difference]: Without dead ends: 6259 [2019-11-20 01:21:03,212 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 281 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=382, Invalid=1340, Unknown=0, NotChecked=0, Total=1722 [2019-11-20 01:21:03,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6259 states. [2019-11-20 01:21:03,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6259 to 2620. [2019-11-20 01:21:03,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2620 states. [2019-11-20 01:21:03,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2620 states to 2620 states and 2977 transitions. [2019-11-20 01:21:03,966 INFO L78 Accepts]: Start accepts. Automaton has 2620 states and 2977 transitions. Word has length 275 [2019-11-20 01:21:03,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:21:03,967 INFO L462 AbstractCegarLoop]: Abstraction has 2620 states and 2977 transitions. [2019-11-20 01:21:03,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:21:03,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2620 states and 2977 transitions. [2019-11-20 01:21:03,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-11-20 01:21:03,968 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:21:03,969 INFO L410 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] [2019-11-20 01:21:04,169 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:21:04,169 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:21:04,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:21:04,170 INFO L82 PathProgramCache]: Analyzing trace with hash 400346918, now seen corresponding path program 1 times [2019-11-20 01:21:04,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:21:04,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366393627] [2019-11-20 01:21:04,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:21:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:21:04,404 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:21:04,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366393627] [2019-11-20 01:21:04,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156381417] [2019-11-20 01:21:04,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:21:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:21:04,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 1105 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-20 01:21:04,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:21:04,872 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 16 proven. 19 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:21:04,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:21:04,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2019-11-20 01:21:04,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674174353] [2019-11-20 01:21:04,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-20 01:21:04,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:21:04,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-20 01:21:04,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2019-11-20 01:21:04,874 INFO L87 Difference]: Start difference. First operand 2620 states and 2977 transitions. Second operand 24 states. [2019-11-20 01:21:23,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:21:23,904 INFO L93 Difference]: Finished difference Result 29231 states and 34308 transitions. [2019-11-20 01:21:23,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2019-11-20 01:21:23,904 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 275 [2019-11-20 01:21:23,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:21:23,923 INFO L225 Difference]: With dead ends: 29231 [2019-11-20 01:21:23,923 INFO L226 Difference]: Without dead ends: 27116 [2019-11-20 01:21:23,927 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21819 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=7665, Invalid=47325, Unknown=0, NotChecked=0, Total=54990 [2019-11-20 01:21:23,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27116 states. [2019-11-20 01:21:24,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27116 to 2608. [2019-11-20 01:21:24,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2608 states. [2019-11-20 01:21:24,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2608 states to 2608 states and 2965 transitions. [2019-11-20 01:21:24,787 INFO L78 Accepts]: Start accepts. Automaton has 2608 states and 2965 transitions. Word has length 275 [2019-11-20 01:21:24,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:21:24,788 INFO L462 AbstractCegarLoop]: Abstraction has 2608 states and 2965 transitions. [2019-11-20 01:21:24,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-20 01:21:24,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 2965 transitions. [2019-11-20 01:21:24,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-11-20 01:21:24,790 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:21:24,790 INFO L410 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] [2019-11-20 01:21:24,991 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:21:24,991 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:21:24,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:21:24,991 INFO L82 PathProgramCache]: Analyzing trace with hash -34158680, now seen corresponding path program 1 times [2019-11-20 01:21:24,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:21:24,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191228636] [2019-11-20 01:21:24,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:21:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:21:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-20 01:21:25,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191228636] [2019-11-20 01:21:25,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:21:25,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:21:25,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192160927] [2019-11-20 01:21:25,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:21:25,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:21:25,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:21:25,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:21:25,085 INFO L87 Difference]: Start difference. First operand 2608 states and 2965 transitions. Second operand 3 states. [2019-11-20 01:21:26,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:21:26,096 INFO L93 Difference]: Finished difference Result 4267 states and 4849 transitions. [2019-11-20 01:21:26,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:21:26,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 275 [2019-11-20 01:21:26,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:21:26,099 INFO L225 Difference]: With dead ends: 4267 [2019-11-20 01:21:26,099 INFO L226 Difference]: Without dead ends: 1918 [2019-11-20 01:21:26,100 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:21:26,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2019-11-20 01:21:26,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1918. [2019-11-20 01:21:26,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1918 states. [2019-11-20 01:21:26,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 2151 transitions. [2019-11-20 01:21:26,864 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 2151 transitions. Word has length 275 [2019-11-20 01:21:26,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:21:26,865 INFO L462 AbstractCegarLoop]: Abstraction has 1918 states and 2151 transitions. [2019-11-20 01:21:26,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:21:26,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 2151 transitions. [2019-11-20 01:21:26,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-11-20 01:21:26,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:21:26,866 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:21:26,867 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:21:26,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:21:26,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1570477130, now seen corresponding path program 1 times [2019-11-20 01:21:26,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:21:26,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184889490] [2019-11-20 01:21:26,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:21:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:21:27,265 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 3 proven. 58 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:21:27,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184889490] [2019-11-20 01:21:27,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202000969] [2019-11-20 01:21:27,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:21:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:21:27,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 1126 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 01:21:27,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:21:27,664 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 30 proven. 31 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:21:27,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:21:27,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2019-11-20 01:21:27,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067381916] [2019-11-20 01:21:27,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-20 01:21:27,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:21:27,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-20 01:21:27,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-11-20 01:21:27,666 INFO L87 Difference]: Start difference. First operand 1918 states and 2151 transitions. Second operand 17 states. [2019-11-20 01:21:45,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:21:45,380 INFO L93 Difference]: Finished difference Result 17353 states and 20037 transitions. [2019-11-20 01:21:45,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 258 states. [2019-11-20 01:21:45,381 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 277 [2019-11-20 01:21:45,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:21:45,393 INFO L225 Difference]: With dead ends: 17353 [2019-11-20 01:21:45,394 INFO L226 Difference]: Without dead ends: 15874 [2019-11-20 01:21:45,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31396 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=9128, Invalid=64584, Unknown=0, NotChecked=0, Total=73712 [2019-11-20 01:21:45,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15874 states. [2019-11-20 01:21:46,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15874 to 2479. [2019-11-20 01:21:46,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2479 states. [2019-11-20 01:21:46,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 2778 transitions. [2019-11-20 01:21:46,397 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 2778 transitions. Word has length 277 [2019-11-20 01:21:46,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:21:46,397 INFO L462 AbstractCegarLoop]: Abstraction has 2479 states and 2778 transitions. [2019-11-20 01:21:46,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-20 01:21:46,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 2778 transitions. [2019-11-20 01:21:46,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-11-20 01:21:46,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:21:46,399 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:21:46,600 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:21:46,600 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:21:46,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:21:46,600 INFO L82 PathProgramCache]: Analyzing trace with hash -2076153923, now seen corresponding path program 1 times [2019-11-20 01:21:46,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:21:46,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787145601] [2019-11-20 01:21:46,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:21:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:21:46,979 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 7 proven. 52 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:21:46,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787145601] [2019-11-20 01:21:46,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352548725] [2019-11-20 01:21:46,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:21:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:21:47,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 1141 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-20 01:21:47,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:21:47,397 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 45 proven. 27 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-11-20 01:21:47,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:21:47,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2019-11-20 01:21:47,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644870814] [2019-11-20 01:21:47,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-20 01:21:47,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:21:47,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-20 01:21:47,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-11-20 01:21:47,398 INFO L87 Difference]: Start difference. First operand 2479 states and 2778 transitions. Second operand 21 states. [2019-11-20 01:21:57,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:21:57,707 INFO L93 Difference]: Finished difference Result 13802 states and 15674 transitions. [2019-11-20 01:21:57,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-11-20 01:21:57,708 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 279 [2019-11-20 01:21:57,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:21:57,714 INFO L225 Difference]: With dead ends: 13802 [2019-11-20 01:21:57,714 INFO L226 Difference]: Without dead ends: 11815 [2019-11-20 01:21:57,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5166 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2386, Invalid=12376, Unknown=0, NotChecked=0, Total=14762 [2019-11-20 01:21:57,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11815 states. [2019-11-20 01:21:59,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11815 to 3651. [2019-11-20 01:21:59,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3651 states. [2019-11-20 01:21:59,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3651 states to 3651 states and 4124 transitions. [2019-11-20 01:21:59,290 INFO L78 Accepts]: Start accepts. Automaton has 3651 states and 4124 transitions. Word has length 279 [2019-11-20 01:21:59,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:21:59,290 INFO L462 AbstractCegarLoop]: Abstraction has 3651 states and 4124 transitions. [2019-11-20 01:21:59,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-20 01:21:59,290 INFO L276 IsEmpty]: Start isEmpty. Operand 3651 states and 4124 transitions. [2019-11-20 01:21:59,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-11-20 01:21:59,292 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:21:59,293 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:21:59,493 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:21:59,493 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:21:59,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:21:59,494 INFO L82 PathProgramCache]: Analyzing trace with hash 921896822, now seen corresponding path program 1 times [2019-11-20 01:21:59,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:21:59,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105367173] [2019-11-20 01:21:59,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:21:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:21:59,762 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 01:21:59,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105367173] [2019-11-20 01:21:59,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150367245] [2019-11-20 01:21:59,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:21:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:21:59,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 1142 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-20 01:21:59,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:22:00,245 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 7 proven. 65 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-11-20 01:22:00,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:22:00,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 22 [2019-11-20 01:22:00,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016575053] [2019-11-20 01:22:00,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 01:22:00,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:22:00,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 01:22:00,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2019-11-20 01:22:00,246 INFO L87 Difference]: Start difference. First operand 3651 states and 4124 transitions. Second operand 22 states. [2019-11-20 01:22:29,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:22:29,259 INFO L93 Difference]: Finished difference Result 28215 states and 32076 transitions. [2019-11-20 01:22:29,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 271 states. [2019-11-20 01:22:29,259 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 280 [2019-11-20 01:22:29,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:22:29,276 INFO L225 Difference]: With dead ends: 28215 [2019-11-20 01:22:29,276 INFO L226 Difference]: Without dead ends: 25195 [2019-11-20 01:22:29,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 343 SyntacticMatches, 1 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32351 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=9046, Invalid=74764, Unknown=0, NotChecked=0, Total=83810 [2019-11-20 01:22:29,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25195 states. [2019-11-20 01:22:32,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25195 to 5874. [2019-11-20 01:22:32,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5874 states. [2019-11-20 01:22:32,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5874 states to 5874 states and 6636 transitions. [2019-11-20 01:22:32,030 INFO L78 Accepts]: Start accepts. Automaton has 5874 states and 6636 transitions. Word has length 280 [2019-11-20 01:22:32,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:22:32,030 INFO L462 AbstractCegarLoop]: Abstraction has 5874 states and 6636 transitions. [2019-11-20 01:22:32,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 01:22:32,030 INFO L276 IsEmpty]: Start isEmpty. Operand 5874 states and 6636 transitions. [2019-11-20 01:22:32,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-11-20 01:22:32,035 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:22:32,036 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:22:32,239 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:22:32,240 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:22:32,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:22:32,240 INFO L82 PathProgramCache]: Analyzing trace with hash -2144042508, now seen corresponding path program 1 times [2019-11-20 01:22:32,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:22:32,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40267031] [2019-11-20 01:22:32,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:22:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:22:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:22:32,445 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:22:32,446 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 01:22:32,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 01:22:32 BoogieIcfgContainer [2019-11-20 01:22:32,697 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 01:22:32,698 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 01:22:32,698 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 01:22:32,698 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 01:22:32,699 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:17:33" (3/4) ... [2019-11-20 01:22:32,701 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 01:22:32,985 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_863a4914-2bd0-40e9-9cb6-f8dcb344a10c/bin/uautomizer/witness.graphml [2019-11-20 01:22:32,985 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 01:22:32,986 INFO L168 Benchmark]: Toolchain (without parser) took 301616.36 ms. Allocated memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: 3.9 GB). Free memory was 943.4 MB in the beginning and 404.5 MB in the end (delta: 538.9 MB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. [2019-11-20 01:22:32,986 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:22:32,987 INFO L168 Benchmark]: CACSL2BoogieTranslator took 423.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -191.1 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-20 01:22:32,987 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 01:22:32,987 INFO L168 Benchmark]: Boogie Preprocessor took 141.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 01:22:32,988 INFO L168 Benchmark]: RCFGBuilder took 1626.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 976.9 MB in the end (delta: 141.5 MB). Peak memory consumption was 141.5 MB. Max. memory is 11.5 GB. [2019-11-20 01:22:32,988 INFO L168 Benchmark]: TraceAbstraction took 299052.55 ms. Allocated memory was 1.2 GB in the beginning and 4.9 GB in the end (delta: 3.8 GB). Free memory was 976.9 MB in the beginning and 429.9 MB in the end (delta: 547.0 MB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. [2019-11-20 01:22:32,988 INFO L168 Benchmark]: Witness Printer took 287.05 ms. Allocated memory is still 4.9 GB. Free memory was 429.9 MB in the beginning and 404.5 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2019-11-20 01:22:32,990 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 423.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -191.1 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 81.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 141.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1626.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 976.9 MB in the end (delta: 141.5 MB). Peak memory consumption was 141.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 299052.55 ms. Allocated memory was 1.2 GB in the beginning and 4.9 GB in the end (delta: 3.8 GB). Free memory was 976.9 MB in the beginning and 429.9 MB in the end (delta: 547.0 MB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. * Witness Printer took 287.05 ms. Allocated memory is still 4.9 GB. Free memory was 429.9 MB in the beginning and 404.5 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 577]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L68] msg_t nomsg = (msg_t )-1; [L69] port_t g1v ; [L70] int8_t g1v_old ; [L71] int8_t g1v_new ; [L72] port_t g2v ; [L73] int8_t g2v_old ; [L74] int8_t g2v_new ; [L75] port_t g3v ; [L76] int8_t g3v_old ; [L77] int8_t g3v_new ; [L81] _Bool gate1Failed ; [L82] _Bool gate2Failed ; [L83] _Bool gate3Failed ; [L84] msg_t VALUE1 ; [L85] msg_t VALUE2 ; [L86] msg_t VALUE3 ; [L88] _Bool gate1Failed_History_0 ; [L89] _Bool gate1Failed_History_1 ; [L90] _Bool gate1Failed_History_2 ; [L91] _Bool gate2Failed_History_0 ; [L92] _Bool gate2Failed_History_1 ; [L93] _Bool gate2Failed_History_2 ; [L94] _Bool gate3Failed_History_0 ; [L95] _Bool gate3Failed_History_1 ; [L96] _Bool gate3Failed_History_2 ; [L97] int8_t votedValue_History_0 ; [L98] int8_t votedValue_History_1 ; [L99] int8_t votedValue_History_2 ; [L515] void (*nodes[4])(void) = { & gate1_each_pals_period, & gate2_each_pals_period, & gate3_each_pals_period, & voter}; 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] [L518] int c1 ; [L519] int i2 ; [L522] c1 = 0 [L523] gate1Failed = __VERIFIER_nondet_bool() [L524] gate2Failed = __VERIFIER_nondet_bool() [L525] gate3Failed = __VERIFIER_nondet_bool() [L526] VALUE1 = __VERIFIER_nondet_char() [L527] VALUE2 = __VERIFIER_nondet_char() [L528] VALUE3 = __VERIFIER_nondet_char() [L529] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L530] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L531] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L532] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L533] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L534] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L535] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L536] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L537] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L538] votedValue_History_0 = __VERIFIER_nondet_char() [L539] votedValue_History_1 = __VERIFIER_nondet_char() [L540] votedValue_History_2 = __VERIFIER_nondet_char() [L248] int tmp ; [L249] int tmp___0 ; [L250] int tmp___1 ; [L251] int tmp___2 ; [L104] _Bool ini_bool ; [L105] int8_t ini_int ; [L106] int var ; [L107] int tmp ; [L108] int tmp___0 ; [L109] int tmp___1 ; [L110] int tmp___2 ; [L113] ini_bool = (_Bool)0 [L114] ini_int = (int8_t )-2 [L115] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] COND TRUE history_id == 0 [L171] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L172] COND TRUE historyIndex == 0 [L173] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L118] tmp = (int )read_history_bool(0, 0) [L119] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] COND TRUE history_id == 0 [L171] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L172] COND TRUE historyIndex == 0 [L173] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L118] tmp = (int )read_history_bool(0, 0) [L119] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] COND TRUE history_id == 0 [L171] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L172] COND TRUE historyIndex == 0 [L173] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L118] tmp = (int )read_history_bool(0, 0) [L119] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L143] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L254] tmp = add_history_type(0) [L255] COND FALSE !(! tmp) [L104] _Bool ini_bool ; [L105] int8_t ini_int ; [L106] int var ; [L107] int tmp ; [L108] int tmp___0 ; [L109] int tmp___1 ; [L110] int tmp___2 ; [L113] ini_bool = (_Bool)0 [L114] ini_int = (int8_t )-2 [L115] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] COND TRUE history_id == 1 [L171] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L182] COND TRUE historyIndex == 0 [L183] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L124] tmp___0 = (int )read_history_bool(1, 0) [L125] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] COND TRUE history_id == 1 [L171] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L182] COND TRUE historyIndex == 0 [L183] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L124] tmp___0 = (int )read_history_bool(1, 0) [L125] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] COND TRUE history_id == 1 [L171] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L182] COND TRUE historyIndex == 0 [L183] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L124] tmp___0 = (int )read_history_bool(1, 0) [L125] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L143] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L258] tmp___0 = add_history_type(1) [L259] COND FALSE !(! tmp___0) [L104] _Bool ini_bool ; [L105] int8_t ini_int ; [L106] int var ; [L107] int tmp ; [L108] int tmp___0 ; [L109] int tmp___1 ; [L110] int tmp___2 ; [L113] ini_bool = (_Bool)0 [L114] ini_int = (int8_t )-2 [L115] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND TRUE history_id == 2 [L171] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L191] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L192] COND TRUE historyIndex == 0 [L193] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] tmp___1 = (int )read_history_bool(2, 0) [L131] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND TRUE history_id == 2 [L171] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L191] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L192] COND TRUE historyIndex == 0 [L193] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] tmp___1 = (int )read_history_bool(2, 0) [L131] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND TRUE history_id == 2 [L171] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L191] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L192] COND TRUE historyIndex == 0 [L193] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] tmp___1 = (int )read_history_bool(2, 0) [L131] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L143] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L262] tmp___1 = add_history_type(2) [L263] COND FALSE !(! tmp___1) [L104] _Bool ini_bool ; [L105] int8_t ini_int ; [L106] int var ; [L107] int tmp ; [L108] int tmp___0 ; [L109] int tmp___1 ; [L110] int tmp___2 ; [L113] ini_bool = (_Bool)0 [L114] ini_int = (int8_t )-2 [L115] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L135] COND TRUE history_id == 3 [L151] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L152] COND TRUE historyIndex == 0 [L153] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] tmp___2 = (int )read_history_int8(3, 0) [L137] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L135] COND TRUE history_id == 3 [L151] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L152] COND TRUE historyIndex == 0 [L153] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] tmp___2 = (int )read_history_int8(3, 0) [L137] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L135] COND TRUE history_id == 3 [L151] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L152] COND TRUE historyIndex == 0 [L153] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] tmp___2 = (int )read_history_int8(3, 0) [L137] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L143] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L266] tmp___2 = add_history_type(3) [L267] COND FALSE !(! tmp___2) [L270] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L541] i2 = init() [L543] g1v_old = nomsg [L544] g1v_new = nomsg [L545] g2v_old = nomsg [L546] g2v_new = nomsg [L547] g3v_old = nomsg [L548] g3v_new = nomsg [L549] 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=4, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L550] COND TRUE i2 < 10 [L383] int8_t next_state ; [L384] msg_t tmp ; [L385] int tmp___0 ; [L388] gate1Failed = __VERIFIER_nondet_bool() [L226] COND TRUE history_id == 0 [L227] gate1Failed_History_2 = gate1Failed_History_1 [L228] gate1Failed_History_1 = gate1Failed_History_0 [L229] gate1Failed_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L390] COND FALSE !(\read(gate1Failed)) [L394] tmp = __VERIFIER_nondet_char() [L395] next_state = tmp VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L396] COND FALSE !((int )next_state == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L399] COND TRUE (int )next_state == 1 [L400] tmp___0 = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L408] EXPR next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L408] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new [L414] int8_t next_state ; [L415] msg_t tmp ; [L416] int tmp___0 ; [L419] gate2Failed = __VERIFIER_nondet_bool() [L226] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=8, gate2Failed_History_2=10, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L231] COND TRUE history_id == 1 [L232] gate2Failed_History_2 = gate2Failed_History_1 [L233] gate2Failed_History_1 = gate2Failed_History_0 [L234] gate2Failed_History_0 = buf VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L421] COND FALSE !(\read(gate2Failed)) [L425] tmp = __VERIFIER_nondet_char() [L426] next_state = tmp VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L427] COND TRUE (int )next_state == 0 [L428] tmp___0 = 1 VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L439] EXPR next_state != nomsg && g2v_new == nomsg ? next_state : g2v_new VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, gate3Failed=9, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L439] g2v_new = next_state != nomsg && g2v_new == nomsg ? next_state : g2v_new [L445] int8_t next_state ; [L446] msg_t tmp ; [L447] int tmp___0 ; [L450] gate3Failed = __VERIFIER_nondet_bool() [L226] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L231] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L236] COND TRUE history_id == 2 [L237] gate3Failed_History_2 = gate3Failed_History_1 [L238] gate3Failed_History_1 = gate3Failed_History_0 [L239] gate3Failed_History_0 = buf VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L452] COND FALSE !(\read(gate3Failed)) [L456] tmp = __VERIFIER_nondet_char() [L457] next_state = tmp VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L458] COND TRUE (int )next_state == 0 [L459] tmp___0 = 1 VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L470] EXPR next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L470] g3v_new = next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new [L476] int8_t voted_value ; [L479] voted_value = nomsg [L480] VALUE1 = g1v_old [L481] g1v_old = nomsg [L482] VALUE2 = g2v_old [L483] g2v_old = nomsg [L484] VALUE3 = g3v_old [L485] g3v_old = nomsg VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0, votedValue_History_2=0] [L486] COND TRUE (int )VALUE1 == (int )VALUE2 VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0, votedValue_History_2=0] [L487] COND TRUE (int )VALUE1 == (int )nomsg [L488] voted_value = VALUE3 VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0, votedValue_History_2=0] [L211] COND TRUE history_id == 3 [L212] votedValue_History_2 = votedValue_History_1 [L213] votedValue_History_1 = votedValue_History_0 [L214] votedValue_History_0 = buf VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L556] g1v_old = g1v_new [L557] g1v_new = nomsg [L558] g2v_old = g2v_new [L559] g2v_new = nomsg [L560] g3v_old = g3v_new [L561] g3v_new = nomsg [L275] int tmp ; [L276] int temp_count ; [L277] int8_t tmp___0 ; [L278] int8_t tmp___1 ; [L279] int8_t tmp___2 ; [L280] _Bool tmp___3 ; [L281] _Bool tmp___4 ; [L282] _Bool tmp___5 ; [L283] int8_t tmp___6 ; [L284] _Bool tmp___7 ; [L285] _Bool tmp___8 ; [L286] _Bool tmp___9 ; [L287] int8_t tmp___10 ; [L288] int8_t tmp___11 ; [L289] int8_t tmp___12 ; [L290] int8_t tmp___13 ; [L291] int8_t tmp___14 ; VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L294] COND TRUE ! gate1Failed [L295] tmp = 1 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L171] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L172] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L175] COND TRUE historyIndex == 1 [L176] return (gate1Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L306] tmp___3 = read_history_bool(0, 1) [L307] COND TRUE ! tmp___3 [L171] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L181] COND TRUE history_id == 1 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L182] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L185] COND TRUE historyIndex == 1 [L186] return (gate2Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L308] tmp___4 = read_history_bool(1, 1) [L309] COND TRUE ! tmp___4 [L171] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L181] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L191] COND TRUE history_id == 2 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L192] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L195] COND TRUE historyIndex == 1 [L196] return (gate3Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L310] tmp___5 = read_history_bool(2, 1) [L311] COND TRUE ! tmp___5 [L312] temp_count = 0 [L151] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L152] COND TRUE historyIndex == 0 [L153] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L313] tmp___0 = read_history_int8(3, 0) [L314] COND TRUE (int )VALUE1 == (int )tmp___0 [L315] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L151] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L152] COND TRUE historyIndex == 0 [L153] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L317] tmp___1 = read_history_int8(3, 0) [L318] COND TRUE (int )VALUE2 == (int )tmp___1 [L319] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L151] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L152] COND TRUE historyIndex == 0 [L153] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L321] tmp___2 = read_history_int8(3, 0) [L322] COND TRUE (int )VALUE3 == (int )tmp___2 [L323] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L325] COND FALSE !((int )VALUE1 != (int )VALUE2) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L339] COND FALSE !(! (temp_count > 1)) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L151] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L152] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L155] COND TRUE historyIndex == 1 [L156] return (votedValue_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L345] tmp___10 = read_history_int8(3, 1) [L346] COND FALSE !((int )tmp___10 > -2) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L151] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L152] COND TRUE historyIndex == 0 [L153] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L365] tmp___11 = read_history_int8(3, 0) [L366] COND FALSE !((int )tmp___11 != (int )nomsg) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L378] return (1); VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L562] c1 = check() [L575] COND FALSE !(! arg) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L564] i2 ++ VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L550] COND TRUE i2 < 10 [L383] int8_t next_state ; [L384] msg_t tmp ; [L385] int tmp___0 ; [L388] gate1Failed = __VERIFIER_nondet_bool() [L226] COND TRUE history_id == 0 [L227] gate1Failed_History_2 = gate1Failed_History_1 [L228] gate1Failed_History_1 = gate1Failed_History_0 [L229] gate1Failed_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L390] COND FALSE !(\read(gate1Failed)) [L394] tmp = __VERIFIER_nondet_char() [L395] next_state = tmp VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L396] COND TRUE (int )next_state == 0 [L397] tmp___0 = 1 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L408] EXPR next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L408] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new [L414] int8_t next_state ; [L415] msg_t tmp ; [L416] int tmp___0 ; [L419] gate2Failed = __VERIFIER_nondet_bool() [L226] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=8, 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=0] [L231] COND TRUE history_id == 1 [L232] gate2Failed_History_2 = gate2Failed_History_1 [L233] gate2Failed_History_1 = gate2Failed_History_0 [L234] gate2Failed_History_0 = buf VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L421] COND TRUE \read(gate2Failed) VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L422] EXPR nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L422] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L445] int8_t next_state ; [L446] msg_t tmp ; [L447] int tmp___0 ; [L450] gate3Failed = __VERIFIER_nondet_bool() [L226] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L231] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L236] COND TRUE history_id == 2 [L237] gate3Failed_History_2 = gate3Failed_History_1 [L238] gate3Failed_History_1 = gate3Failed_History_0 [L239] gate3Failed_History_0 = buf VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L452] COND TRUE \read(gate3Failed) VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L453] EXPR nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L453] g3v_new = nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new [L476] int8_t voted_value ; [L479] voted_value = nomsg [L480] VALUE1 = g1v_old [L481] g1v_old = nomsg [L482] VALUE2 = g2v_old [L483] g2v_old = nomsg [L484] VALUE3 = g3v_old [L485] g3v_old = nomsg VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L486] COND FALSE !((int )VALUE1 == (int )VALUE2) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L493] COND FALSE !((int )VALUE1 == (int )VALUE3) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L500] COND TRUE (int )VALUE1 != (int )nomsg [L501] voted_value = VALUE1 VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L211] COND TRUE history_id == 3 [L212] votedValue_History_2 = votedValue_History_1 [L213] votedValue_History_1 = votedValue_History_0 [L214] votedValue_History_0 = buf VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L556] g1v_old = g1v_new [L557] g1v_new = nomsg [L558] g2v_old = g2v_new [L559] g2v_new = nomsg [L560] g3v_old = g3v_new [L561] g3v_new = nomsg [L275] int tmp ; [L276] int temp_count ; [L277] int8_t tmp___0 ; [L278] int8_t tmp___1 ; [L279] int8_t tmp___2 ; [L280] _Bool tmp___3 ; [L281] _Bool tmp___4 ; [L282] _Bool tmp___5 ; [L283] int8_t tmp___6 ; [L284] _Bool tmp___7 ; [L285] _Bool tmp___8 ; [L286] _Bool tmp___9 ; [L287] int8_t tmp___10 ; [L288] int8_t tmp___11 ; [L289] int8_t tmp___12 ; [L290] int8_t tmp___13 ; [L291] int8_t tmp___14 ; VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L294] COND TRUE ! gate1Failed [L295] tmp = 1 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L171] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L172] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L175] COND TRUE historyIndex == 1 [L176] return (gate1Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] tmp___3 = read_history_bool(0, 1) [L307] COND TRUE ! tmp___3 [L171] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L181] COND TRUE history_id == 1 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L182] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L185] COND TRUE historyIndex == 1 [L186] return (gate2Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] tmp___4 = read_history_bool(1, 1) [L309] COND TRUE ! tmp___4 [L171] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L181] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L191] COND TRUE history_id == 2 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L192] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L195] COND TRUE historyIndex == 1 [L196] return (gate3Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L310] tmp___5 = read_history_bool(2, 1) [L311] COND TRUE ! tmp___5 [L312] temp_count = 0 [L151] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L152] COND TRUE historyIndex == 0 [L153] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L313] tmp___0 = read_history_int8(3, 0) [L314] COND TRUE (int )VALUE1 == (int )tmp___0 [L315] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L151] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L152] COND TRUE historyIndex == 0 [L153] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L317] tmp___1 = read_history_int8(3, 0) [L318] COND FALSE !((int )VALUE2 == (int )tmp___1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L151] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L152] COND TRUE historyIndex == 0 [L153] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L321] tmp___2 = read_history_int8(3, 0) [L322] COND FALSE !((int )VALUE3 == (int )tmp___2) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L325] COND TRUE (int )VALUE1 != (int )VALUE2 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L326] COND TRUE (int )VALUE1 != (int )VALUE3 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L327] COND FALSE !((int )VALUE2 != (int )VALUE3) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L339] COND TRUE ! (temp_count > 1) [L340] return (0); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L562] c1 = check() [L575] COND TRUE ! arg VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L577] __VERIFIER_error() VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 514 locations, 37 error locations. Result: UNSAFE, OverallTime: 298.9s, OverallIterations: 69, TraceHistogramMax: 3, AutomataDifference: 254.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 39288 SDtfs, 73864 SDslu, 211634 SDs, 0 SdLazy, 55687 SolverSat, 1655 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9249 GetRequests, 4910 SyntacticMatches, 8 SemanticMatches, 4331 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1586327 ImplicationChecksByTransitivity, 113.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5874occurred in iteration=68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.9s AutomataMinimizationTime, 68 MinimizatonAttempts, 300915 StatesRemovedByMinimization, 60 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 17040 NumberOfCodeBlocks, 17040 NumberOfCodeBlocksAsserted, 88 NumberOfCheckSat, 16673 ConstructedInterpolants, 0 QuantifiedInterpolants, 12289752 SizeOfPredicates, 121 NumberOfNonLiveVariables, 18814 ConjunctsInSsa, 332 ConjunctsInUnsatCore, 87 InterpolantComputations, 51 PerfectInterpolantSequences, 9208/10096 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...