./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4232b4ba156e25efb1c3d6c50a48cd7b8244ddaf ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4232b4ba156e25efb1c3d6c50a48cd7b8244ddaf ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 02:28:26,163 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 02:28:26,166 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 02:28:26,234 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 02:28:26,234 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 02:28:26,236 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 02:28:26,238 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 02:28:26,258 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 02:28:26,263 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 02:28:26,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 02:28:26,275 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 02:28:26,276 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 02:28:26,279 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 02:28:26,282 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 02:28:26,284 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 02:28:26,286 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 02:28:26,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 02:28:26,291 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 02:28:26,300 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 02:28:26,303 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 02:28:26,314 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 02:28:26,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 02:28:26,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 02:28:26,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 02:28:26,324 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 02:28:26,326 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 02:28:26,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 02:28:26,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 02:28:26,329 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 02:28:26,330 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 02:28:26,331 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 02:28:26,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 02:28:26,332 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 02:28:26,333 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 02:28:26,335 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 02:28:26,335 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 02:28:26,336 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 02:28:26,337 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 02:28:26,337 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 02:28:26,338 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 02:28:26,339 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 02:28:26,341 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-30 02:28:26,373 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 02:28:26,373 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 02:28:26,374 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 02:28:26,374 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 02:28:26,375 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 02:28:26,375 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 02:28:26,375 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-30 02:28:26,376 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 02:28:26,376 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 02:28:26,376 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-30 02:28:26,376 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-30 02:28:26,377 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 02:28:26,377 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-30 02:28:26,377 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-30 02:28:26,377 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-30 02:28:26,378 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 02:28:26,378 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 02:28:26,379 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 02:28:26,379 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 02:28:26,379 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 02:28:26,379 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 02:28:26,380 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 02:28:26,380 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 02:28:26,380 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 02:28:26,381 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 02:28:26,381 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 02:28:26,381 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 02:28:26,381 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 02:28:26,382 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 02:28:26,382 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 02:28:26,382 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 02:28:26,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 02:28:26,383 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 02:28:26,383 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 02:28:26,383 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 02:28:26,383 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-30 02:28:26,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 02:28:26,384 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 02:28:26,384 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 02:28:26,384 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 02:28:26,385 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 4232b4ba156e25efb1c3d6c50a48cd7b8244ddaf [2020-11-30 02:28:26,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 02:28:26,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 02:28:26,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 02:28:26,720 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 02:28:26,721 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 02:28:26,722 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2020-11-30 02:28:26,810 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/data/e24dce7bb/5fda17a1d4264fbb93f5fe8f134d07f0/FLAGc8acb36db [2020-11-30 02:28:27,318 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 02:28:27,319 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2020-11-30 02:28:27,333 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/data/e24dce7bb/5fda17a1d4264fbb93f5fe8f134d07f0/FLAGc8acb36db [2020-11-30 02:28:27,649 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/data/e24dce7bb/5fda17a1d4264fbb93f5fe8f134d07f0 [2020-11-30 02:28:27,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 02:28:27,654 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 02:28:27,661 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 02:28:27,661 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 02:28:27,665 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 02:28:27,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:28:27" (1/1) ... [2020-11-30 02:28:27,669 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3116c503 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:28:27, skipping insertion in model container [2020-11-30 02:28:27,669 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:28:27" (1/1) ... [2020-11-30 02:28:27,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 02:28:27,734 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 02:28:28,006 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:28:28,017 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 02:28:28,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:28:28,114 INFO L208 MainTranslator]: Completed translation [2020-11-30 02:28:28,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:28:28 WrapperNode [2020-11-30 02:28:28,115 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 02:28:28,117 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 02:28:28,117 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 02:28:28,117 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 02:28:28,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:28:28" (1/1) ... [2020-11-30 02:28:28,140 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:28:28" (1/1) ... [2020-11-30 02:28:28,209 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 02:28:28,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 02:28:28,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 02:28:28,212 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 02:28:28,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:28:28" (1/1) ... [2020-11-30 02:28:28,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:28:28" (1/1) ... [2020-11-30 02:28:28,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:28:28" (1/1) ... [2020-11-30 02:28:28,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:28:28" (1/1) ... [2020-11-30 02:28:28,272 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:28:28" (1/1) ... [2020-11-30 02:28:28,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:28:28" (1/1) ... [2020-11-30 02:28:28,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:28:28" (1/1) ... [2020-11-30 02:28:28,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 02:28:28,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 02:28:28,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 02:28:28,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 02:28:28,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:28:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 02:28:28,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 02:28:28,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 02:28:28,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 02:28:28,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 02:28:31,234 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 02:28:31,234 INFO L298 CfgBuilder]: Removed 169 assume(true) statements. [2020-11-30 02:28:31,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:28:31 BoogieIcfgContainer [2020-11-30 02:28:31,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 02:28:31,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 02:28:31,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 02:28:31,251 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 02:28:31,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 02:28:27" (1/3) ... [2020-11-30 02:28:31,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f434c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:28:31, skipping insertion in model container [2020-11-30 02:28:31,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:28:28" (2/3) ... [2020-11-30 02:28:31,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f434c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:28:31, skipping insertion in model container [2020-11-30 02:28:31,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:28:31" (3/3) ... [2020-11-30 02:28:31,257 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2020-11-30 02:28:31,273 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 02:28:31,279 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2020-11-30 02:28:31,295 INFO L253 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2020-11-30 02:28:31,348 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 02:28:31,348 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 02:28:31,348 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 02:28:31,349 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 02:28:31,350 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 02:28:31,350 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 02:28:31,350 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 02:28:31,350 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 02:28:31,383 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states. [2020-11-30 02:28:31,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-30 02:28:31,399 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:28:31,400 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:28:31,402 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:28:31,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:28:31,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1439738341, now seen corresponding path program 1 times [2020-11-30 02:28:31,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:28:31,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421600761] [2020-11-30 02:28:31,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:28:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:28:31,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:28:31,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421600761] [2020-11-30 02:28:31,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:28:31,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:28:31,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367108186] [2020-11-30 02:28:31,748 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:28:31,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:28:31,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:28:31,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:28:31,770 INFO L87 Difference]: Start difference. First operand 232 states. Second operand 3 states. [2020-11-30 02:28:31,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:28:31,939 INFO L93 Difference]: Finished difference Result 465 states and 720 transitions. [2020-11-30 02:28:31,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:28:31,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-30 02:28:31,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:28:31,980 INFO L225 Difference]: With dead ends: 465 [2020-11-30 02:28:31,981 INFO L226 Difference]: Without dead ends: 232 [2020-11-30 02:28:31,985 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:28:32,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2020-11-30 02:28:32,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 207. [2020-11-30 02:28:32,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2020-11-30 02:28:32,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 299 transitions. [2020-11-30 02:28:32,062 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 299 transitions. Word has length 11 [2020-11-30 02:28:32,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:28:32,063 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 299 transitions. [2020-11-30 02:28:32,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:28:32,063 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 299 transitions. [2020-11-30 02:28:32,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-30 02:28:32,064 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:28:32,064 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:28:32,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 02:28:32,065 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:28:32,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:28:32,065 INFO L82 PathProgramCache]: Analyzing trace with hash 838433344, now seen corresponding path program 1 times [2020-11-30 02:28:32,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:28:32,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619754713] [2020-11-30 02:28:32,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:28:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:28:32,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:28:32,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619754713] [2020-11-30 02:28:32,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:28:32,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:28:32,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722091905] [2020-11-30 02:28:32,246 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:28:32,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:28:32,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:28:32,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:28:32,247 INFO L87 Difference]: Start difference. First operand 207 states and 299 transitions. Second operand 3 states. [2020-11-30 02:28:32,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:28:32,293 INFO L93 Difference]: Finished difference Result 435 states and 630 transitions. [2020-11-30 02:28:32,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:28:32,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-11-30 02:28:32,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:28:32,297 INFO L225 Difference]: With dead ends: 435 [2020-11-30 02:28:32,298 INFO L226 Difference]: Without dead ends: 229 [2020-11-30 02:28:32,300 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:28:32,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-11-30 02:28:32,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 202. [2020-11-30 02:28:32,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-11-30 02:28:32,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 291 transitions. [2020-11-30 02:28:32,322 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 291 transitions. Word has length 13 [2020-11-30 02:28:32,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:28:32,323 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 291 transitions. [2020-11-30 02:28:32,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:28:32,323 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 291 transitions. [2020-11-30 02:28:32,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-30 02:28:32,325 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:28:32,326 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:28:32,326 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 02:28:32,326 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:28:32,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:28:32,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1989613146, now seen corresponding path program 1 times [2020-11-30 02:28:32,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:28:32,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462970977] [2020-11-30 02:28:32,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:28:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:28:32,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:28:32,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462970977] [2020-11-30 02:28:32,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:28:32,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:28:32,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405530762] [2020-11-30 02:28:32,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:28:32,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:28:32,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:28:32,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:28:32,462 INFO L87 Difference]: Start difference. First operand 202 states and 291 transitions. Second operand 3 states. [2020-11-30 02:28:32,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:28:32,540 INFO L93 Difference]: Finished difference Result 434 states and 629 transitions. [2020-11-30 02:28:32,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:28:32,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-11-30 02:28:32,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:28:32,542 INFO L225 Difference]: With dead ends: 434 [2020-11-30 02:28:32,542 INFO L226 Difference]: Without dead ends: 233 [2020-11-30 02:28:32,543 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:28:32,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-11-30 02:28:32,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 182. [2020-11-30 02:28:32,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-11-30 02:28:32,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 259 transitions. [2020-11-30 02:28:32,554 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 259 transitions. Word has length 17 [2020-11-30 02:28:32,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:28:32,555 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 259 transitions. [2020-11-30 02:28:32,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:28:32,555 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 259 transitions. [2020-11-30 02:28:32,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-30 02:28:32,556 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:28:32,556 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:28:32,556 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 02:28:32,557 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:28:32,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:28:32,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1132192396, now seen corresponding path program 1 times [2020-11-30 02:28:32,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:28:32,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214840089] [2020-11-30 02:28:32,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:28:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:28:32,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:28:32,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214840089] [2020-11-30 02:28:32,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:28:32,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:28:32,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702666907] [2020-11-30 02:28:32,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:28:32,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:28:32,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:28:32,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:28:32,642 INFO L87 Difference]: Start difference. First operand 182 states and 259 transitions. Second operand 3 states. [2020-11-30 02:28:32,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:28:32,702 INFO L93 Difference]: Finished difference Result 402 states and 573 transitions. [2020-11-30 02:28:32,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:28:32,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-11-30 02:28:32,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:28:32,705 INFO L225 Difference]: With dead ends: 402 [2020-11-30 02:28:32,705 INFO L226 Difference]: Without dead ends: 221 [2020-11-30 02:28:32,706 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:28:32,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-11-30 02:28:32,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 170. [2020-11-30 02:28:32,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-11-30 02:28:32,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 241 transitions. [2020-11-30 02:28:32,721 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 241 transitions. Word has length 21 [2020-11-30 02:28:32,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:28:32,721 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 241 transitions. [2020-11-30 02:28:32,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:28:32,722 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 241 transitions. [2020-11-30 02:28:32,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 02:28:32,726 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:28:32,726 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:28:32,726 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 02:28:32,727 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:28:32,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:28:32,729 INFO L82 PathProgramCache]: Analyzing trace with hash -181469522, now seen corresponding path program 1 times [2020-11-30 02:28:32,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:28:32,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019511778] [2020-11-30 02:28:32,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:28:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:28:32,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:28:32,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019511778] [2020-11-30 02:28:32,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:28:32,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:28:32,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873605816] [2020-11-30 02:28:32,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:28:32,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:28:32,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:28:32,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:28:32,911 INFO L87 Difference]: Start difference. First operand 170 states and 241 transitions. Second operand 3 states. [2020-11-30 02:28:33,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:28:33,023 INFO L93 Difference]: Finished difference Result 398 states and 565 transitions. [2020-11-30 02:28:33,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:28:33,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-11-30 02:28:33,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:28:33,026 INFO L225 Difference]: With dead ends: 398 [2020-11-30 02:28:33,026 INFO L226 Difference]: Without dead ends: 229 [2020-11-30 02:28:33,027 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:28:33,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-11-30 02:28:33,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 150. [2020-11-30 02:28:33,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-11-30 02:28:33,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 209 transitions. [2020-11-30 02:28:33,042 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 209 transitions. Word has length 22 [2020-11-30 02:28:33,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:28:33,043 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 209 transitions. [2020-11-30 02:28:33,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:28:33,044 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 209 transitions. [2020-11-30 02:28:33,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-30 02:28:33,049 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:28:33,049 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:28:33,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 02:28:33,050 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:28:33,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:28:33,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1493436962, now seen corresponding path program 1 times [2020-11-30 02:28:33,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:28:33,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465865175] [2020-11-30 02:28:33,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:28:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:28:33,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:28:33,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465865175] [2020-11-30 02:28:33,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:28:33,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 02:28:33,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062254189] [2020-11-30 02:28:33,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:28:33,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:28:33,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:28:33,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:28:33,316 INFO L87 Difference]: Start difference. First operand 150 states and 209 transitions. Second operand 6 states. [2020-11-30 02:28:33,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:28:33,565 INFO L93 Difference]: Finished difference Result 590 states and 818 transitions. [2020-11-30 02:28:33,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 02:28:33,570 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-11-30 02:28:33,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:28:33,573 INFO L225 Difference]: With dead ends: 590 [2020-11-30 02:28:33,574 INFO L226 Difference]: Without dead ends: 441 [2020-11-30 02:28:33,574 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-11-30 02:28:33,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2020-11-30 02:28:33,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 204. [2020-11-30 02:28:33,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-11-30 02:28:33,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 290 transitions. [2020-11-30 02:28:33,594 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 290 transitions. Word has length 27 [2020-11-30 02:28:33,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:28:33,595 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 290 transitions. [2020-11-30 02:28:33,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:28:33,601 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 290 transitions. [2020-11-30 02:28:33,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 02:28:33,604 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:28:33,605 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:28:33,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 02:28:33,606 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:28:33,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:28:33,607 INFO L82 PathProgramCache]: Analyzing trace with hash -699401531, now seen corresponding path program 1 times [2020-11-30 02:28:33,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:28:33,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079709216] [2020-11-30 02:28:33,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:28:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:28:33,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:28:33,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079709216] [2020-11-30 02:28:33,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:28:33,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:28:33,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18472299] [2020-11-30 02:28:33,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:28:33,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:28:33,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:28:33,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:28:33,725 INFO L87 Difference]: Start difference. First operand 204 states and 290 transitions. Second operand 3 states. [2020-11-30 02:28:33,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:28:33,790 INFO L93 Difference]: Finished difference Result 374 states and 531 transitions. [2020-11-30 02:28:33,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:28:33,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-11-30 02:28:33,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:28:33,793 INFO L225 Difference]: With dead ends: 374 [2020-11-30 02:28:33,793 INFO L226 Difference]: Without dead ends: 225 [2020-11-30 02:28:33,793 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:28:33,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-11-30 02:28:33,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 200. [2020-11-30 02:28:33,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-11-30 02:28:33,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 283 transitions. [2020-11-30 02:28:33,805 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 283 transitions. Word has length 28 [2020-11-30 02:28:33,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:28:33,806 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 283 transitions. [2020-11-30 02:28:33,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:28:33,806 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 283 transitions. [2020-11-30 02:28:33,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 02:28:33,807 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:28:33,807 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:28:33,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 02:28:33,808 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:28:33,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:28:33,809 INFO L82 PathProgramCache]: Analyzing trace with hash 780838015, now seen corresponding path program 1 times [2020-11-30 02:28:33,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:28:33,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130699173] [2020-11-30 02:28:33,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:28:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:28:33,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:28:33,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130699173] [2020-11-30 02:28:33,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:28:33,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:28:33,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113891181] [2020-11-30 02:28:33,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:28:33,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:28:33,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:28:33,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:28:33,905 INFO L87 Difference]: Start difference. First operand 200 states and 283 transitions. Second operand 3 states. [2020-11-30 02:28:33,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:28:33,991 INFO L93 Difference]: Finished difference Result 426 states and 594 transitions. [2020-11-30 02:28:33,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:28:33,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-11-30 02:28:33,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:28:33,995 INFO L225 Difference]: With dead ends: 426 [2020-11-30 02:28:33,995 INFO L226 Difference]: Without dead ends: 264 [2020-11-30 02:28:33,996 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:28:33,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2020-11-30 02:28:34,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 184. [2020-11-30 02:28:34,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-11-30 02:28:34,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 257 transitions. [2020-11-30 02:28:34,014 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 257 transitions. Word has length 28 [2020-11-30 02:28:34,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:28:34,016 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 257 transitions. [2020-11-30 02:28:34,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:28:34,016 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 257 transitions. [2020-11-30 02:28:34,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-11-30 02:28:34,020 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:28:34,021 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:28:34,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 02:28:34,021 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:28:34,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:28:34,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1398523016, now seen corresponding path program 1 times [2020-11-30 02:28:34,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:28:34,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948091573] [2020-11-30 02:28:34,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:28:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:28:34,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:28:34,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948091573] [2020-11-30 02:28:34,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:28:34,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 02:28:34,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022567962] [2020-11-30 02:28:34,238 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:28:34,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:28:34,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:28:34,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:28:34,245 INFO L87 Difference]: Start difference. First operand 184 states and 257 transitions. Second operand 6 states. [2020-11-30 02:28:34,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:28:34,745 INFO L93 Difference]: Finished difference Result 815 states and 1111 transitions. [2020-11-30 02:28:34,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 02:28:34,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-11-30 02:28:34,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:28:34,751 INFO L225 Difference]: With dead ends: 815 [2020-11-30 02:28:34,751 INFO L226 Difference]: Without dead ends: 664 [2020-11-30 02:28:34,752 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-11-30 02:28:34,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2020-11-30 02:28:34,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 230. [2020-11-30 02:28:34,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-11-30 02:28:34,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 319 transitions. [2020-11-30 02:28:34,774 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 319 transitions. Word has length 31 [2020-11-30 02:28:34,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:28:34,774 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 319 transitions. [2020-11-30 02:28:34,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:28:34,774 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 319 transitions. [2020-11-30 02:28:34,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-30 02:28:34,775 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:28:34,775 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:28:34,775 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 02:28:34,776 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:28:34,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:28:34,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1663561300, now seen corresponding path program 1 times [2020-11-30 02:28:34,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:28:34,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520862670] [2020-11-30 02:28:34,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:28:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:28:34,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:28:34,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520862670] [2020-11-30 02:28:34,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:28:34,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 02:28:34,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902743023] [2020-11-30 02:28:34,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:28:34,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:28:34,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:28:34,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:28:34,867 INFO L87 Difference]: Start difference. First operand 230 states and 319 transitions. Second operand 4 states. [2020-11-30 02:28:35,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:28:35,003 INFO L93 Difference]: Finished difference Result 372 states and 519 transitions. [2020-11-30 02:28:35,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:28:35,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-11-30 02:28:35,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:28:35,006 INFO L225 Difference]: With dead ends: 372 [2020-11-30 02:28:35,006 INFO L226 Difference]: Without dead ends: 370 [2020-11-30 02:28:35,007 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:28:35,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2020-11-30 02:28:35,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 232. [2020-11-30 02:28:35,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2020-11-30 02:28:35,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 321 transitions. [2020-11-30 02:28:35,030 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 321 transitions. Word has length 32 [2020-11-30 02:28:35,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:28:35,030 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 321 transitions. [2020-11-30 02:28:35,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:28:35,031 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 321 transitions. [2020-11-30 02:28:35,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-30 02:28:35,032 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:28:35,033 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:28:35,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 02:28:35,033 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:28:35,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:28:35,034 INFO L82 PathProgramCache]: Analyzing trace with hash -272475739, now seen corresponding path program 1 times [2020-11-30 02:28:35,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:28:35,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480455702] [2020-11-30 02:28:35,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:28:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:28:35,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:28:35,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480455702] [2020-11-30 02:28:35,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:28:35,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 02:28:35,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010945141] [2020-11-30 02:28:35,180 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:28:35,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:28:35,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:28:35,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:28:35,181 INFO L87 Difference]: Start difference. First operand 232 states and 321 transitions. Second operand 6 states. [2020-11-30 02:28:35,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:28:35,467 INFO L93 Difference]: Finished difference Result 806 states and 1098 transitions. [2020-11-30 02:28:35,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 02:28:35,467 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2020-11-30 02:28:35,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:28:35,471 INFO L225 Difference]: With dead ends: 806 [2020-11-30 02:28:35,471 INFO L226 Difference]: Without dead ends: 648 [2020-11-30 02:28:35,472 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-11-30 02:28:35,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-11-30 02:28:35,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 241. [2020-11-30 02:28:35,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2020-11-30 02:28:35,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 331 transitions. [2020-11-30 02:28:35,497 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 331 transitions. Word has length 32 [2020-11-30 02:28:35,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:28:35,498 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 331 transitions. [2020-11-30 02:28:35,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:28:35,498 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 331 transitions. [2020-11-30 02:28:35,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-30 02:28:35,499 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:28:35,499 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:28:35,499 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 02:28:35,500 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:28:35,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:28:35,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1817072290, now seen corresponding path program 1 times [2020-11-30 02:28:35,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:28:35,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947214768] [2020-11-30 02:28:35,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:28:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:28:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:28:35,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947214768] [2020-11-30 02:28:35,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:28:35,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 02:28:35,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757932378] [2020-11-30 02:28:35,673 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 02:28:35,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:28:35,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 02:28:35,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:28:35,674 INFO L87 Difference]: Start difference. First operand 241 states and 331 transitions. Second operand 5 states. [2020-11-30 02:28:35,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:28:35,763 INFO L93 Difference]: Finished difference Result 436 states and 602 transitions. [2020-11-30 02:28:35,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 02:28:35,764 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-11-30 02:28:35,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:28:35,766 INFO L225 Difference]: With dead ends: 436 [2020-11-30 02:28:35,766 INFO L226 Difference]: Without dead ends: 278 [2020-11-30 02:28:35,767 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:28:35,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-11-30 02:28:35,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 237. [2020-11-30 02:28:35,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2020-11-30 02:28:35,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 324 transitions. [2020-11-30 02:28:35,810 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 324 transitions. Word has length 33 [2020-11-30 02:28:35,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:28:35,810 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 324 transitions. [2020-11-30 02:28:35,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 02:28:35,811 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 324 transitions. [2020-11-30 02:28:35,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-30 02:28:35,812 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:28:35,812 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:28:35,812 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 02:28:35,812 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:28:35,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:28:35,813 INFO L82 PathProgramCache]: Analyzing trace with hash -2086538273, now seen corresponding path program 1 times [2020-11-30 02:28:35,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:28:35,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933513196] [2020-11-30 02:28:35,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:28:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:28:35,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:28:35,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933513196] [2020-11-30 02:28:35,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:28:35,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 02:28:35,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336144945] [2020-11-30 02:28:35,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:28:35,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:28:35,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:28:35,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:28:35,897 INFO L87 Difference]: Start difference. First operand 237 states and 324 transitions. Second operand 4 states. [2020-11-30 02:28:36,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:28:36,054 INFO L93 Difference]: Finished difference Result 695 states and 933 transitions. [2020-11-30 02:28:36,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:28:36,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-11-30 02:28:36,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:28:36,058 INFO L225 Difference]: With dead ends: 695 [2020-11-30 02:28:36,058 INFO L226 Difference]: Without dead ends: 522 [2020-11-30 02:28:36,059 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:28:36,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-11-30 02:28:36,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 337. [2020-11-30 02:28:36,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2020-11-30 02:28:36,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 455 transitions. [2020-11-30 02:28:36,099 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 455 transitions. Word has length 33 [2020-11-30 02:28:36,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:28:36,100 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 455 transitions. [2020-11-30 02:28:36,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:28:36,100 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 455 transitions. [2020-11-30 02:28:36,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-30 02:28:36,101 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:28:36,101 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:28:36,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-30 02:28:36,102 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:28:36,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:28:36,102 INFO L82 PathProgramCache]: Analyzing trace with hash -174425670, now seen corresponding path program 1 times [2020-11-30 02:28:36,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:28:36,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7413719] [2020-11-30 02:28:36,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:28:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:28:36,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:28:36,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7413719] [2020-11-30 02:28:36,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:28:36,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:28:36,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757110925] [2020-11-30 02:28:36,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:28:36,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:28:36,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:28:36,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:28:36,146 INFO L87 Difference]: Start difference. First operand 337 states and 455 transitions. Second operand 4 states. [2020-11-30 02:28:36,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:28:36,244 INFO L93 Difference]: Finished difference Result 760 states and 1011 transitions. [2020-11-30 02:28:36,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:28:36,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-11-30 02:28:36,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:28:36,247 INFO L225 Difference]: With dead ends: 760 [2020-11-30 02:28:36,248 INFO L226 Difference]: Without dead ends: 450 [2020-11-30 02:28:36,249 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:28:36,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-11-30 02:28:36,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 296. [2020-11-30 02:28:36,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-11-30 02:28:36,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 393 transitions. [2020-11-30 02:28:36,284 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 393 transitions. Word has length 35 [2020-11-30 02:28:36,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:28:36,284 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 393 transitions. [2020-11-30 02:28:36,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:28:36,284 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 393 transitions. [2020-11-30 02:28:36,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-30 02:28:36,285 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:28:36,285 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:28:36,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-30 02:28:36,286 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:28:36,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:28:36,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1912507820, now seen corresponding path program 1 times [2020-11-30 02:28:36,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:28:36,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747825] [2020-11-30 02:28:36,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:28:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:28:36,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:28:36,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747825] [2020-11-30 02:28:36,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:28:36,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 02:28:36,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526627549] [2020-11-30 02:28:36,426 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:28:36,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:28:36,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:28:36,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:28:36,428 INFO L87 Difference]: Start difference. First operand 296 states and 393 transitions. Second operand 6 states. [2020-11-30 02:28:36,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:28:36,959 INFO L93 Difference]: Finished difference Result 1432 states and 1861 transitions. [2020-11-30 02:28:36,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 02:28:36,960 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-11-30 02:28:36,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:28:36,967 INFO L225 Difference]: With dead ends: 1432 [2020-11-30 02:28:36,967 INFO L226 Difference]: Without dead ends: 1194 [2020-11-30 02:28:36,969 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-11-30 02:28:36,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-11-30 02:28:37,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 359. [2020-11-30 02:28:37,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2020-11-30 02:28:37,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 468 transitions. [2020-11-30 02:28:37,023 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 468 transitions. Word has length 35 [2020-11-30 02:28:37,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:28:37,024 INFO L481 AbstractCegarLoop]: Abstraction has 359 states and 468 transitions. [2020-11-30 02:28:37,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:28:37,024 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 468 transitions. [2020-11-30 02:28:37,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-30 02:28:37,025 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:28:37,025 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:28:37,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-30 02:28:37,026 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:28:37,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:28:37,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1088778590, now seen corresponding path program 1 times [2020-11-30 02:28:37,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:28:37,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202017661] [2020-11-30 02:28:37,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:28:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:28:37,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:28:37,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202017661] [2020-11-30 02:28:37,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:28:37,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 02:28:37,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180731594] [2020-11-30 02:28:37,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:28:37,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:28:37,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:28:37,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:28:37,079 INFO L87 Difference]: Start difference. First operand 359 states and 468 transitions. Second operand 4 states. [2020-11-30 02:28:37,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:28:37,288 INFO L93 Difference]: Finished difference Result 1015 states and 1321 transitions. [2020-11-30 02:28:37,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:28:37,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2020-11-30 02:28:37,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:28:37,294 INFO L225 Difference]: With dead ends: 1015 [2020-11-30 02:28:37,294 INFO L226 Difference]: Without dead ends: 753 [2020-11-30 02:28:37,295 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:28:37,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2020-11-30 02:28:37,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 484. [2020-11-30 02:28:37,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2020-11-30 02:28:37,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 622 transitions. [2020-11-30 02:28:37,368 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 622 transitions. Word has length 37 [2020-11-30 02:28:37,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:28:37,369 INFO L481 AbstractCegarLoop]: Abstraction has 484 states and 622 transitions. [2020-11-30 02:28:37,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:28:37,369 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 622 transitions. [2020-11-30 02:28:37,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-11-30 02:28:37,370 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:28:37,370 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:28:37,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-30 02:28:37,371 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:28:37,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:28:37,372 INFO L82 PathProgramCache]: Analyzing trace with hash -710978299, now seen corresponding path program 1 times [2020-11-30 02:28:37,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:28:37,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313036076] [2020-11-30 02:28:37,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:28:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:28:37,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:28:37,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313036076] [2020-11-30 02:28:37,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:28:37,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 02:28:37,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749012183] [2020-11-30 02:28:37,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 02:28:37,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:28:37,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 02:28:37,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:28:37,563 INFO L87 Difference]: Start difference. First operand 484 states and 622 transitions. Second operand 5 states. [2020-11-30 02:28:37,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:28:37,733 INFO L93 Difference]: Finished difference Result 962 states and 1241 transitions. [2020-11-30 02:28:37,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:28:37,733 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-11-30 02:28:37,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:28:37,736 INFO L225 Difference]: With dead ends: 962 [2020-11-30 02:28:37,736 INFO L226 Difference]: Without dead ends: 601 [2020-11-30 02:28:37,737 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:28:37,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-11-30 02:28:37,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 480. [2020-11-30 02:28:37,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2020-11-30 02:28:37,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 615 transitions. [2020-11-30 02:28:37,798 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 615 transitions. Word has length 38 [2020-11-30 02:28:37,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:28:37,799 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 615 transitions. [2020-11-30 02:28:37,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 02:28:37,799 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 615 transitions. [2020-11-30 02:28:37,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-30 02:28:37,800 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:28:37,800 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:28:37,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-30 02:28:37,800 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:28:37,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:28:37,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1174529881, now seen corresponding path program 1 times [2020-11-30 02:28:37,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:28:37,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614454715] [2020-11-30 02:28:37,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:28:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:28:37,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:28:37,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614454715] [2020-11-30 02:28:37,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:28:37,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:28:37,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332953397] [2020-11-30 02:28:37,841 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:28:37,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:28:37,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:28:37,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:28:37,843 INFO L87 Difference]: Start difference. First operand 480 states and 615 transitions. Second operand 4 states. [2020-11-30 02:28:37,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:28:37,984 INFO L93 Difference]: Finished difference Result 1132 states and 1441 transitions. [2020-11-30 02:28:37,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:28:37,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-11-30 02:28:37,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:28:37,988 INFO L225 Difference]: With dead ends: 1132 [2020-11-30 02:28:37,988 INFO L226 Difference]: Without dead ends: 684 [2020-11-30 02:28:37,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:28:37,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2020-11-30 02:28:38,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 444. [2020-11-30 02:28:38,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-11-30 02:28:38,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 563 transitions. [2020-11-30 02:28:38,049 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 563 transitions. Word has length 40 [2020-11-30 02:28:38,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:28:38,049 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 563 transitions. [2020-11-30 02:28:38,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:28:38,049 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 563 transitions. [2020-11-30 02:28:38,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-30 02:28:38,050 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:28:38,050 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:28:38,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-30 02:28:38,051 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:28:38,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:28:38,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1097857415, now seen corresponding path program 1 times [2020-11-30 02:28:38,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:28:38,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290554401] [2020-11-30 02:28:38,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:28:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:28:38,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:28:38,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290554401] [2020-11-30 02:28:38,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:28:38,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 02:28:38,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445387238] [2020-11-30 02:28:38,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 02:28:38,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:28:38,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 02:28:38,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:28:38,250 INFO L87 Difference]: Start difference. First operand 444 states and 563 transitions. Second operand 5 states. [2020-11-30 02:28:38,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:28:38,481 INFO L93 Difference]: Finished difference Result 1231 states and 1566 transitions. [2020-11-30 02:28:38,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:28:38,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2020-11-30 02:28:38,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:28:38,487 INFO L225 Difference]: With dead ends: 1231 [2020-11-30 02:28:38,487 INFO L226 Difference]: Without dead ends: 874 [2020-11-30 02:28:38,491 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:28:38,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2020-11-30 02:28:38,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 440. [2020-11-30 02:28:38,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-11-30 02:28:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 556 transitions. [2020-11-30 02:28:38,563 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 556 transitions. Word has length 46 [2020-11-30 02:28:38,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:28:38,563 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 556 transitions. [2020-11-30 02:28:38,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 02:28:38,563 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 556 transitions. [2020-11-30 02:28:38,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-30 02:28:38,564 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:28:38,565 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:28:38,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-30 02:28:38,565 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:28:38,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:28:38,566 INFO L82 PathProgramCache]: Analyzing trace with hash -969889143, now seen corresponding path program 1 times [2020-11-30 02:28:38,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:28:38,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659104229] [2020-11-30 02:28:38,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:28:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:28:38,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:28:38,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659104229] [2020-11-30 02:28:38,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:28:38,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:28:38,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577772668] [2020-11-30 02:28:38,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:28:38,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:28:38,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:28:38,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:28:38,632 INFO L87 Difference]: Start difference. First operand 440 states and 556 transitions. Second operand 3 states. [2020-11-30 02:28:38,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:28:38,751 INFO L93 Difference]: Finished difference Result 788 states and 1004 transitions. [2020-11-30 02:28:38,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:28:38,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-11-30 02:28:38,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:28:38,754 INFO L225 Difference]: With dead ends: 788 [2020-11-30 02:28:38,755 INFO L226 Difference]: Without dead ends: 435 [2020-11-30 02:28:38,755 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:28:38,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2020-11-30 02:28:38,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2020-11-30 02:28:38,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-11-30 02:28:38,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 548 transitions. [2020-11-30 02:28:38,827 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 548 transitions. Word has length 54 [2020-11-30 02:28:38,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:28:38,828 INFO L481 AbstractCegarLoop]: Abstraction has 435 states and 548 transitions. [2020-11-30 02:28:38,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:28:38,828 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 548 transitions. [2020-11-30 02:28:38,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-11-30 02:28:38,829 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:28:38,829 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:28:38,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-30 02:28:38,830 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:28:38,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:28:38,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1037187516, now seen corresponding path program 1 times [2020-11-30 02:28:38,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:28:38,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017124193] [2020-11-30 02:28:38,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:28:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:28:39,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:28:39,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017124193] [2020-11-30 02:28:39,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:28:39,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 02:28:39,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995847278] [2020-11-30 02:28:39,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 02:28:39,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:28:39,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 02:28:39,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-30 02:28:39,016 INFO L87 Difference]: Start difference. First operand 435 states and 548 transitions. Second operand 7 states. [2020-11-30 02:28:39,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:28:39,542 INFO L93 Difference]: Finished difference Result 1112 states and 1402 transitions. [2020-11-30 02:28:39,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 02:28:39,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2020-11-30 02:28:39,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:28:39,547 INFO L225 Difference]: With dead ends: 1112 [2020-11-30 02:28:39,547 INFO L226 Difference]: Without dead ends: 764 [2020-11-30 02:28:39,548 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2020-11-30 02:28:39,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2020-11-30 02:28:39,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 445. [2020-11-30 02:28:39,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2020-11-30 02:28:39,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 557 transitions. [2020-11-30 02:28:39,619 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 557 transitions. Word has length 58 [2020-11-30 02:28:39,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:28:39,619 INFO L481 AbstractCegarLoop]: Abstraction has 445 states and 557 transitions. [2020-11-30 02:28:39,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 02:28:39,619 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 557 transitions. [2020-11-30 02:28:39,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-30 02:28:39,620 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:28:39,620 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:28:39,621 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-30 02:28:39,621 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:28:39,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:28:39,621 INFO L82 PathProgramCache]: Analyzing trace with hash 382924135, now seen corresponding path program 1 times [2020-11-30 02:28:39,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:28:39,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551252661] [2020-11-30 02:28:39,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:28:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:28:40,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:28:40,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551252661] [2020-11-30 02:28:40,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:28:40,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-11-30 02:28:40,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412652964] [2020-11-30 02:28:40,839 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-30 02:28:40,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:28:40,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-30 02:28:40,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2020-11-30 02:28:40,840 INFO L87 Difference]: Start difference. First operand 445 states and 557 transitions. Second operand 24 states. [2020-11-30 02:28:41,034 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2020-11-30 02:28:44,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:28:44,364 INFO L93 Difference]: Finished difference Result 1209 states and 1505 transitions. [2020-11-30 02:28:44,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-11-30 02:28:44,367 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 62 [2020-11-30 02:28:44,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:28:44,372 INFO L225 Difference]: With dead ends: 1209 [2020-11-30 02:28:44,373 INFO L226 Difference]: Without dead ends: 851 [2020-11-30 02:28:44,374 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=521, Invalid=2029, Unknown=0, NotChecked=0, Total=2550 [2020-11-30 02:28:44,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2020-11-30 02:28:44,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 472. [2020-11-30 02:28:44,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2020-11-30 02:28:44,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 587 transitions. [2020-11-30 02:28:44,457 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 587 transitions. Word has length 62 [2020-11-30 02:28:44,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:28:44,457 INFO L481 AbstractCegarLoop]: Abstraction has 472 states and 587 transitions. [2020-11-30 02:28:44,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-30 02:28:44,458 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 587 transitions. [2020-11-30 02:28:44,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-30 02:28:44,459 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:28:44,459 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:28:44,459 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-30 02:28:44,460 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:28:44,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:28:44,460 INFO L82 PathProgramCache]: Analyzing trace with hash -556361464, now seen corresponding path program 1 times [2020-11-30 02:28:44,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:28:44,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495780611] [2020-11-30 02:28:44,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:28:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:28:44,697 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:28:44,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495780611] [2020-11-30 02:28:44,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236397660] [2020-11-30 02:28:44,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:28:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:28:44,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 02:28:44,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:28:45,212 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 02:28:45,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:28:45,226 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 02:28:45,227 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:28:45,229 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 2, 2, 1] term [2020-11-30 02:28:45,229 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:28:45,232 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 02:28:45,232 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:28:45,254 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 02:28:45,282 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 02:28:45,283 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-11-30 02:28:45,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [7] total 9 [2020-11-30 02:28:45,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726721019] [2020-11-30 02:28:45,284 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:28:45,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:28:45,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:28:45,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-30 02:28:45,285 INFO L87 Difference]: Start difference. First operand 472 states and 587 transitions. Second operand 4 states. [2020-11-30 02:28:45,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:28:45,528 INFO L93 Difference]: Finished difference Result 1024 states and 1264 transitions. [2020-11-30 02:28:45,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 02:28:45,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-11-30 02:28:45,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:28:45,533 INFO L225 Difference]: With dead ends: 1024 [2020-11-30 02:28:45,533 INFO L226 Difference]: Without dead ends: 608 [2020-11-30 02:28:45,534 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-30 02:28:45,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-11-30 02:28:45,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 472. [2020-11-30 02:28:45,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2020-11-30 02:28:45,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 585 transitions. [2020-11-30 02:28:45,648 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 585 transitions. Word has length 62 [2020-11-30 02:28:45,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:28:45,648 INFO L481 AbstractCegarLoop]: Abstraction has 472 states and 585 transitions. [2020-11-30 02:28:45,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:28:45,648 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 585 transitions. [2020-11-30 02:28:45,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-30 02:28:45,655 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:28:45,655 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 02:28:45,868 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-11-30 02:28:45,868 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:28:45,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:28:45,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1561438136, now seen corresponding path program 1 times [2020-11-30 02:28:45,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:28:45,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686649286] [2020-11-30 02:28:45,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:28:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:28:46,066 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:28:46,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686649286] [2020-11-30 02:28:46,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542717510] [2020-11-30 02:28:46,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:28:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:28:46,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 16 conjunts are in the unsatisfiable core [2020-11-30 02:28:46,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:28:46,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-30 02:28:46,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:28:46,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 02:28:46,564 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:28:46,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:28:46,631 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-30 02:28:46,632 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:28:46,633 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:28:46,634 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:28:46,639 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:28:46,785 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2020-11-30 02:28:46,817 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:28:46,817 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:28:46,818 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:28:46,828 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:28:46,831 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:28:46,954 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:28:46,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2021896370] [2020-11-30 02:28:46,982 INFO L159 IcfgInterpreter]: Started Sifa with 47 locations of interest [2020-11-30 02:28:46,982 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:28:46,998 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 02:28:47,008 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 02:28:47,008 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 02:28:47,274 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:28:47,302 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:28:47,330 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:28:47,356 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:28:47,384 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:28:47,411 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:28:47,505 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:28:47,534 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:28:47,558 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:28:47,582 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:28:47,605 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:28:47,627 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:28:48,096 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2020-11-30 02:28:48,205 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2020-11-30 02:28:52,250 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2020-11-30 02:28:54,787 WARN L193 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 186 DAG size of output: 179 [2020-11-30 02:28:57,800 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 187 DAG size of output: 181 [2020-11-30 02:29:10,684 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2020-11-30 02:29:15,742 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 186 DAG size of output: 179 [2020-11-30 02:29:16,803 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 187 DAG size of output: 181 [2020-11-30 02:29:17,103 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2020-11-30 02:29:17,202 INFO L180 IcfgInterpreter]: Interpretation finished [2020-11-30 02:29:18,051 WARN L193 SmtUtils]: Spent 774.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 153 [2020-11-30 02:29:19,158 WARN L193 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 237 DAG size of output: 186 [2020-11-30 02:29:20,583 WARN L193 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 186 DAG size of output: 172 [2020-11-30 02:29:22,178 WARN L193 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 200 DAG size of output: 186 [2020-11-30 02:29:23,829 WARN L193 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 203 DAG size of output: 189 [2020-11-30 02:29:25,477 WARN L193 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 206 DAG size of output: 191 [2020-11-30 02:29:27,125 WARN L193 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 195 DAG size of output: 181 [2020-11-30 02:29:28,858 WARN L193 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 200 DAG size of output: 186 [2020-11-30 02:29:30,616 WARN L193 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 204 DAG size of output: 188 [2020-11-30 02:29:32,331 WARN L193 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 256 DAG size of output: 196 [2020-11-30 02:29:34,290 WARN L193 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 262 DAG size of output: 198 [2020-11-30 02:29:35,988 WARN L193 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 267 DAG size of output: 200 [2020-11-30 02:29:36,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:29:36,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [7, 7, 7] total 30 [2020-11-30 02:29:36,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628640684] [2020-11-30 02:29:36,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 02:29:36,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:29:36,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 02:29:36,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2020-11-30 02:29:36,180 INFO L87 Difference]: Start difference. First operand 472 states and 585 transitions. Second operand 14 states. [2020-11-30 02:29:38,436 WARN L193 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 293 DAG size of output: 204 [2020-11-30 02:29:39,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:29:39,742 INFO L93 Difference]: Finished difference Result 886 states and 1099 transitions. [2020-11-30 02:29:39,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 02:29:39,743 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2020-11-30 02:29:39,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:29:39,746 INFO L225 Difference]: With dead ends: 886 [2020-11-30 02:29:39,746 INFO L226 Difference]: Without dead ends: 487 [2020-11-30 02:29:39,747 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 171 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=136, Invalid=856, Unknown=0, NotChecked=0, Total=992 [2020-11-30 02:29:39,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2020-11-30 02:29:39,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 472. [2020-11-30 02:29:39,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2020-11-30 02:29:39,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 584 transitions. [2020-11-30 02:29:39,883 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 584 transitions. Word has length 66 [2020-11-30 02:29:39,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:29:39,884 INFO L481 AbstractCegarLoop]: Abstraction has 472 states and 584 transitions. [2020-11-30 02:29:39,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 02:29:39,884 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 584 transitions. [2020-11-30 02:29:39,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-30 02:29:39,885 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:29:39,886 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 02:29:40,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2020-11-30 02:29:40,101 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:29:40,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:29:40,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1212618655, now seen corresponding path program 1 times [2020-11-30 02:29:40,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:29:40,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928421383] [2020-11-30 02:29:40,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:29:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:29:40,407 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:29:40,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928421383] [2020-11-30 02:29:40,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786820220] [2020-11-30 02:29:40,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:29:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:29:40,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 19 conjunts are in the unsatisfiable core [2020-11-30 02:29:40,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:29:40,837 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:29:40,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:29:41,295 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 27 [2020-11-30 02:29:41,365 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:29:41,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1263575641] [2020-11-30 02:29:41,370 INFO L159 IcfgInterpreter]: Started Sifa with 49 locations of interest [2020-11-30 02:29:41,370 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:29:41,370 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 02:29:41,371 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 02:29:41,371 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 02:29:41,575 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:29:41,596 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:29:41,616 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:29:41,635 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:29:41,654 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:29:41,673 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:29:41,695 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:29:41,713 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:29:41,730 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:29:41,746 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:29:41,762 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:29:41,813 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:29:42,172 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 284 [2020-11-30 02:30:13,134 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 241 [2020-11-30 02:30:18,072 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 02:30:20,129 WARN L193 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 241 DAG size of output: 225 [2020-11-30 02:30:21,657 WARN L193 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 229 DAG size of output: 220 [2020-11-30 02:30:23,247 WARN L193 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 227 DAG size of output: 216 [2020-11-30 02:30:27,379 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2020-11-30 02:30:27,614 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2020-11-30 02:30:27,843 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2020-11-30 02:30:28,304 WARN L193 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2020-11-30 02:30:28,465 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2020-11-30 02:30:28,864 WARN L193 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2020-11-30 02:30:29,008 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2020-11-30 02:30:29,168 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2020-11-30 02:30:29,312 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-11-30 02:30:29,492 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2020-11-30 02:30:29,842 WARN L193 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 106 [2020-11-30 02:30:30,088 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2020-11-30 02:30:30,382 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2020-11-30 02:30:30,550 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2020-11-30 02:30:31,161 INFO L180 IcfgInterpreter]: Interpretation finished [2020-11-30 02:30:31,489 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 52 [2020-11-30 02:30:33,959 WARN L193 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 334 DAG size of output: 259 [2020-11-30 02:30:35,251 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 228 DAG size of output: 174 [2020-11-30 02:30:37,118 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2020-11-30 02:30:37,326 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2020-11-30 02:30:37,546 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2020-11-30 02:30:37,785 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2020-11-30 02:30:38,272 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2020-11-30 02:30:38,564 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2020-11-30 02:30:38,993 WARN L193 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 61 [2020-11-30 02:30:39,394 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 43 [2020-11-30 02:30:39,831 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 51 [2020-11-30 02:30:40,088 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2020-11-30 02:30:41,573 WARN L193 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 222 DAG size of output: 197 [2020-11-30 02:30:43,622 WARN L193 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 225 DAG size of output: 197 [2020-11-30 02:30:44,428 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2020-11-30 02:30:44,701 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2020-11-30 02:30:44,970 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2020-11-30 02:30:45,274 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2020-11-30 02:30:45,276 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-30 02:30:45,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:30:45,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2020-11-30 02:30:45,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198845244] [2020-11-30 02:30:45,277 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-30 02:30:45,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:30:45,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-30 02:30:45,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=2831, Unknown=0, NotChecked=0, Total=3192 [2020-11-30 02:30:45,279 INFO L87 Difference]: Start difference. First operand 472 states and 584 transitions. Second operand 20 states. [2020-11-30 02:30:46,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:30:46,237 INFO L93 Difference]: Finished difference Result 1437 states and 1798 transitions. [2020-11-30 02:30:46,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 02:30:46,239 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2020-11-30 02:30:46,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:30:46,245 INFO L225 Difference]: With dead ends: 1437 [2020-11-30 02:30:46,245 INFO L226 Difference]: Without dead ends: 1079 [2020-11-30 02:30:46,248 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 140 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1270 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=371, Invalid=2935, Unknown=0, NotChecked=0, Total=3306 [2020-11-30 02:30:46,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2020-11-30 02:30:46,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 536. [2020-11-30 02:30:46,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2020-11-30 02:30:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 659 transitions. [2020-11-30 02:30:46,384 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 659 transitions. Word has length 66 [2020-11-30 02:30:46,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:30:46,385 INFO L481 AbstractCegarLoop]: Abstraction has 536 states and 659 transitions. [2020-11-30 02:30:46,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-30 02:30:46,385 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 659 transitions. [2020-11-30 02:30:46,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-30 02:30:46,386 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:30:46,386 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 02:30:46,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2020-11-30 02:30:46,612 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:30:46,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:30:46,613 INFO L82 PathProgramCache]: Analyzing trace with hash -2110832152, now seen corresponding path program 1 times [2020-11-30 02:30:46,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:30:46,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757187599] [2020-11-30 02:30:46,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:30:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:30:46,929 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:30:46,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757187599] [2020-11-30 02:30:46,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692741436] [2020-11-30 02:30:46,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:30:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:30:47,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 19 conjunts are in the unsatisfiable core [2020-11-30 02:30:47,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:30:47,325 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:30:47,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:30:47,745 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2020-11-30 02:30:47,824 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:30:47,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1148347148] [2020-11-30 02:30:47,827 INFO L159 IcfgInterpreter]: Started Sifa with 47 locations of interest [2020-11-30 02:30:47,827 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:30:47,828 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 02:30:47,828 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 02:30:47,828 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 02:30:47,959 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:30:47,989 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:30:48,017 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:30:48,045 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:30:48,073 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:30:48,098 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:30:48,122 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:30:48,148 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:30:48,164 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:30:48,185 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:30:48,202 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:30:48,217 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:30:49,975 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 02:30:50,091 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 5184 conjuctions. This might take some time... [2020-11-30 02:31:01,438 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 5184 conjuctions. [2020-11-30 02:31:01,589 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 02:31:01,697 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 5184 conjuctions. This might take some time... [2020-11-30 02:31:13,082 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 5184 conjuctions. [2020-11-30 02:31:19,264 WARN L193 SmtUtils]: Spent 5.09 s on a formula simplification. DAG size of input: 884 DAG size of output: 240 [2020-11-30 02:31:20,242 WARN L193 SmtUtils]: Spent 973.00 ms on a formula simplification that was a NOOP. DAG size: 240 [2020-11-30 02:31:21,377 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 249 [2020-11-30 02:31:22,474 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 249 [2020-11-30 02:31:23,692 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 249 [2020-11-30 02:31:24,826 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 249 [2020-11-30 02:31:26,533 WARN L193 SmtUtils]: Spent 1.65 s on a formula simplification that was a NOOP. DAG size: 402 [2020-11-30 02:31:26,581 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 02:31:26,612 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 02:31:26,908 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 156 [2020-11-30 02:31:27,113 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:31:27,334 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:31:27,532 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:31:27,796 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:31:28,003 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:31:28,243 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-30 02:31:28,462 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-30 02:31:28,699 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-30 02:31:28,921 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-30 02:31:29,197 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:31:29,450 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:31:29,745 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:31:29,996 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:31:30,261 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:31:30,505 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:31:30,774 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:31:31,030 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:31:31,326 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:31:31,596 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:31:31,883 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:31:32,156 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:31:32,439 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:31:32,704 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:31:32,989 WARN L193 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:31:33,254 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:31:33,537 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:31:33,794 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:31:34,083 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2020-11-30 02:31:34,348 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2020-11-30 02:31:34,655 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2020-11-30 02:31:34,943 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2020-11-30 02:31:35,202 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:31:35,449 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:31:35,708 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:31:35,959 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:31:36,230 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:31:36,474 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:31:36,734 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:31:36,976 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:31:37,240 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:31:37,488 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:31:37,749 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:31:37,996 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:31:38,278 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:31:38,544 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:31:38,862 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:31:39,132 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:31:39,424 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:31:39,693 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:31:39,982 WARN L193 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:31:40,244 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:31:40,530 WARN L193 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:31:40,796 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:31:41,090 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:31:41,354 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:31:41,632 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:31:41,887 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:31:42,162 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:31:42,421 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:31:42,701 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:31:42,965 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:31:43,307 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2020-11-30 02:31:43,592 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2020-11-30 02:31:43,901 WARN L193 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2020-11-30 02:31:44,193 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2020-11-30 02:31:44,822 WARN L193 SmtUtils]: Spent 626.00 ms on a formula simplification that was a NOOP. DAG size: 239 [2020-11-30 02:31:44,927 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 02:31:46,230 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 02:31:52,385 WARN L193 SmtUtils]: Spent 4.20 s on a formula simplification. DAG size of input: 723 DAG size of output: 263 [2020-11-30 02:31:53,636 WARN L193 SmtUtils]: Spent 1.25 s on a formula simplification that was a NOOP. DAG size: 263 [2020-11-30 02:31:55,067 WARN L193 SmtUtils]: Spent 1.34 s on a formula simplification that was a NOOP. DAG size: 269 [2020-11-30 02:31:56,468 WARN L193 SmtUtils]: Spent 1.40 s on a formula simplification that was a NOOP. DAG size: 269 [2020-11-30 02:31:57,834 WARN L193 SmtUtils]: Spent 1.31 s on a formula simplification that was a NOOP. DAG size: 269 [2020-11-30 02:31:59,187 WARN L193 SmtUtils]: Spent 1.35 s on a formula simplification that was a NOOP. DAG size: 269 [2020-11-30 02:31:59,270 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 02:31:59,295 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 02:31:59,570 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 156 [2020-11-30 02:31:59,771 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:32:00,019 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:32:00,212 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:32:00,438 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:32:00,636 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:32:00,885 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-30 02:32:01,103 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-30 02:32:01,346 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-30 02:32:01,566 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-30 02:32:01,847 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:02,092 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:02,366 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:02,624 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:02,912 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:03,165 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:03,442 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:03,695 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:03,993 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:04,269 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:04,580 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:04,864 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:05,163 WARN L193 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:05,431 WARN L193 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:05,739 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:06,018 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:06,316 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:32:06,571 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:32:06,872 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2020-11-30 02:32:07,140 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2020-11-30 02:32:07,455 WARN L193 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2020-11-30 02:32:07,739 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2020-11-30 02:32:08,047 WARN L193 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2020-11-30 02:32:08,327 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2020-11-30 02:32:08,606 WARN L193 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2020-11-30 02:32:08,872 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2020-11-30 02:32:09,139 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:32:09,393 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:32:09,673 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:09,944 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:10,217 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:10,485 WARN L193 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:10,770 WARN L193 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:11,043 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:11,327 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:11,594 WARN L193 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:11,848 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:12,096 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:12,369 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:12,614 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:12,908 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:13,154 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:13,426 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:13,673 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:13,959 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:14,211 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:14,483 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:14,739 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:15,039 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:15,302 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:15,602 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:15,882 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:16,192 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:16,467 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:16,770 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:17,042 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:17,335 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:17,601 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:17,906 WARN L193 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:32:18,165 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:32:18,451 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:32:18,707 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:32:18,998 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:32:19,257 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:32:19,543 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:32:19,800 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:32:20,111 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2020-11-30 02:32:20,393 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2020-11-30 02:32:20,705 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2020-11-30 02:32:20,989 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2020-11-30 02:32:21,596 WARN L193 SmtUtils]: Spent 594.00 ms on a formula simplification that was a NOOP. DAG size: 239 [2020-11-30 02:32:22,242 WARN L193 SmtUtils]: Spent 602.00 ms on a formula simplification that was a NOOP. DAG size: 239 [2020-11-30 02:32:22,849 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2020-11-30 02:32:23,134 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2020-11-30 02:32:23,429 WARN L193 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2020-11-30 02:32:23,714 WARN L193 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2020-11-30 02:32:23,990 WARN L193 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:32:24,254 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:32:24,522 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:32:24,779 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:32:25,049 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:32:25,311 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:32:25,577 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:32:25,836 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:32:26,112 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:26,381 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:26,655 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:26,919 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:27,194 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:27,459 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:27,732 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:27,994 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:28,286 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:28,554 WARN L193 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:32:28,810 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:29,053 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:29,308 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:29,550 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:29,801 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:30,045 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:30,306 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:30,548 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:30,800 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:31,041 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:31,297 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:31,542 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:31,799 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:32,042 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:32,298 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:32,540 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:32,792 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:33,035 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:32:33,268 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-30 02:32:33,483 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-30 02:32:33,710 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-30 02:32:33,939 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-30 02:32:34,154 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:32:34,350 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:32:34,554 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:32:34,746 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:32:34,747 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 02:32:34,995 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 156 [2020-11-30 02:32:35,189 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:32:35,190 INFO L180 IcfgInterpreter]: Interpretation finished [2020-11-30 02:32:36,223 WARN L193 SmtUtils]: Spent 986.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 121 [2020-11-30 02:32:36,953 WARN L193 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 110 [2020-11-30 02:32:37,201 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2020-11-30 02:32:37,489 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2020-11-30 02:32:37,674 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-11-30 02:32:38,714 WARN L193 SmtUtils]: Spent 776.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 111 [2020-11-30 02:32:39,733 WARN L193 SmtUtils]: Spent 875.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 115 [2020-11-30 02:32:40,785 WARN L193 SmtUtils]: Spent 877.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 117 [2020-11-30 02:32:49,816 WARN L193 SmtUtils]: Spent 8.71 s on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:32:58,838 WARN L193 SmtUtils]: Spent 8.61 s on a formula simplification that was a NOOP. DAG size: 164 [2020-11-30 02:33:09,744 WARN L193 SmtUtils]: Spent 10.46 s on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:33:21,661 WARN L193 SmtUtils]: Spent 11.36 s on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:33:32,399 WARN L193 SmtUtils]: Spent 10.24 s on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:33:44,325 WARN L193 SmtUtils]: Spent 11.42 s on a formula simplification that was a NOOP. DAG size: 180 [2020-11-30 02:33:57,333 WARN L193 SmtUtils]: Spent 12.41 s on a formula simplification that was a NOOP. DAG size: 181 [2020-11-30 02:33:57,874 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2020-11-30 02:33:58,841 WARN L193 SmtUtils]: Spent 746.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 127 [2020-11-30 02:33:59,737 WARN L193 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 124 [2020-11-30 02:34:11,186 WARN L193 SmtUtils]: Spent 10.87 s on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:34:23,015 WARN L193 SmtUtils]: Spent 11.17 s on a formula simplification that was a NOOP. DAG size: 179 [2020-11-30 02:34:35,728 WARN L193 SmtUtils]: Spent 11.99 s on a formula simplification that was a NOOP. DAG size: 186 [2020-11-30 02:34:35,731 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-30 02:34:35,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:34:35,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2020-11-30 02:34:35,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975535972] [2020-11-30 02:34:35,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-30 02:34:35,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:34:35,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-30 02:34:35,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1645, Unknown=0, NotChecked=0, Total=1806 [2020-11-30 02:34:35,734 INFO L87 Difference]: Start difference. First operand 536 states and 659 transitions. Second operand 20 states. [2020-11-30 02:34:36,080 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 20 [2020-11-30 02:34:36,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:34:36,936 INFO L93 Difference]: Finished difference Result 1445 states and 1801 transitions. [2020-11-30 02:34:36,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 02:34:36,938 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2020-11-30 02:34:36,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:34:36,945 INFO L225 Difference]: With dead ends: 1445 [2020-11-30 02:34:36,946 INFO L226 Difference]: Without dead ends: 1083 [2020-11-30 02:34:36,947 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 121.5s TimeCoverageRelationStatistics Valid=171, Invalid=1721, Unknown=0, NotChecked=0, Total=1892 [2020-11-30 02:34:36,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2020-11-30 02:34:37,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 536. [2020-11-30 02:34:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2020-11-30 02:34:37,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 658 transitions. [2020-11-30 02:34:37,095 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 658 transitions. Word has length 66 [2020-11-30 02:34:37,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:34:37,095 INFO L481 AbstractCegarLoop]: Abstraction has 536 states and 658 transitions. [2020-11-30 02:34:37,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-30 02:34:37,095 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 658 transitions. [2020-11-30 02:34:37,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-11-30 02:34:37,097 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:34:37,097 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 02:34:37,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable843,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:34:37,324 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:34:37,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:34:37,325 INFO L82 PathProgramCache]: Analyzing trace with hash -596361862, now seen corresponding path program 1 times [2020-11-30 02:34:37,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:34:37,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804682059] [2020-11-30 02:34:37,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:34:37,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:34:37,593 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:34:37,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804682059] [2020-11-30 02:34:37,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906240764] [2020-11-30 02:34:37,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:34:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:34:37,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-30 02:34:37,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:34:37,991 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-30 02:34:37,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:34:38,003 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-30 02:34:38,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-11-30 02:34:38,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 11 [2020-11-30 02:34:38,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799513679] [2020-11-30 02:34:38,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:34:38,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:34:38,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:34:38,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-11-30 02:34:38,005 INFO L87 Difference]: Start difference. First operand 536 states and 658 transitions. Second operand 6 states. [2020-11-30 02:34:38,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:34:38,407 INFO L93 Difference]: Finished difference Result 1305 states and 1622 transitions. [2020-11-30 02:34:38,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 02:34:38,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2020-11-30 02:34:38,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:34:38,414 INFO L225 Difference]: With dead ends: 1305 [2020-11-30 02:34:38,414 INFO L226 Difference]: Without dead ends: 842 [2020-11-30 02:34:38,416 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-11-30 02:34:38,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2020-11-30 02:34:38,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 536. [2020-11-30 02:34:38,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2020-11-30 02:34:38,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 656 transitions. [2020-11-30 02:34:38,560 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 656 transitions. Word has length 68 [2020-11-30 02:34:38,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:34:38,560 INFO L481 AbstractCegarLoop]: Abstraction has 536 states and 656 transitions. [2020-11-30 02:34:38,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:34:38,561 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 656 transitions. [2020-11-30 02:34:38,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-11-30 02:34:38,562 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:34:38,562 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 02:34:38,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1286 [2020-11-30 02:34:38,788 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:34:38,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:34:38,789 INFO L82 PathProgramCache]: Analyzing trace with hash -522325909, now seen corresponding path program 1 times [2020-11-30 02:34:38,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:34:38,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433256731] [2020-11-30 02:34:38,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:34:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:34:39,078 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:34:39,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433256731] [2020-11-30 02:34:39,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000110409] [2020-11-30 02:34:39,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:34:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:34:39,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 16 conjunts are in the unsatisfiable core [2020-11-30 02:34:39,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:34:39,622 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:34:39,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:34:39,983 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2020-11-30 02:34:40,204 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:34:40,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2072844199] [2020-11-30 02:34:40,208 INFO L159 IcfgInterpreter]: Started Sifa with 51 locations of interest [2020-11-30 02:34:40,208 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:34:40,208 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 02:34:40,209 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 02:34:40,209 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 02:34:40,387 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:34:40,411 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:34:40,435 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:34:40,456 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:34:40,475 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:34:40,503 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:34:40,525 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:34:40,546 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:34:40,566 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:34:40,586 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:34:40,605 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:34:40,624 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:34:43,408 WARN L193 SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 197 [2020-11-30 02:34:43,740 WARN L193 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 197 [2020-11-30 02:34:44,139 WARN L193 SmtUtils]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 200 [2020-11-30 02:34:44,502 WARN L193 SmtUtils]: Spent 361.00 ms on a formula simplification that was a NOOP. DAG size: 200 [2020-11-30 02:34:44,933 WARN L193 SmtUtils]: Spent 368.00 ms on a formula simplification that was a NOOP. DAG size: 197 [2020-11-30 02:34:45,291 WARN L193 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 197 [2020-11-30 02:34:45,693 WARN L193 SmtUtils]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 200 [2020-11-30 02:34:46,067 WARN L193 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 200 [2020-11-30 02:34:54,383 WARN L193 SmtUtils]: Spent 5.92 s on a formula simplification. DAG size of input: 1024 DAG size of output: 241 [2020-11-30 02:34:55,241 WARN L193 SmtUtils]: Spent 854.00 ms on a formula simplification that was a NOOP. DAG size: 241 [2020-11-30 02:34:56,067 WARN L193 SmtUtils]: Spent 756.00 ms on a formula simplification that was a NOOP. DAG size: 223 [2020-11-30 02:34:56,844 WARN L193 SmtUtils]: Spent 775.00 ms on a formula simplification that was a NOOP. DAG size: 223 [2020-11-30 02:34:57,742 WARN L193 SmtUtils]: Spent 849.00 ms on a formula simplification that was a NOOP. DAG size: 226 [2020-11-30 02:34:58,657 WARN L193 SmtUtils]: Spent 913.00 ms on a formula simplification that was a NOOP. DAG size: 226 [2020-11-30 02:35:08,266 WARN L193 SmtUtils]: Spent 6.29 s on a formula simplification. DAG size of input: 489 DAG size of output: 425 [2020-11-30 02:35:13,393 WARN L193 SmtUtils]: Spent 5.12 s on a formula simplification that was a NOOP. DAG size: 425 [2020-11-30 02:35:18,718 WARN L193 SmtUtils]: Spent 5.16 s on a formula simplification that was a NOOP. DAG size: 425 [2020-11-30 02:35:24,220 WARN L193 SmtUtils]: Spent 5.50 s on a formula simplification that was a NOOP. DAG size: 425 [2020-11-30 02:35:30,418 WARN L193 SmtUtils]: Spent 6.00 s on a formula simplification that was a NOOP. DAG size: 425 [2020-11-30 02:35:36,399 WARN L193 SmtUtils]: Spent 5.98 s on a formula simplification that was a NOOP. DAG size: 425 [2020-11-30 02:35:42,924 WARN L193 SmtUtils]: Spent 6.25 s on a formula simplification that was a NOOP. DAG size: 433 [2020-11-30 02:35:48,665 WARN L193 SmtUtils]: Spent 5.74 s on a formula simplification that was a NOOP. DAG size: 433 [2020-11-30 02:35:54,535 WARN L193 SmtUtils]: Spent 5.60 s on a formula simplification that was a NOOP. DAG size: 432 [2020-11-30 02:36:00,110 WARN L193 SmtUtils]: Spent 5.57 s on a formula simplification that was a NOOP. DAG size: 432 [2020-11-30 02:36:06,135 WARN L193 SmtUtils]: Spent 5.85 s on a formula simplification that was a NOOP. DAG size: 432 [2020-11-30 02:36:11,831 WARN L193 SmtUtils]: Spent 5.69 s on a formula simplification that was a NOOP. DAG size: 432 [2020-11-30 02:36:17,917 WARN L193 SmtUtils]: Spent 5.91 s on a formula simplification that was a NOOP. DAG size: 432 [2020-11-30 02:36:23,516 WARN L193 SmtUtils]: Spent 5.59 s on a formula simplification that was a NOOP. DAG size: 432 [2020-11-30 02:36:29,500 WARN L193 SmtUtils]: Spent 5.79 s on a formula simplification that was a NOOP. DAG size: 432 [2020-11-30 02:36:35,400 WARN L193 SmtUtils]: Spent 5.89 s on a formula simplification that was a NOOP. DAG size: 432 [2020-11-30 02:36:42,072 WARN L193 SmtUtils]: Spent 6.58 s on a formula simplification that was a NOOP. DAG size: 433 [2020-11-30 02:36:48,367 WARN L193 SmtUtils]: Spent 6.29 s on a formula simplification that was a NOOP. DAG size: 433 [2020-11-30 02:37:00,113 WARN L193 SmtUtils]: Spent 11.74 s on a formula simplification that was a NOOP. DAG size: 701 [2020-11-30 02:37:01,101 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 149 [2020-11-30 02:37:01,239 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-11-30 02:37:01,401 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-11-30 02:37:01,547 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-11-30 02:37:01,704 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-11-30 02:37:01,842 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-11-30 02:37:01,998 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-11-30 02:37:02,143 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-11-30 02:37:04,271 WARN L193 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 576 DAG size of output: 177 [2020-11-30 02:37:04,610 WARN L193 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2020-11-30 02:37:04,938 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-30 02:37:05,233 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-30 02:37:05,557 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2020-11-30 02:37:05,868 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2020-11-30 02:37:08,669 WARN L193 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 319 DAG size of output: 287 [2020-11-30 02:37:10,437 WARN L193 SmtUtils]: Spent 1.76 s on a formula simplification that was a NOOP. DAG size: 287 [2020-11-30 02:37:12,358 WARN L193 SmtUtils]: Spent 1.85 s on a formula simplification that was a NOOP. DAG size: 287 [2020-11-30 02:37:14,154 WARN L193 SmtUtils]: Spent 1.79 s on a formula simplification that was a NOOP. DAG size: 287 [2020-11-30 02:37:16,024 WARN L193 SmtUtils]: Spent 1.79 s on a formula simplification that was a NOOP. DAG size: 287 [2020-11-30 02:37:17,788 WARN L193 SmtUtils]: Spent 1.76 s on a formula simplification that was a NOOP. DAG size: 287 [2020-11-30 02:37:19,825 WARN L193 SmtUtils]: Spent 1.93 s on a formula simplification that was a NOOP. DAG size: 295 [2020-11-30 02:37:21,741 WARN L193 SmtUtils]: Spent 1.91 s on a formula simplification that was a NOOP. DAG size: 295 [2020-11-30 02:37:23,773 WARN L193 SmtUtils]: Spent 1.91 s on a formula simplification that was a NOOP. DAG size: 294 [2020-11-30 02:37:25,797 WARN L193 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 294 [2020-11-30 02:37:28,148 WARN L193 SmtUtils]: Spent 2.26 s on a formula simplification that was a NOOP. DAG size: 294 [2020-11-30 02:37:30,249 WARN L193 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 294 [2020-11-30 02:37:32,383 WARN L193 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 294 [2020-11-30 02:37:34,446 WARN L193 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 294 [2020-11-30 02:37:36,687 WARN L193 SmtUtils]: Spent 2.16 s on a formula simplification that was a NOOP. DAG size: 294 [2020-11-30 02:37:38,909 WARN L193 SmtUtils]: Spent 2.22 s on a formula simplification that was a NOOP. DAG size: 294 [2020-11-30 02:37:41,248 WARN L193 SmtUtils]: Spent 2.29 s on a formula simplification that was a NOOP. DAG size: 295 [2020-11-30 02:37:43,535 WARN L193 SmtUtils]: Spent 2.28 s on a formula simplification that was a NOOP. DAG size: 295 [2020-11-30 02:37:48,310 WARN L193 SmtUtils]: Spent 4.77 s on a formula simplification that was a NOOP. DAG size: 435 [2020-11-30 02:37:51,627 WARN L193 SmtUtils]: Spent 919.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 140 [2020-11-30 02:37:52,446 WARN L193 SmtUtils]: Spent 817.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 136 [2020-11-30 02:37:53,345 WARN L193 SmtUtils]: Spent 880.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 128 [2020-11-30 02:37:54,216 WARN L193 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 132 [2020-11-30 02:37:55,022 WARN L193 SmtUtils]: Spent 804.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 124 [2020-11-30 02:37:55,954 WARN L193 SmtUtils]: Spent 930.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 137 [2020-11-30 02:37:56,388 WARN L193 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-11-30 02:37:57,304 WARN L193 SmtUtils]: Spent 845.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 128 [2020-11-30 02:37:57,538 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1287 [2020-11-30 02:37:57,539 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: should have been removed by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.XnfTir.tryToEliminateConjuncts(XnfTir.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.XnfTir.tryToEliminateSingleDisjuct(XnfTir.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.XnfTir.tryToEliminate(XnfTir.java:114) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.applyEliminationInner(PartialQuantifierElimination.java:537) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.applyEliminationOuter(PartialQuantifierElimination.java:505) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.applyTir(PartialQuantifierElimination.java:441) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:285) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:153) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-30 02:37:57,542 INFO L168 Benchmark]: Toolchain (without parser) took 569887.57 ms. Allocated memory was 107.0 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 73.2 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 983.6 MB. Max. memory is 16.1 GB. [2020-11-30 02:37:57,542 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 107.0 MB. Free memory was 82.1 MB in the beginning and 82.1 MB in the end (delta: 30.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 02:37:57,542 INFO L168 Benchmark]: CACSL2BoogieTranslator took 455.20 ms. Allocated memory is still 107.0 MB. Free memory was 73.0 MB in the beginning and 76.7 MB in the end (delta: -3.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 02:37:57,543 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.15 ms. Allocated memory is still 107.0 MB. Free memory was 76.7 MB in the beginning and 72.1 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 02:37:57,543 INFO L168 Benchmark]: Boogie Preprocessor took 88.43 ms. Allocated memory is still 107.0 MB. Free memory was 72.1 MB in the beginning and 67.9 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 02:37:57,543 INFO L168 Benchmark]: RCFGBuilder took 2942.76 ms. Allocated memory was 107.0 MB in the beginning and 134.2 MB in the end (delta: 27.3 MB). Free memory was 67.9 MB in the beginning and 89.6 MB in the end (delta: -21.8 MB). Peak memory consumption was 50.6 MB. Max. memory is 16.1 GB. [2020-11-30 02:37:57,543 INFO L168 Benchmark]: TraceAbstraction took 566297.79 ms. Allocated memory was 134.2 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 89.6 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 974.3 MB. Max. memory is 16.1 GB. [2020-11-30 02:37:57,545 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 107.0 MB. Free memory was 82.1 MB in the beginning and 82.1 MB in the end (delta: 30.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 455.20 ms. Allocated memory is still 107.0 MB. Free memory was 73.0 MB in the beginning and 76.7 MB in the end (delta: -3.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 92.15 ms. Allocated memory is still 107.0 MB. Free memory was 76.7 MB in the beginning and 72.1 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 88.43 ms. Allocated memory is still 107.0 MB. Free memory was 72.1 MB in the beginning and 67.9 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2942.76 ms. Allocated memory was 107.0 MB in the beginning and 134.2 MB in the end (delta: 27.3 MB). Free memory was 67.9 MB in the beginning and 89.6 MB in the end (delta: -21.8 MB). Peak memory consumption was 50.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 566297.79 ms. Allocated memory was 134.2 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 89.6 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 974.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: should have been removed by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: should have been removed by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.XnfTir.tryToEliminateConjuncts(XnfTir.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-a4ecdab [2020-11-30 02:37:59,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 02:37:59,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 02:38:00,004 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 02:38:00,005 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 02:38:00,007 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 02:38:00,009 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 02:38:00,011 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 02:38:00,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 02:38:00,015 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 02:38:00,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 02:38:00,018 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 02:38:00,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 02:38:00,028 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 02:38:00,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 02:38:00,031 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 02:38:00,032 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 02:38:00,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 02:38:00,035 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 02:38:00,037 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 02:38:00,039 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 02:38:00,046 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 02:38:00,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 02:38:00,052 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 02:38:00,056 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 02:38:00,058 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 02:38:00,059 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 02:38:00,060 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 02:38:00,064 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 02:38:00,065 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 02:38:00,065 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 02:38:00,066 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 02:38:00,067 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 02:38:00,068 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 02:38:00,069 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 02:38:00,069 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 02:38:00,070 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 02:38:00,070 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 02:38:00,071 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 02:38:00,072 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 02:38:00,072 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 02:38:00,073 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2020-11-30 02:38:00,102 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 02:38:00,103 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 02:38:00,103 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 02:38:00,104 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 02:38:00,104 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 02:38:00,104 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 02:38:00,104 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 02:38:00,105 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 02:38:00,105 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 02:38:00,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 02:38:00,106 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 02:38:00,106 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 02:38:00,106 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 02:38:00,106 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 02:38:00,107 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 02:38:00,107 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 02:38:00,107 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 02:38:00,107 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-11-30 02:38:00,108 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-11-30 02:38:00,108 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 02:38:00,108 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 02:38:00,108 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 02:38:00,108 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 02:38:00,109 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 02:38:00,109 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 02:38:00,109 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 02:38:00,109 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 02:38:00,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 02:38:00,110 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 02:38:00,110 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 02:38:00,110 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 02:38:00,111 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-11-30 02:38:00,111 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-11-30 02:38:00,111 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 02:38:00,111 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 02:38:00,111 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 02:38:00,112 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 4232b4ba156e25efb1c3d6c50a48cd7b8244ddaf [2020-11-30 02:38:00,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 02:38:00,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 02:38:00,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 02:38:00,538 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 02:38:00,539 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 02:38:00,540 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2020-11-30 02:38:00,619 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/data/42580e5b4/6470b35f077746bda7cb81f75ad280c9/FLAGe6c63e8ac [2020-11-30 02:38:01,195 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 02:38:01,195 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2020-11-30 02:38:01,207 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/data/42580e5b4/6470b35f077746bda7cb81f75ad280c9/FLAGe6c63e8ac [2020-11-30 02:38:01,506 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/data/42580e5b4/6470b35f077746bda7cb81f75ad280c9 [2020-11-30 02:38:01,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 02:38:01,510 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 02:38:01,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 02:38:01,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 02:38:01,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 02:38:01,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:38:01" (1/1) ... [2020-11-30 02:38:01,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1818d2a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:38:01, skipping insertion in model container [2020-11-30 02:38:01,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:38:01" (1/1) ... [2020-11-30 02:38:01,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 02:38:01,563 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 02:38:01,804 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:38:01,828 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 02:38:01,945 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:38:01,967 INFO L208 MainTranslator]: Completed translation [2020-11-30 02:38:01,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:38:01 WrapperNode [2020-11-30 02:38:01,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 02:38:01,969 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 02:38:01,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 02:38:01,970 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 02:38:01,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:38:01" (1/1) ... [2020-11-30 02:38:01,993 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:38:01" (1/1) ... [2020-11-30 02:38:02,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 02:38:02,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 02:38:02,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 02:38:02,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 02:38:02,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:38:01" (1/1) ... [2020-11-30 02:38:02,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:38:01" (1/1) ... [2020-11-30 02:38:02,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:38:01" (1/1) ... [2020-11-30 02:38:02,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:38:01" (1/1) ... [2020-11-30 02:38:02,081 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:38:01" (1/1) ... [2020-11-30 02:38:02,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:38:01" (1/1) ... [2020-11-30 02:38:02,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:38:01" (1/1) ... [2020-11-30 02:38:02,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 02:38:02,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 02:38:02,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 02:38:02,106 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 02:38:02,107 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:38:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 02:38:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-11-30 02:38:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 02:38:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 02:38:02,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 02:38:04,034 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 02:38:04,040 INFO L298 CfgBuilder]: Removed 169 assume(true) statements. [2020-11-30 02:38:04,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:38:04 BoogieIcfgContainer [2020-11-30 02:38:04,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 02:38:04,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 02:38:04,045 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 02:38:04,048 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 02:38:04,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 02:38:01" (1/3) ... [2020-11-30 02:38:04,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2823cc37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:38:04, skipping insertion in model container [2020-11-30 02:38:04,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:38:01" (2/3) ... [2020-11-30 02:38:04,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2823cc37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:38:04, skipping insertion in model container [2020-11-30 02:38:04,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:38:04" (3/3) ... [2020-11-30 02:38:04,053 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2020-11-30 02:38:04,067 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 02:38:04,073 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2020-11-30 02:38:04,087 INFO L253 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2020-11-30 02:38:04,123 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 02:38:04,124 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 02:38:04,124 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 02:38:04,124 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 02:38:04,124 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 02:38:04,125 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 02:38:04,125 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 02:38:04,125 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 02:38:04,157 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states. [2020-11-30 02:38:04,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-30 02:38:04,166 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:04,167 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:04,168 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:04,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:04,177 INFO L82 PathProgramCache]: Analyzing trace with hash 349506240, now seen corresponding path program 1 times [2020-11-30 02:38:04,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:04,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347439260] [2020-11-30 02:38:04,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:04,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 1 conjunts are in the unsatisfiable core [2020-11-30 02:38:04,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:04,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:04,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:04,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:04,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347439260] [2020-11-30 02:38:04,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:04,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-11-30 02:38:04,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861735804] [2020-11-30 02:38:04,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-11-30 02:38:04,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:04,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-30 02:38:04,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-30 02:38:04,546 INFO L87 Difference]: Start difference. First operand 318 states. Second operand 2 states. [2020-11-30 02:38:04,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:04,604 INFO L93 Difference]: Finished difference Result 597 states and 916 transitions. [2020-11-30 02:38:04,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-30 02:38:04,605 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2020-11-30 02:38:04,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:04,623 INFO L225 Difference]: With dead ends: 597 [2020-11-30 02:38:04,624 INFO L226 Difference]: Without dead ends: 291 [2020-11-30 02:38:04,630 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-30 02:38:04,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-11-30 02:38:04,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2020-11-30 02:38:04,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-11-30 02:38:04,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 425 transitions. [2020-11-30 02:38:04,704 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 425 transitions. Word has length 33 [2020-11-30 02:38:04,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:04,705 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 425 transitions. [2020-11-30 02:38:04,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-11-30 02:38:04,705 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 425 transitions. [2020-11-30 02:38:04,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-30 02:38:04,708 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:04,708 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:04,930 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-11-30 02:38:04,931 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:04,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:04,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1047215368, now seen corresponding path program 1 times [2020-11-30 02:38:04,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:04,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985479635] [2020-11-30 02:38:04,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:05,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 02:38:05,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:05,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:05,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:05,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:05,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985479635] [2020-11-30 02:38:05,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:05,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-11-30 02:38:05,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856014332] [2020-11-30 02:38:05,238 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:38:05,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:05,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:38:05,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:38:05,241 INFO L87 Difference]: Start difference. First operand 291 states and 425 transitions. Second operand 4 states. [2020-11-30 02:38:05,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:05,376 INFO L93 Difference]: Finished difference Result 568 states and 824 transitions. [2020-11-30 02:38:05,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 02:38:05,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-11-30 02:38:05,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:05,386 INFO L225 Difference]: With dead ends: 568 [2020-11-30 02:38:05,386 INFO L226 Difference]: Without dead ends: 291 [2020-11-30 02:38:05,394 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:38:05,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-11-30 02:38:05,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2020-11-30 02:38:05,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-11-30 02:38:05,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 413 transitions. [2020-11-30 02:38:05,440 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 413 transitions. Word has length 33 [2020-11-30 02:38:05,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:05,441 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 413 transitions. [2020-11-30 02:38:05,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:38:05,443 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 413 transitions. [2020-11-30 02:38:05,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-30 02:38:05,448 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:05,448 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:05,667 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-11-30 02:38:05,671 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:05,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:05,672 INFO L82 PathProgramCache]: Analyzing trace with hash -600938825, now seen corresponding path program 1 times [2020-11-30 02:38:05,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:05,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478805412] [2020-11-30 02:38:05,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:05,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 02:38:05,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:05,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:05,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:05,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:05,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478805412] [2020-11-30 02:38:05,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:05,961 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-11-30 02:38:05,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550471783] [2020-11-30 02:38:05,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:38:05,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:05,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:38:05,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:38:05,966 INFO L87 Difference]: Start difference. First operand 291 states and 413 transitions. Second operand 3 states. [2020-11-30 02:38:06,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:06,102 INFO L93 Difference]: Finished difference Result 645 states and 924 transitions. [2020-11-30 02:38:06,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:38:06,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-11-30 02:38:06,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:06,107 INFO L225 Difference]: With dead ends: 645 [2020-11-30 02:38:06,107 INFO L226 Difference]: Without dead ends: 371 [2020-11-30 02:38:06,109 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:38:06,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2020-11-30 02:38:06,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 267. [2020-11-30 02:38:06,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2020-11-30 02:38:06,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 377 transitions. [2020-11-30 02:38:06,143 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 377 transitions. Word has length 44 [2020-11-30 02:38:06,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:06,143 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 377 transitions. [2020-11-30 02:38:06,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:38:06,144 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 377 transitions. [2020-11-30 02:38:06,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-30 02:38:06,152 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:06,153 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:06,368 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-11-30 02:38:06,369 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:06,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:06,371 INFO L82 PathProgramCache]: Analyzing trace with hash 906623156, now seen corresponding path program 1 times [2020-11-30 02:38:06,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:06,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806968040] [2020-11-30 02:38:06,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:06,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 02:38:06,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:06,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:06,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:06,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:06,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806968040] [2020-11-30 02:38:06,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:06,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-11-30 02:38:06,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562576642] [2020-11-30 02:38:06,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 02:38:06,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:06,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 02:38:06,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-30 02:38:06,759 INFO L87 Difference]: Start difference. First operand 267 states and 377 transitions. Second operand 8 states. [2020-11-30 02:38:07,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:07,492 INFO L93 Difference]: Finished difference Result 1062 states and 1521 transitions. [2020-11-30 02:38:07,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 02:38:07,494 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2020-11-30 02:38:07,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:07,500 INFO L225 Difference]: With dead ends: 1062 [2020-11-30 02:38:07,501 INFO L226 Difference]: Without dead ends: 812 [2020-11-30 02:38:07,502 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2020-11-30 02:38:07,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-11-30 02:38:07,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 324. [2020-11-30 02:38:07,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2020-11-30 02:38:07,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 459 transitions. [2020-11-30 02:38:07,542 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 459 transitions. Word has length 53 [2020-11-30 02:38:07,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:07,542 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 459 transitions. [2020-11-30 02:38:07,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 02:38:07,543 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 459 transitions. [2020-11-30 02:38:07,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-30 02:38:07,547 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:07,548 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:07,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-11-30 02:38:07,765 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:07,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:07,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1461923786, now seen corresponding path program 1 times [2020-11-30 02:38:07,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:07,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204704626] [2020-11-30 02:38:07,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:07,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 02:38:07,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:08,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:08,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:08,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:08,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204704626] [2020-11-30 02:38:08,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:08,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-11-30 02:38:08,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601995899] [2020-11-30 02:38:08,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 02:38:08,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:08,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 02:38:08,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-30 02:38:08,096 INFO L87 Difference]: Start difference. First operand 324 states and 459 transitions. Second operand 8 states. [2020-11-30 02:38:08,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:08,741 INFO L93 Difference]: Finished difference Result 1062 states and 1519 transitions. [2020-11-30 02:38:08,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 02:38:08,742 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2020-11-30 02:38:08,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:08,748 INFO L225 Difference]: With dead ends: 1062 [2020-11-30 02:38:08,748 INFO L226 Difference]: Without dead ends: 812 [2020-11-30 02:38:08,749 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2020-11-30 02:38:08,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-11-30 02:38:08,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 324. [2020-11-30 02:38:08,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2020-11-30 02:38:08,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 458 transitions. [2020-11-30 02:38:08,773 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 458 transitions. Word has length 54 [2020-11-30 02:38:08,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:08,774 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 458 transitions. [2020-11-30 02:38:08,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 02:38:08,774 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 458 transitions. [2020-11-30 02:38:08,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-11-30 02:38:08,775 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:08,775 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:08,992 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-11-30 02:38:08,992 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:08,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:08,995 INFO L82 PathProgramCache]: Analyzing trace with hash -194359609, now seen corresponding path program 1 times [2020-11-30 02:38:08,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:08,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510829292] [2020-11-30 02:38:08,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:09,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 02:38:09,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:09,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:09,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:09,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:09,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510829292] [2020-11-30 02:38:09,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:09,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-11-30 02:38:09,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209788044] [2020-11-30 02:38:09,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:38:09,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:09,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:38:09,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:38:09,330 INFO L87 Difference]: Start difference. First operand 324 states and 458 transitions. Second operand 3 states. [2020-11-30 02:38:09,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:09,405 INFO L93 Difference]: Finished difference Result 830 states and 1183 transitions. [2020-11-30 02:38:09,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:38:09,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-11-30 02:38:09,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:09,411 INFO L225 Difference]: With dead ends: 830 [2020-11-30 02:38:09,412 INFO L226 Difference]: Without dead ends: 580 [2020-11-30 02:38:09,414 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:38:09,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-11-30 02:38:09,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 386. [2020-11-30 02:38:09,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-11-30 02:38:09,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 546 transitions. [2020-11-30 02:38:09,458 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 546 transitions. Word has length 55 [2020-11-30 02:38:09,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:09,461 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 546 transitions. [2020-11-30 02:38:09,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:38:09,461 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 546 transitions. [2020-11-30 02:38:09,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-30 02:38:09,462 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:09,463 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:09,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-11-30 02:38:09,677 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:09,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:09,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1235396363, now seen corresponding path program 1 times [2020-11-30 02:38:09,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:09,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666819860] [2020-11-30 02:38:09,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:09,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 02:38:09,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:09,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:09,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:09,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:09,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666819860] [2020-11-30 02:38:09,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:09,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-11-30 02:38:09,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233748061] [2020-11-30 02:38:09,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:38:09,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:09,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:38:09,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:38:09,934 INFO L87 Difference]: Start difference. First operand 386 states and 546 transitions. Second operand 3 states. [2020-11-30 02:38:09,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:09,993 INFO L93 Difference]: Finished difference Result 920 states and 1308 transitions. [2020-11-30 02:38:09,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:38:09,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-11-30 02:38:09,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:09,998 INFO L225 Difference]: With dead ends: 920 [2020-11-30 02:38:09,999 INFO L226 Difference]: Without dead ends: 637 [2020-11-30 02:38:10,000 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:38:10,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-11-30 02:38:10,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 419. [2020-11-30 02:38:10,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2020-11-30 02:38:10,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 588 transitions. [2020-11-30 02:38:10,028 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 588 transitions. Word has length 56 [2020-11-30 02:38:10,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:10,028 INFO L481 AbstractCegarLoop]: Abstraction has 419 states and 588 transitions. [2020-11-30 02:38:10,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:38:10,029 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 588 transitions. [2020-11-30 02:38:10,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-30 02:38:10,029 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:10,029 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:10,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-11-30 02:38:10,251 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:10,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:10,252 INFO L82 PathProgramCache]: Analyzing trace with hash -555337993, now seen corresponding path program 1 times [2020-11-30 02:38:10,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:10,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781959825] [2020-11-30 02:38:10,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:10,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 02:38:10,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:10,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:10,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:10,479 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:38:10,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:10,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781959825] [2020-11-30 02:38:10,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:10,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-11-30 02:38:10,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943635543] [2020-11-30 02:38:10,488 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:38:10,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:10,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:38:10,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:38:10,489 INFO L87 Difference]: Start difference. First operand 419 states and 588 transitions. Second operand 4 states. [2020-11-30 02:38:10,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:10,565 INFO L93 Difference]: Finished difference Result 725 states and 1028 transitions. [2020-11-30 02:38:10,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 02:38:10,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2020-11-30 02:38:10,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:10,569 INFO L225 Difference]: With dead ends: 725 [2020-11-30 02:38:10,569 INFO L226 Difference]: Without dead ends: 390 [2020-11-30 02:38:10,570 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:38:10,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2020-11-30 02:38:10,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2020-11-30 02:38:10,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-11-30 02:38:10,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 551 transitions. [2020-11-30 02:38:10,599 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 551 transitions. Word has length 56 [2020-11-30 02:38:10,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:10,599 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 551 transitions. [2020-11-30 02:38:10,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:38:10,599 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 551 transitions. [2020-11-30 02:38:10,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-30 02:38:10,600 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:10,600 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:10,816 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-11-30 02:38:10,817 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:10,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:10,817 INFO L82 PathProgramCache]: Analyzing trace with hash -290850577, now seen corresponding path program 1 times [2020-11-30 02:38:10,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:10,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410753994] [2020-11-30 02:38:10,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:10,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 02:38:10,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:11,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:11,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:11,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:11,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410753994] [2020-11-30 02:38:11,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:11,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-11-30 02:38:11,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777910933] [2020-11-30 02:38:11,021 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:38:11,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:11,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:38:11,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:38:11,022 INFO L87 Difference]: Start difference. First operand 390 states and 551 transitions. Second operand 3 states. [2020-11-30 02:38:11,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:11,090 INFO L93 Difference]: Finished difference Result 827 states and 1180 transitions. [2020-11-30 02:38:11,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:38:11,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-11-30 02:38:11,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:11,094 INFO L225 Difference]: With dead ends: 827 [2020-11-30 02:38:11,094 INFO L226 Difference]: Without dead ends: 540 [2020-11-30 02:38:11,095 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:38:11,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-11-30 02:38:11,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 385. [2020-11-30 02:38:11,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-11-30 02:38:11,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 543 transitions. [2020-11-30 02:38:11,120 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 543 transitions. Word has length 56 [2020-11-30 02:38:11,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:11,121 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 543 transitions. [2020-11-30 02:38:11,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:38:11,121 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 543 transitions. [2020-11-30 02:38:11,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-30 02:38:11,122 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:11,122 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:11,338 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-11-30 02:38:11,338 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:11,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:11,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1417323913, now seen corresponding path program 1 times [2020-11-30 02:38:11,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:11,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069695154] [2020-11-30 02:38:11,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:11,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 02:38:11,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:11,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:11,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:11,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:11,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069695154] [2020-11-30 02:38:11,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:11,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-11-30 02:38:11,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840139276] [2020-11-30 02:38:11,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:38:11,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:11,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:38:11,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:38:11,565 INFO L87 Difference]: Start difference. First operand 385 states and 543 transitions. Second operand 3 states. [2020-11-30 02:38:11,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:11,688 INFO L93 Difference]: Finished difference Result 809 states and 1160 transitions. [2020-11-30 02:38:11,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:38:11,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-11-30 02:38:11,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:11,693 INFO L225 Difference]: With dead ends: 809 [2020-11-30 02:38:11,693 INFO L226 Difference]: Without dead ends: 527 [2020-11-30 02:38:11,694 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:38:11,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2020-11-30 02:38:11,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 365. [2020-11-30 02:38:11,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2020-11-30 02:38:11,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 511 transitions. [2020-11-30 02:38:11,723 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 511 transitions. Word has length 60 [2020-11-30 02:38:11,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:11,724 INFO L481 AbstractCegarLoop]: Abstraction has 365 states and 511 transitions. [2020-11-30 02:38:11,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:38:11,724 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 511 transitions. [2020-11-30 02:38:11,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-30 02:38:11,725 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:11,725 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:11,937 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-11-30 02:38:11,938 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:11,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:11,938 INFO L82 PathProgramCache]: Analyzing trace with hash -761365213, now seen corresponding path program 1 times [2020-11-30 02:38:11,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:11,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061422102] [2020-11-30 02:38:11,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:12,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 02:38:12,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:12,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:12,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:12,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061422102] [2020-11-30 02:38:12,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:12,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-11-30 02:38:12,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102755003] [2020-11-30 02:38:12,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:38:12,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:12,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:38:12,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:38:12,211 INFO L87 Difference]: Start difference. First operand 365 states and 511 transitions. Second operand 3 states. [2020-11-30 02:38:12,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:12,297 INFO L93 Difference]: Finished difference Result 748 states and 1058 transitions. [2020-11-30 02:38:12,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:38:12,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-11-30 02:38:12,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:12,301 INFO L225 Difference]: With dead ends: 748 [2020-11-30 02:38:12,301 INFO L226 Difference]: Without dead ends: 486 [2020-11-30 02:38:12,302 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:38:12,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2020-11-30 02:38:12,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 353. [2020-11-30 02:38:12,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-11-30 02:38:12,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 493 transitions. [2020-11-30 02:38:12,327 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 493 transitions. Word has length 64 [2020-11-30 02:38:12,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:12,327 INFO L481 AbstractCegarLoop]: Abstraction has 353 states and 493 transitions. [2020-11-30 02:38:12,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:38:12,328 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 493 transitions. [2020-11-30 02:38:12,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-30 02:38:12,328 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:12,329 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:12,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-11-30 02:38:12,541 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:12,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:12,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1570728737, now seen corresponding path program 1 times [2020-11-30 02:38:12,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:12,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085329828] [2020-11-30 02:38:12,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:12,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 02:38:12,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:12,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:12,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:12,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:12,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085329828] [2020-11-30 02:38:12,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:12,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2020-11-30 02:38:12,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497135761] [2020-11-30 02:38:12,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:38:12,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:12,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:38:12,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:38:12,870 INFO L87 Difference]: Start difference. First operand 353 states and 493 transitions. Second operand 6 states. [2020-11-30 02:38:13,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:13,165 INFO L93 Difference]: Finished difference Result 1315 states and 1850 transitions. [2020-11-30 02:38:13,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 02:38:13,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2020-11-30 02:38:13,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:13,172 INFO L225 Difference]: With dead ends: 1315 [2020-11-30 02:38:13,173 INFO L226 Difference]: Without dead ends: 1065 [2020-11-30 02:38:13,174 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-11-30 02:38:13,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2020-11-30 02:38:13,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 370. [2020-11-30 02:38:13,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-11-30 02:38:13,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 511 transitions. [2020-11-30 02:38:13,207 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 511 transitions. Word has length 65 [2020-11-30 02:38:13,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:13,207 INFO L481 AbstractCegarLoop]: Abstraction has 370 states and 511 transitions. [2020-11-30 02:38:13,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:38:13,207 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 511 transitions. [2020-11-30 02:38:13,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-11-30 02:38:13,210 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:13,211 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:13,423 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-11-30 02:38:13,424 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:13,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:13,424 INFO L82 PathProgramCache]: Analyzing trace with hash 888641750, now seen corresponding path program 1 times [2020-11-30 02:38:13,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:13,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880826251] [2020-11-30 02:38:13,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:13,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 02:38:13,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:13,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:13,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:13,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:13,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880826251] [2020-11-30 02:38:13,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:13,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-11-30 02:38:13,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305462741] [2020-11-30 02:38:13,695 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:38:13,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:13,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:38:13,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:38:13,696 INFO L87 Difference]: Start difference. First operand 370 states and 511 transitions. Second operand 3 states. [2020-11-30 02:38:13,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:13,829 INFO L93 Difference]: Finished difference Result 772 states and 1088 transitions. [2020-11-30 02:38:13,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:38:13,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-11-30 02:38:13,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:13,833 INFO L225 Difference]: With dead ends: 772 [2020-11-30 02:38:13,833 INFO L226 Difference]: Without dead ends: 522 [2020-11-30 02:38:13,834 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:38:13,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-11-30 02:38:13,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 350. [2020-11-30 02:38:13,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-11-30 02:38:13,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 479 transitions. [2020-11-30 02:38:13,863 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 479 transitions. Word has length 67 [2020-11-30 02:38:13,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:13,863 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 479 transitions. [2020-11-30 02:38:13,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:38:13,863 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 479 transitions. [2020-11-30 02:38:13,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-11-30 02:38:13,864 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:13,864 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:14,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2020-11-30 02:38:14,081 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:14,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:14,082 INFO L82 PathProgramCache]: Analyzing trace with hash 2042958320, now seen corresponding path program 1 times [2020-11-30 02:38:14,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:14,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405435990] [2020-11-30 02:38:14,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:14,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 02:38:14,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:14,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:14,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:14,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:14,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [405435990] [2020-11-30 02:38:14,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:14,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-11-30 02:38:14,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959360325] [2020-11-30 02:38:14,364 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:38:14,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:14,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:38:14,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:38:14,365 INFO L87 Difference]: Start difference. First operand 350 states and 479 transitions. Second operand 3 states. [2020-11-30 02:38:14,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:14,470 INFO L93 Difference]: Finished difference Result 729 states and 1012 transitions. [2020-11-30 02:38:14,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:38:14,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2020-11-30 02:38:14,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:14,474 INFO L225 Difference]: With dead ends: 729 [2020-11-30 02:38:14,474 INFO L226 Difference]: Without dead ends: 499 [2020-11-30 02:38:14,475 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:38:14,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2020-11-30 02:38:14,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 338. [2020-11-30 02:38:14,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-11-30 02:38:14,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 461 transitions. [2020-11-30 02:38:14,504 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 461 transitions. Word has length 71 [2020-11-30 02:38:14,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:14,504 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 461 transitions. [2020-11-30 02:38:14,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:38:14,505 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 461 transitions. [2020-11-30 02:38:14,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-11-30 02:38:14,505 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:14,506 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:14,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2020-11-30 02:38:14,722 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:14,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:14,723 INFO L82 PathProgramCache]: Analyzing trace with hash -305093618, now seen corresponding path program 1 times [2020-11-30 02:38:14,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:14,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246023110] [2020-11-30 02:38:14,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:14,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 02:38:14,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:14,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:15,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:15,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246023110] [2020-11-30 02:38:15,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:15,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2020-11-30 02:38:15,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281431670] [2020-11-30 02:38:15,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:38:15,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:15,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:38:15,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:38:15,019 INFO L87 Difference]: Start difference. First operand 338 states and 461 transitions. Second operand 6 states. [2020-11-30 02:38:15,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:15,333 INFO L93 Difference]: Finished difference Result 996 states and 1381 transitions. [2020-11-30 02:38:15,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 02:38:15,333 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2020-11-30 02:38:15,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:15,338 INFO L225 Difference]: With dead ends: 996 [2020-11-30 02:38:15,338 INFO L226 Difference]: Without dead ends: 778 [2020-11-30 02:38:15,343 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-11-30 02:38:15,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2020-11-30 02:38:15,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 342. [2020-11-30 02:38:15,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2020-11-30 02:38:15,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 465 transitions. [2020-11-30 02:38:15,373 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 465 transitions. Word has length 74 [2020-11-30 02:38:15,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:15,374 INFO L481 AbstractCegarLoop]: Abstraction has 342 states and 465 transitions. [2020-11-30 02:38:15,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:38:15,374 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 465 transitions. [2020-11-30 02:38:15,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-11-30 02:38:15,376 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:15,376 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:15,591 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2020-11-30 02:38:15,592 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:15,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:15,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1214147209, now seen corresponding path program 1 times [2020-11-30 02:38:15,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:15,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2063914755] [2020-11-30 02:38:15,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:15,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 02:38:15,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:15,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:15,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:15,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:15,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2063914755] [2020-11-30 02:38:15,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:15,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2020-11-30 02:38:15,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468213618] [2020-11-30 02:38:15,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 02:38:15,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:15,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 02:38:15,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-30 02:38:15,855 INFO L87 Difference]: Start difference. First operand 342 states and 465 transitions. Second operand 7 states. [2020-11-30 02:38:16,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:16,332 INFO L93 Difference]: Finished difference Result 1413 states and 1944 transitions. [2020-11-30 02:38:16,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 02:38:16,333 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2020-11-30 02:38:16,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:16,339 INFO L225 Difference]: With dead ends: 1413 [2020-11-30 02:38:16,340 INFO L226 Difference]: Without dead ends: 1195 [2020-11-30 02:38:16,341 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-11-30 02:38:16,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-11-30 02:38:16,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 374. [2020-11-30 02:38:16,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-11-30 02:38:16,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 501 transitions. [2020-11-30 02:38:16,380 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 501 transitions. Word has length 74 [2020-11-30 02:38:16,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:16,380 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 501 transitions. [2020-11-30 02:38:16,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 02:38:16,380 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 501 transitions. [2020-11-30 02:38:16,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-11-30 02:38:16,381 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:16,381 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:16,592 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2020-11-30 02:38:16,593 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:16,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:16,593 INFO L82 PathProgramCache]: Analyzing trace with hash -89915041, now seen corresponding path program 1 times [2020-11-30 02:38:16,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:16,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974316954] [2020-11-30 02:38:16,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:16,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 02:38:16,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:16,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:16,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:16,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:16,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974316954] [2020-11-30 02:38:16,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:16,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2020-11-30 02:38:16,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364011171] [2020-11-30 02:38:16,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 02:38:16,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:16,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 02:38:16,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-30 02:38:16,861 INFO L87 Difference]: Start difference. First operand 374 states and 501 transitions. Second operand 7 states. [2020-11-30 02:38:17,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:17,430 INFO L93 Difference]: Finished difference Result 1290 states and 1764 transitions. [2020-11-30 02:38:17,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 02:38:17,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2020-11-30 02:38:17,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:17,440 INFO L225 Difference]: With dead ends: 1290 [2020-11-30 02:38:17,441 INFO L226 Difference]: Without dead ends: 1051 [2020-11-30 02:38:17,442 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-11-30 02:38:17,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2020-11-30 02:38:17,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 399. [2020-11-30 02:38:17,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-11-30 02:38:17,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 528 transitions. [2020-11-30 02:38:17,507 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 528 transitions. Word has length 75 [2020-11-30 02:38:17,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:17,508 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 528 transitions. [2020-11-30 02:38:17,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 02:38:17,508 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 528 transitions. [2020-11-30 02:38:17,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-11-30 02:38:17,509 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:17,509 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:17,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2020-11-30 02:38:17,720 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:17,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:17,721 INFO L82 PathProgramCache]: Analyzing trace with hash 575095941, now seen corresponding path program 1 times [2020-11-30 02:38:17,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:17,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761889610] [2020-11-30 02:38:17,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:17,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 02:38:17,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:17,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:17,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:17,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:17,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761889610] [2020-11-30 02:38:17,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:17,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-11-30 02:38:17,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622497573] [2020-11-30 02:38:17,982 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:38:17,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:17,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:38:17,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:38:17,986 INFO L87 Difference]: Start difference. First operand 399 states and 528 transitions. Second operand 4 states. [2020-11-30 02:38:18,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:18,250 INFO L93 Difference]: Finished difference Result 1069 states and 1425 transitions. [2020-11-30 02:38:18,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:38:18,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-11-30 02:38:18,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:18,257 INFO L225 Difference]: With dead ends: 1069 [2020-11-30 02:38:18,257 INFO L226 Difference]: Without dead ends: 816 [2020-11-30 02:38:18,258 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 144 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:38:18,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2020-11-30 02:38:18,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 621. [2020-11-30 02:38:18,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2020-11-30 02:38:18,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 808 transitions. [2020-11-30 02:38:18,350 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 808 transitions. Word has length 75 [2020-11-30 02:38:18,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:18,350 INFO L481 AbstractCegarLoop]: Abstraction has 621 states and 808 transitions. [2020-11-30 02:38:18,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:38:18,351 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 808 transitions. [2020-11-30 02:38:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-30 02:38:18,355 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:18,355 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:18,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2020-11-30 02:38:18,575 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:18,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:18,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1521700342, now seen corresponding path program 1 times [2020-11-30 02:38:18,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:18,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520339483] [2020-11-30 02:38:18,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:18,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 02:38:18,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:18,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:18,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:18,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:18,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [520339483] [2020-11-30 02:38:18,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:18,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-11-30 02:38:18,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165360155] [2020-11-30 02:38:18,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 02:38:18,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:18,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 02:38:18,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-30 02:38:18,868 INFO L87 Difference]: Start difference. First operand 621 states and 808 transitions. Second operand 7 states. [2020-11-30 02:38:19,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:19,379 INFO L93 Difference]: Finished difference Result 1488 states and 1942 transitions. [2020-11-30 02:38:19,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 02:38:19,379 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2020-11-30 02:38:19,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:19,385 INFO L225 Difference]: With dead ends: 1488 [2020-11-30 02:38:19,385 INFO L226 Difference]: Without dead ends: 924 [2020-11-30 02:38:19,387 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-11-30 02:38:19,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2020-11-30 02:38:19,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 544. [2020-11-30 02:38:19,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2020-11-30 02:38:19,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 709 transitions. [2020-11-30 02:38:19,442 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 709 transitions. Word has length 77 [2020-11-30 02:38:19,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:19,442 INFO L481 AbstractCegarLoop]: Abstraction has 544 states and 709 transitions. [2020-11-30 02:38:19,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 02:38:19,443 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 709 transitions. [2020-11-30 02:38:19,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-30 02:38:19,444 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:19,444 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:19,667 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2020-11-30 02:38:19,667 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:19,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:19,668 INFO L82 PathProgramCache]: Analyzing trace with hash 2120832612, now seen corresponding path program 1 times [2020-11-30 02:38:19,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:19,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709767566] [2020-11-30 02:38:19,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:19,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 02:38:19,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:19,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:19,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:19,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:19,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709767566] [2020-11-30 02:38:19,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:19,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2020-11-30 02:38:19,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426365826] [2020-11-30 02:38:19,946 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 02:38:19,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:19,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 02:38:19,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-30 02:38:19,947 INFO L87 Difference]: Start difference. First operand 544 states and 709 transitions. Second operand 7 states. [2020-11-30 02:38:20,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:20,384 INFO L93 Difference]: Finished difference Result 1668 states and 2266 transitions. [2020-11-30 02:38:20,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 02:38:20,390 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2020-11-30 02:38:20,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:20,397 INFO L225 Difference]: With dead ends: 1668 [2020-11-30 02:38:20,397 INFO L226 Difference]: Without dead ends: 1262 [2020-11-30 02:38:20,398 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-11-30 02:38:20,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2020-11-30 02:38:20,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 517. [2020-11-30 02:38:20,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2020-11-30 02:38:20,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 673 transitions. [2020-11-30 02:38:20,452 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 673 transitions. Word has length 77 [2020-11-30 02:38:20,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:20,452 INFO L481 AbstractCegarLoop]: Abstraction has 517 states and 673 transitions. [2020-11-30 02:38:20,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 02:38:20,452 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 673 transitions. [2020-11-30 02:38:20,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-30 02:38:20,454 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:20,454 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:20,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2020-11-30 02:38:20,667 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:20,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:20,667 INFO L82 PathProgramCache]: Analyzing trace with hash 412430714, now seen corresponding path program 1 times [2020-11-30 02:38:20,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:20,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1536260956] [2020-11-30 02:38:20,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:20,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 02:38:20,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:20,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:20,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:20,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:20,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1536260956] [2020-11-30 02:38:20,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:20,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-11-30 02:38:20,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673420356] [2020-11-30 02:38:20,895 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:38:20,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:20,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:38:20,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:38:20,896 INFO L87 Difference]: Start difference. First operand 517 states and 673 transitions. Second operand 4 states. [2020-11-30 02:38:21,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:21,145 INFO L93 Difference]: Finished difference Result 1431 states and 1900 transitions. [2020-11-30 02:38:21,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:38:21,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-11-30 02:38:21,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:21,152 INFO L225 Difference]: With dead ends: 1431 [2020-11-30 02:38:21,152 INFO L226 Difference]: Without dead ends: 1052 [2020-11-30 02:38:21,153 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 149 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:38:21,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2020-11-30 02:38:21,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 715. [2020-11-30 02:38:21,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2020-11-30 02:38:21,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 920 transitions. [2020-11-30 02:38:21,236 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 920 transitions. Word has length 77 [2020-11-30 02:38:21,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:21,236 INFO L481 AbstractCegarLoop]: Abstraction has 715 states and 920 transitions. [2020-11-30 02:38:21,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:38:21,237 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 920 transitions. [2020-11-30 02:38:21,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-30 02:38:21,238 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:21,238 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:21,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2020-11-30 02:38:21,447 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:21,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:21,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1966375292, now seen corresponding path program 1 times [2020-11-30 02:38:21,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:21,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042414327] [2020-11-30 02:38:21,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:21,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 02:38:21,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:21,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:21,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:21,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:21,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042414327] [2020-11-30 02:38:21,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:21,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2020-11-30 02:38:21,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121042372] [2020-11-30 02:38:21,669 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:38:21,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:21,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:38:21,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:38:21,669 INFO L87 Difference]: Start difference. First operand 715 states and 920 transitions. Second operand 6 states. [2020-11-30 02:38:21,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:21,963 INFO L93 Difference]: Finished difference Result 1976 states and 2619 transitions. [2020-11-30 02:38:21,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 02:38:21,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2020-11-30 02:38:21,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:21,970 INFO L225 Difference]: With dead ends: 1976 [2020-11-30 02:38:21,970 INFO L226 Difference]: Without dead ends: 1452 [2020-11-30 02:38:21,972 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-11-30 02:38:21,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2020-11-30 02:38:22,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 739. [2020-11-30 02:38:22,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2020-11-30 02:38:22,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 947 transitions. [2020-11-30 02:38:22,063 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 947 transitions. Word has length 78 [2020-11-30 02:38:22,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:22,063 INFO L481 AbstractCegarLoop]: Abstraction has 739 states and 947 transitions. [2020-11-30 02:38:22,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:38:22,064 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 947 transitions. [2020-11-30 02:38:22,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-30 02:38:22,065 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:22,065 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:22,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2020-11-30 02:38:22,266 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:22,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:22,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1076784811, now seen corresponding path program 1 times [2020-11-30 02:38:22,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:22,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653659577] [2020-11-30 02:38:22,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:22,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 02:38:22,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:22,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:22,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:22,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:22,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653659577] [2020-11-30 02:38:22,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:22,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2020-11-30 02:38:22,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166066844] [2020-11-30 02:38:22,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:38:22,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:22,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:38:22,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:38:22,503 INFO L87 Difference]: Start difference. First operand 739 states and 947 transitions. Second operand 6 states. [2020-11-30 02:38:22,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:22,789 INFO L93 Difference]: Finished difference Result 1904 states and 2531 transitions. [2020-11-30 02:38:22,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 02:38:22,790 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2020-11-30 02:38:22,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:22,797 INFO L225 Difference]: With dead ends: 1904 [2020-11-30 02:38:22,797 INFO L226 Difference]: Without dead ends: 1380 [2020-11-30 02:38:22,798 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-11-30 02:38:22,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-11-30 02:38:22,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 749. [2020-11-30 02:38:22,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2020-11-30 02:38:22,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 957 transitions. [2020-11-30 02:38:22,885 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 957 transitions. Word has length 79 [2020-11-30 02:38:22,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:22,885 INFO L481 AbstractCegarLoop]: Abstraction has 749 states and 957 transitions. [2020-11-30 02:38:22,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:38:22,885 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 957 transitions. [2020-11-30 02:38:22,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-11-30 02:38:22,886 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:22,886 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:23,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2020-11-30 02:38:23,099 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:23,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:23,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1463168021, now seen corresponding path program 1 times [2020-11-30 02:38:23,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:23,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1867718436] [2020-11-30 02:38:23,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:23,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 02:38:23,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:23,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:23,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:23,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:23,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1867718436] [2020-11-30 02:38:23,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:23,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-11-30 02:38:23,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823289786] [2020-11-30 02:38:23,340 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 02:38:23,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:23,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 02:38:23,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-30 02:38:23,342 INFO L87 Difference]: Start difference. First operand 749 states and 957 transitions. Second operand 7 states. [2020-11-30 02:38:23,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:23,905 INFO L93 Difference]: Finished difference Result 1798 states and 2329 transitions. [2020-11-30 02:38:23,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 02:38:23,906 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2020-11-30 02:38:23,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:23,910 INFO L225 Difference]: With dead ends: 1798 [2020-11-30 02:38:23,911 INFO L226 Difference]: Without dead ends: 1128 [2020-11-30 02:38:23,912 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-11-30 02:38:23,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2020-11-30 02:38:23,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 693. [2020-11-30 02:38:23,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2020-11-30 02:38:24,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 881 transitions. [2020-11-30 02:38:24,000 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 881 transitions. Word has length 80 [2020-11-30 02:38:24,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:24,000 INFO L481 AbstractCegarLoop]: Abstraction has 693 states and 881 transitions. [2020-11-30 02:38:24,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 02:38:24,001 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 881 transitions. [2020-11-30 02:38:24,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-11-30 02:38:24,002 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:24,002 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:24,215 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2020-11-30 02:38:24,215 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:24,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:24,216 INFO L82 PathProgramCache]: Analyzing trace with hash -662287858, now seen corresponding path program 1 times [2020-11-30 02:38:24,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:24,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648458191] [2020-11-30 02:38:24,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:24,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 02:38:24,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:24,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:24,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:24,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:24,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648458191] [2020-11-30 02:38:24,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:24,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-11-30 02:38:24,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809613594] [2020-11-30 02:38:24,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:38:24,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:24,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:38:24,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:38:24,444 INFO L87 Difference]: Start difference. First operand 693 states and 881 transitions. Second operand 3 states. [2020-11-30 02:38:24,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:24,585 INFO L93 Difference]: Finished difference Result 1343 states and 1760 transitions. [2020-11-30 02:38:24,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:38:24,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2020-11-30 02:38:24,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:24,590 INFO L225 Difference]: With dead ends: 1343 [2020-11-30 02:38:24,590 INFO L226 Difference]: Without dead ends: 819 [2020-11-30 02:38:24,591 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:38:24,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2020-11-30 02:38:24,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 689. [2020-11-30 02:38:24,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2020-11-30 02:38:24,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 874 transitions. [2020-11-30 02:38:24,678 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 874 transitions. Word has length 83 [2020-11-30 02:38:24,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:24,679 INFO L481 AbstractCegarLoop]: Abstraction has 689 states and 874 transitions. [2020-11-30 02:38:24,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:38:24,679 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 874 transitions. [2020-11-30 02:38:24,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-11-30 02:38:24,680 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:24,680 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:24,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2020-11-30 02:38:24,893 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:24,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:24,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1680315765, now seen corresponding path program 1 times [2020-11-30 02:38:24,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:24,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826181410] [2020-11-30 02:38:24,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:25,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 02:38:25,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:25,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:25,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:25,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:25,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [826181410] [2020-11-30 02:38:25,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:25,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2020-11-30 02:38:25,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866379347] [2020-11-30 02:38:25,152 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:38:25,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:25,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:38:25,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:38:25,153 INFO L87 Difference]: Start difference. First operand 689 states and 874 transitions. Second operand 6 states. [2020-11-30 02:38:25,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:25,497 INFO L93 Difference]: Finished difference Result 2088 states and 2776 transitions. [2020-11-30 02:38:25,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 02:38:25,498 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2020-11-30 02:38:25,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:25,504 INFO L225 Difference]: With dead ends: 2088 [2020-11-30 02:38:25,505 INFO L226 Difference]: Without dead ends: 1568 [2020-11-30 02:38:25,506 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 160 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-11-30 02:38:25,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2020-11-30 02:38:25,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 683. [2020-11-30 02:38:25,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2020-11-30 02:38:25,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 868 transitions. [2020-11-30 02:38:25,629 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 868 transitions. Word has length 83 [2020-11-30 02:38:25,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:25,629 INFO L481 AbstractCegarLoop]: Abstraction has 683 states and 868 transitions. [2020-11-30 02:38:25,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:38:25,629 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 868 transitions. [2020-11-30 02:38:25,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-11-30 02:38:25,631 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:25,631 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:25,837 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2020-11-30 02:38:25,838 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:25,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:25,838 INFO L82 PathProgramCache]: Analyzing trace with hash -246180747, now seen corresponding path program 1 times [2020-11-30 02:38:25,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:25,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [376998759] [2020-11-30 02:38:25,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:26,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 02:38:26,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:26,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:26,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:26,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:26,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [376998759] [2020-11-30 02:38:26,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:26,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-11-30 02:38:26,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923968787] [2020-11-30 02:38:26,097 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:38:26,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:26,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:38:26,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:38:26,098 INFO L87 Difference]: Start difference. First operand 683 states and 868 transitions. Second operand 6 states. [2020-11-30 02:38:26,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:26,432 INFO L93 Difference]: Finished difference Result 1226 states and 1597 transitions. [2020-11-30 02:38:26,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 02:38:26,433 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2020-11-30 02:38:26,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:26,440 INFO L225 Difference]: With dead ends: 1226 [2020-11-30 02:38:26,440 INFO L226 Difference]: Without dead ends: 1224 [2020-11-30 02:38:26,441 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-11-30 02:38:26,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-11-30 02:38:26,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 685. [2020-11-30 02:38:26,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2020-11-30 02:38:26,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 870 transitions. [2020-11-30 02:38:26,546 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 870 transitions. Word has length 87 [2020-11-30 02:38:26,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:26,546 INFO L481 AbstractCegarLoop]: Abstraction has 685 states and 870 transitions. [2020-11-30 02:38:26,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:38:26,547 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 870 transitions. [2020-11-30 02:38:26,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-30 02:38:26,548 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:26,548 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:26,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2020-11-30 02:38:26,763 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:26,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:26,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1488770823, now seen corresponding path program 1 times [2020-11-30 02:38:26,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:26,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1839895040] [2020-11-30 02:38:26,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:26,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 02:38:26,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:27,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:27,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:27,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:27,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1839895040] [2020-11-30 02:38:27,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:27,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2020-11-30 02:38:27,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824994696] [2020-11-30 02:38:27,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 02:38:27,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:27,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 02:38:27,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-30 02:38:27,114 INFO L87 Difference]: Start difference. First operand 685 states and 870 transitions. Second operand 10 states. [2020-11-30 02:38:27,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:27,430 INFO L93 Difference]: Finished difference Result 1596 states and 2129 transitions. [2020-11-30 02:38:27,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 02:38:27,431 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2020-11-30 02:38:27,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:27,435 INFO L225 Difference]: With dead ends: 1596 [2020-11-30 02:38:27,435 INFO L226 Difference]: Without dead ends: 1074 [2020-11-30 02:38:27,436 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2020-11-30 02:38:27,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2020-11-30 02:38:27,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 691. [2020-11-30 02:38:27,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2020-11-30 02:38:27,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 876 transitions. [2020-11-30 02:38:27,522 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 876 transitions. Word has length 88 [2020-11-30 02:38:27,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:27,523 INFO L481 AbstractCegarLoop]: Abstraction has 691 states and 876 transitions. [2020-11-30 02:38:27,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 02:38:27,523 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 876 transitions. [2020-11-30 02:38:27,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-11-30 02:38:27,526 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:27,526 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:27,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2020-11-30 02:38:27,739 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:27,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:27,739 INFO L82 PathProgramCache]: Analyzing trace with hash 712612490, now seen corresponding path program 1 times [2020-11-30 02:38:27,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:27,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1414825860] [2020-11-30 02:38:27,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:28,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-30 02:38:28,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:28,197 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:28,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:28,484 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:28,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1414825860] [2020-11-30 02:38:28,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1556177243] [2020-11-30 02:38:28,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/cvc4 Starting monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 02:38:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:28,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-30 02:38:28,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:28,923 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:28,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:29,038 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:29,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689971200] [2020-11-30 02:38:29,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:38:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:29,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-30 02:38:29,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:29,316 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:29,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:29,397 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:29,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-11-30 02:38:29,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9, 9] total 17 [2020-11-30 02:38:29,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678794368] [2020-11-30 02:38:29,398 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-30 02:38:29,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:29,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-30 02:38:29,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2020-11-30 02:38:29,399 INFO L87 Difference]: Start difference. First operand 691 states and 876 transitions. Second operand 18 states. [2020-11-30 02:38:32,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:32,103 INFO L93 Difference]: Finished difference Result 2551 states and 3324 transitions. [2020-11-30 02:38:32,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2020-11-30 02:38:32,103 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 138 [2020-11-30 02:38:32,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:32,112 INFO L225 Difference]: With dead ends: 2551 [2020-11-30 02:38:32,112 INFO L226 Difference]: Without dead ends: 2029 [2020-11-30 02:38:32,115 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 797 SyntacticMatches, 9 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=709, Invalid=2831, Unknown=0, NotChecked=0, Total=3540 [2020-11-30 02:38:32,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2020-11-30 02:38:32,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1015. [2020-11-30 02:38:32,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2020-11-30 02:38:32,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1292 transitions. [2020-11-30 02:38:32,256 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1292 transitions. Word has length 138 [2020-11-30 02:38:32,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:32,256 INFO L481 AbstractCegarLoop]: Abstraction has 1015 states and 1292 transitions. [2020-11-30 02:38:32,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-30 02:38:32,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1292 transitions. [2020-11-30 02:38:32,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-11-30 02:38:32,258 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:32,258 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-11-30 02:38:32,859 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,30 mathsat -unsat_core_generation=3,31 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 02:38:32,859 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:32,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:32,860 INFO L82 PathProgramCache]: Analyzing trace with hash -307547104, now seen corresponding path program 1 times [2020-11-30 02:38:32,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:32,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1797935987] [2020-11-30 02:38:32,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 33 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:33,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-30 02:38:33,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:33,304 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 28 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:33,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:33,576 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 28 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:33,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1797935987] [2020-11-30 02:38:33,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1332399235] [2020-11-30 02:38:33,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/cvc4 Starting monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 02:38:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:33,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-30 02:38:33,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:33,940 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 28 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:33,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:34,024 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 28 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:34,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769556726] [2020-11-30 02:38:34,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:38:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:34,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-30 02:38:34,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:34,307 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 28 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:34,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:34,362 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 28 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:34,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-11-30 02:38:34,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9, 9] total 17 [2020-11-30 02:38:34,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367991212] [2020-11-30 02:38:34,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-30 02:38:34,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:34,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-30 02:38:34,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2020-11-30 02:38:34,364 INFO L87 Difference]: Start difference. First operand 1015 states and 1292 transitions. Second operand 18 states. [2020-11-30 02:38:37,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:37,562 INFO L93 Difference]: Finished difference Result 3889 states and 5085 transitions. [2020-11-30 02:38:37,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2020-11-30 02:38:37,563 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 139 [2020-11-30 02:38:37,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:37,578 INFO L225 Difference]: With dead ends: 3889 [2020-11-30 02:38:37,578 INFO L226 Difference]: Without dead ends: 3112 [2020-11-30 02:38:37,581 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 874 GetRequests, 801 SyntacticMatches, 11 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=757, Invalid=3275, Unknown=0, NotChecked=0, Total=4032 [2020-11-30 02:38:37,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3112 states. [2020-11-30 02:38:37,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3112 to 1538. [2020-11-30 02:38:37,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2020-11-30 02:38:37,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 1970 transitions. [2020-11-30 02:38:37,837 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 1970 transitions. Word has length 139 [2020-11-30 02:38:37,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:37,837 INFO L481 AbstractCegarLoop]: Abstraction has 1538 states and 1970 transitions. [2020-11-30 02:38:37,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-30 02:38:37,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 1970 transitions. [2020-11-30 02:38:37,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-11-30 02:38:37,841 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:37,841 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:38,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,34 cvc4 --incremental --print-success --lang smt --rewrite-divk,33 mathsat -unsat_core_generation=3 [2020-11-30 02:38:38,468 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:38,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:38,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1935910309, now seen corresponding path program 1 times [2020-11-30 02:38:38,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:38,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219541556] [2020-11-30 02:38:38,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 36 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:38,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 02:38:38,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:38,817 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:38,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:38,942 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:38,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219541556] [2020-11-30 02:38:38,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [778015830] [2020-11-30 02:38:38,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/cvc4 Starting monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 02:38:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:39,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 02:38:39,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:39,346 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:39,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:39,427 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:39,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715090286] [2020-11-30 02:38:39,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:38:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:39,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 02:38:39,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:39,659 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:39,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:39,709 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:39,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-11-30 02:38:39,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 11 [2020-11-30 02:38:39,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416920223] [2020-11-30 02:38:39,711 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-30 02:38:39,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:39,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-30 02:38:39,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-11-30 02:38:39,711 INFO L87 Difference]: Start difference. First operand 1538 states and 1970 transitions. Second operand 12 states. [2020-11-30 02:38:41,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:41,571 INFO L93 Difference]: Finished difference Result 5779 states and 7658 transitions. [2020-11-30 02:38:41,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-30 02:38:41,572 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 140 [2020-11-30 02:38:41,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:41,582 INFO L225 Difference]: With dead ends: 5779 [2020-11-30 02:38:41,583 INFO L226 Difference]: Without dead ends: 4573 [2020-11-30 02:38:41,586 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 815 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=251, Invalid=619, Unknown=0, NotChecked=0, Total=870 [2020-11-30 02:38:41,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4573 states. [2020-11-30 02:38:41,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4573 to 1831. [2020-11-30 02:38:41,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1831 states. [2020-11-30 02:38:41,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1831 states and 2373 transitions. [2020-11-30 02:38:41,943 INFO L78 Accepts]: Start accepts. Automaton has 1831 states and 2373 transitions. Word has length 140 [2020-11-30 02:38:41,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:41,944 INFO L481 AbstractCegarLoop]: Abstraction has 1831 states and 2373 transitions. [2020-11-30 02:38:41,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-30 02:38:41,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 2373 transitions. [2020-11-30 02:38:41,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-11-30 02:38:41,947 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:41,948 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:42,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 cvc4 --incremental --print-success --lang smt --rewrite-divk,36 mathsat -unsat_core_generation=3 [2020-11-30 02:38:42,553 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:42,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:42,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1877064855, now seen corresponding path program 1 times [2020-11-30 02:38:42,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:42,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2002417410] [2020-11-30 02:38:42,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 39 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:42,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 02:38:42,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:42,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:43,079 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:43,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2002417410] [2020-11-30 02:38:43,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1513974445] [2020-11-30 02:38:43,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/cvc4 Starting monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 02:38:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:43,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 02:38:43,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:43,523 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-11-30 02:38:43,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:43,599 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-11-30 02:38:43,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 2 imperfect interpolant sequences. [2020-11-30 02:38:43,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7, 7] total 16 [2020-11-30 02:38:43,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395169504] [2020-11-30 02:38:43,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:38:43,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:43,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:38:43,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2020-11-30 02:38:43,602 INFO L87 Difference]: Start difference. First operand 1831 states and 2373 transitions. Second operand 6 states. [2020-11-30 02:38:45,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:45,192 INFO L93 Difference]: Finished difference Result 9002 states and 12023 transitions. [2020-11-30 02:38:45,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-30 02:38:45,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2020-11-30 02:38:45,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:45,206 INFO L225 Difference]: With dead ends: 9002 [2020-11-30 02:38:45,206 INFO L226 Difference]: Without dead ends: 7503 [2020-11-30 02:38:45,208 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 547 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2020-11-30 02:38:45,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7503 states. [2020-11-30 02:38:45,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7503 to 2250. [2020-11-30 02:38:45,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2250 states. [2020-11-30 02:38:45,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 2860 transitions. [2020-11-30 02:38:45,565 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 2860 transitions. Word has length 141 [2020-11-30 02:38:45,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:45,565 INFO L481 AbstractCegarLoop]: Abstraction has 2250 states and 2860 transitions. [2020-11-30 02:38:45,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:38:45,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 2860 transitions. [2020-11-30 02:38:45,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-11-30 02:38:45,570 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:45,571 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:45,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 mathsat -unsat_core_generation=3,40 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 02:38:45,984 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:45,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:45,985 INFO L82 PathProgramCache]: Analyzing trace with hash -586203921, now seen corresponding path program 1 times [2020-11-30 02:38:45,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:45,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994636074] [2020-11-30 02:38:45,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 41 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:46,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 02:38:46,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:46,341 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-30 02:38:46,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:46,379 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-30 02:38:46,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994636074] [2020-11-30 02:38:46,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:46,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2020-11-30 02:38:46,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483980729] [2020-11-30 02:38:46,380 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:38:46,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:46,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:38:46,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:38:46,381 INFO L87 Difference]: Start difference. First operand 2250 states and 2860 transitions. Second operand 6 states. [2020-11-30 02:38:47,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:47,260 INFO L93 Difference]: Finished difference Result 6428 states and 8346 transitions. [2020-11-30 02:38:47,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 02:38:47,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2020-11-30 02:38:47,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:47,270 INFO L225 Difference]: With dead ends: 6428 [2020-11-30 02:38:47,271 INFO L226 Difference]: Without dead ends: 4490 [2020-11-30 02:38:47,274 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 276 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-11-30 02:38:47,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2020-11-30 02:38:47,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 2250. [2020-11-30 02:38:47,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2250 states. [2020-11-30 02:38:47,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 2858 transitions. [2020-11-30 02:38:47,767 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 2858 transitions. Word has length 141 [2020-11-30 02:38:47,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:47,767 INFO L481 AbstractCegarLoop]: Abstraction has 2250 states and 2858 transitions. [2020-11-30 02:38:47,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:38:47,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 2858 transitions. [2020-11-30 02:38:47,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-11-30 02:38:47,772 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:47,773 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:47,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 mathsat -unsat_core_generation=3 [2020-11-30 02:38:47,988 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:38:47,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:47,988 INFO L82 PathProgramCache]: Analyzing trace with hash 583046840, now seen corresponding path program 1 times [2020-11-30 02:38:47,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:47,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226362531] [2020-11-30 02:38:47,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/mathsat Starting monitored process 42 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 02:38:48,269 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 02:38:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 02:38:48,455 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 02:38:48,848 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-11-30 02:38:48,848 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 02:38:49,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 mathsat -unsat_core_generation=3 [2020-11-30 02:38:49,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 02:38:49 BoogieIcfgContainer [2020-11-30 02:38:49,338 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 02:38:49,338 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 02:38:49,338 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 02:38:49,339 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 02:38:49,339 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:38:04" (3/4) ... [2020-11-30 02:38:49,341 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 02:38:49,602 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c3271ce7-c64c-42b1-a529-bdb33e822d24/bin/utaipan/witness.graphml [2020-11-30 02:38:49,603 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 02:38:49,604 INFO L168 Benchmark]: Toolchain (without parser) took 48093.34 ms. Allocated memory was 77.6 MB in the beginning and 861.9 MB in the end (delta: 784.3 MB). Free memory was 55.5 MB in the beginning and 657.9 MB in the end (delta: -602.5 MB). Peak memory consumption was 182.4 MB. Max. memory is 16.1 GB. [2020-11-30 02:38:49,605 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 54.5 MB. Free memory is still 35.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 02:38:49,605 INFO L168 Benchmark]: CACSL2BoogieTranslator took 456.73 ms. Allocated memory is still 77.6 MB. Free memory was 55.3 MB in the beginning and 55.0 MB in the end (delta: 318.2 kB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-11-30 02:38:49,606 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.79 ms. Allocated memory is still 77.6 MB. Free memory was 55.0 MB in the beginning and 50.5 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 02:38:49,606 INFO L168 Benchmark]: Boogie Preprocessor took 61.53 ms. Allocated memory is still 77.6 MB. Free memory was 50.5 MB in the beginning and 46.7 MB in the end (delta: 3.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 02:38:49,606 INFO L168 Benchmark]: RCFGBuilder took 1937.31 ms. Allocated memory was 77.6 MB in the beginning and 104.9 MB in the end (delta: 27.3 MB). Free memory was 46.7 MB in the beginning and 69.5 MB in the end (delta: -22.8 MB). Peak memory consumption was 34.6 MB. Max. memory is 16.1 GB. [2020-11-30 02:38:49,607 INFO L168 Benchmark]: TraceAbstraction took 45292.93 ms. Allocated memory was 104.9 MB in the beginning and 861.9 MB in the end (delta: 757.1 MB). Free memory was 68.8 MB in the beginning and 702.8 MB in the end (delta: -634.0 MB). Peak memory consumption was 123.5 MB. Max. memory is 16.1 GB. [2020-11-30 02:38:49,609 INFO L168 Benchmark]: Witness Printer took 264.43 ms. Allocated memory is still 861.9 MB. Free memory was 702.8 MB in the beginning and 657.9 MB in the end (delta: 44.9 MB). Peak memory consumption was 46.1 MB. Max. memory is 16.1 GB. [2020-11-30 02:38:49,611 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 54.5 MB. Free memory is still 35.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 456.73 ms. Allocated memory is still 77.6 MB. Free memory was 55.3 MB in the beginning and 55.0 MB in the end (delta: 318.2 kB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 73.79 ms. Allocated memory is still 77.6 MB. Free memory was 55.0 MB in the beginning and 50.5 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 61.53 ms. Allocated memory is still 77.6 MB. Free memory was 50.5 MB in the beginning and 46.7 MB in the end (delta: 3.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1937.31 ms. Allocated memory was 77.6 MB in the beginning and 104.9 MB in the end (delta: 27.3 MB). Free memory was 46.7 MB in the beginning and 69.5 MB in the end (delta: -22.8 MB). Peak memory consumption was 34.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 45292.93 ms. Allocated memory was 104.9 MB in the beginning and 861.9 MB in the end (delta: 757.1 MB). Free memory was 68.8 MB in the beginning and 702.8 MB in the end (delta: -634.0 MB). Peak memory consumption was 123.5 MB. Max. memory is 16.1 GB. * Witness Printer took 264.43 ms. Allocated memory is still 861.9 MB. Free memory was 702.8 MB in the beginning and 657.9 MB in the end (delta: 44.9 MB). Peak memory consumption was 46.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L534] int c1 ; [L535] int i2 ; [L538] c1 = 0 [L539] side1Failed = __VERIFIER_nondet_bool() [L540] side2Failed = __VERIFIER_nondet_bool() [L541] side1_written = __VERIFIER_nondet_char() [L542] side2_written = __VERIFIER_nondet_char() [L543] side1Failed_History_0 = __VERIFIER_nondet_bool() [L544] side1Failed_History_1 = __VERIFIER_nondet_bool() [L545] side1Failed_History_2 = __VERIFIER_nondet_bool() [L546] side2Failed_History_0 = __VERIFIER_nondet_bool() [L547] side2Failed_History_1 = __VERIFIER_nondet_bool() [L548] side2Failed_History_2 = __VERIFIER_nondet_bool() [L549] active_side_History_0 = __VERIFIER_nondet_char() [L550] active_side_History_1 = __VERIFIER_nondet_char() [L551] active_side_History_2 = __VERIFIER_nondet_char() [L552] manual_selection_History_0 = __VERIFIER_nondet_char() [L553] manual_selection_History_1 = __VERIFIER_nondet_char() [L554] manual_selection_History_2 = __VERIFIER_nondet_char() [L197] COND FALSE !((int )side1Failed_History_0 != 0) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L200] COND FALSE !((int )side2Failed_History_0 != 0) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L203] COND FALSE !((int )active_side_History_0 != -2) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L206] COND FALSE !((int )manual_selection_History_0 != 0) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L209] COND FALSE !((int )side1Failed_History_1 != 0) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L212] COND FALSE !((int )side2Failed_History_1 != 0) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L215] COND FALSE !((int )active_side_History_1 != -2) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L218] COND FALSE !((int )manual_selection_History_1 != 0) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L221] COND FALSE !((int )side1Failed_History_2 != 0) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L224] COND FALSE !((int )side2Failed_History_2 != 0) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L227] COND FALSE !((int )active_side_History_2 != -2) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L555] i2 = init() [L58] COND FALSE !(!cond) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L557] cs1_old = nomsg [L558] cs1_new = nomsg [L559] cs2_old = nomsg [L560] cs2_new = nomsg [L561] s1s2_old = nomsg [L562] s1s2_new = nomsg [L563] s1s1_old = nomsg [L564] s1s1_new = nomsg [L565] s2s1_old = nomsg [L566] s2s1_new = nomsg [L567] s2s2_old = nomsg [L568] s2s2_new = nomsg [L569] s1p_old = nomsg [L570] s1p_new = nomsg [L571] s2p_old = nomsg [L572] s2p_new = nomsg [L573] i2 = 0 VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=255, cs2=0, cs2_new=255, cs2_old=255, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L574] COND TRUE i2 < 10 [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=255, cs2=0, cs2_new=255, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=255, cs2=0, cs2_new=255, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=255, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=6, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L277] COND TRUE \read(side1Failed) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=6, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] EXPR nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=6, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] EXPR nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=6, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] EXPR nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=6, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = nomsg VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )0 VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L394] COND FALSE !((int )side1 == 1) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L397] COND FALSE !((int )side2 == 1) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L400] COND FALSE !((int )side1 == 0) [L407] active_side = (int8_t )0 VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L580] cs1_old = cs1_new [L581] cs1_new = nomsg [L582] cs2_old = cs2_new [L583] cs2_new = nomsg [L584] s1s2_old = s1s2_new [L585] s1s2_new = nomsg [L586] s1s1_old = s1s1_new [L587] s1s1_new = nomsg [L588] s2s1_old = s2s1_new [L589] s2s1_new = nomsg [L590] s2s2_old = s2s2_new [L591] s2s2_new = nomsg [L592] s1p_old = s1p_new [L593] s1p_new = nomsg [L594] s2p_old = s2p_new [L595] s2p_new = nomsg [L415] int tmp ; [L416] msg_t tmp___0 ; [L417] _Bool tmp___1 ; [L418] _Bool tmp___2 ; [L419] _Bool tmp___3 ; [L420] _Bool tmp___4 ; [L421] int8_t tmp___5 ; [L422] _Bool tmp___6 ; [L423] _Bool tmp___7 ; [L424] _Bool tmp___8 ; [L425] int8_t tmp___9 ; [L426] _Bool tmp___10 ; [L427] _Bool tmp___11 ; [L428] _Bool tmp___12 ; [L429] msg_t tmp___13 ; [L430] _Bool tmp___14 ; [L431] _Bool tmp___15 ; [L432] _Bool tmp___16 ; [L433] _Bool tmp___17 ; [L434] int8_t tmp___18 ; [L435] int8_t tmp___19 ; [L436] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L439] COND FALSE !(! side1Failed) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L442] COND TRUE ! side2Failed [L443] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L448] tmp___0 = read_manual_selection_history((unsigned char)1) [L449] COND TRUE ! tmp___0 [L88] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L450] tmp___1 = read_side1_failed_history((unsigned char)1) [L451] COND TRUE ! tmp___1 [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L452] tmp___2 = read_side1_failed_history((unsigned char)0) [L453] COND FALSE !(! tmp___2) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L478] tmp___7 = read_side1_failed_history((unsigned char)1) [L479] COND FALSE !(\read(tmp___7)) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L494] tmp___11 = read_side1_failed_history((unsigned char)1) [L495] COND TRUE ! tmp___11 [L118] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L496] tmp___12 = read_side2_failed_history((unsigned char)1) [L497] COND FALSE !(\read(tmp___12)) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L151] COND FALSE !((int )index == 1) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L154] COND TRUE (int )index == 2 [L155] return (active_side_History_2); VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L510] tmp___20 = read_active_side_history((unsigned char)2) [L511] COND FALSE !((int )tmp___20 > -2) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L529] return (1); VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L596] c1 = check() [L609] COND FALSE !(! arg) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L598] i2 ++ VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L574] COND TRUE i2 < 10 [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L277] COND FALSE !(\read(side1Failed)) [L284] side1 = s1s1_old [L285] s1s1_old = nomsg [L286] side2 = s2s1_old [L287] s2s1_old = nomsg [L288] manual_selection = cs1_old [L289] cs1_old = nomsg VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L290] COND FALSE !((int )side1 == (int )side2) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L293] COND TRUE (int )side1 == (int )nomsg VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L294] COND TRUE (int )side2 != (int )nomsg [L295] next_state = (int8_t )0 VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L314] EXPR next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L314] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L315] EXPR next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L315] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L316] EXPR next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L316] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L317] side1_written = next_state VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L334] COND TRUE \read(side2Failed) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L335] EXPR nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L335] s2s1_new = nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new [L336] EXPR nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L336] s2s2_new = nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new [L337] EXPR nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L337] s2p_new = nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new [L338] side2_written = nomsg VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L394] COND FALSE !((int )side1 == 1) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L397] COND FALSE !((int )side2 == 1) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L400] COND FALSE !((int )side1 == 0) [L407] active_side = (int8_t )0 VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=255, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=255, s1s1=0, s1s1_new=0, s1s1_old=255, s1s2=0, s1s2_new=0, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L580] cs1_old = cs1_new [L581] cs1_new = nomsg [L582] cs2_old = cs2_new [L583] cs2_new = nomsg [L584] s1s2_old = s1s2_new [L585] s1s2_new = nomsg [L586] s1s1_old = s1s1_new [L587] s1s1_new = nomsg [L588] s2s1_old = s2s1_new [L589] s2s1_new = nomsg [L590] s2s2_old = s2s2_new [L591] s2s2_new = nomsg [L592] s1p_old = s1p_new [L593] s1p_new = nomsg [L594] s2p_old = s2p_new [L595] s2p_new = nomsg [L415] int tmp ; [L416] msg_t tmp___0 ; [L417] _Bool tmp___1 ; [L418] _Bool tmp___2 ; [L419] _Bool tmp___3 ; [L420] _Bool tmp___4 ; [L421] int8_t tmp___5 ; [L422] _Bool tmp___6 ; [L423] _Bool tmp___7 ; [L424] _Bool tmp___8 ; [L425] int8_t tmp___9 ; [L426] _Bool tmp___10 ; [L427] _Bool tmp___11 ; [L428] _Bool tmp___12 ; [L429] msg_t tmp___13 ; [L430] _Bool tmp___14 ; [L431] _Bool tmp___15 ; [L432] _Bool tmp___16 ; [L433] _Bool tmp___17 ; [L434] int8_t tmp___18 ; [L435] int8_t tmp___19 ; [L436] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L439] COND TRUE ! side1Failed [L440] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L448] tmp___0 = read_manual_selection_history((unsigned char)1) [L449] COND FALSE !(! tmp___0) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L478] tmp___7 = read_side1_failed_history((unsigned char)1) [L479] COND TRUE \read(tmp___7) [L118] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L480] tmp___8 = read_side2_failed_history((unsigned char)1) [L481] COND TRUE ! tmp___8 [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L482] tmp___5 = read_active_side_history((unsigned char)0) [L483] COND TRUE ! ((int )tmp___5 == 2) [L484] return (0); VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L596] c1 = check() [L609] COND TRUE ! arg VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] [L3] __assert_fail("0", "pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c", 3, "reach_error") VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=0, s1s1=0, s1s1_new=255, s1s1_old=0, s1s2=0, s1s2_new=255, s1s2_old=0, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=255, side2Failed=128, side2Failed_History_0=128, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 318 locations, 23 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 44.9s, OverallIterations: 34, TraceHistogramMax: 2, AutomataDifference: 18.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 14215 SDtfs, 35893 SDslu, 39362 SDs, 0 SdLazy, 5333 SolverSat, 506 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7246 GetRequests, 6846 SyntacticMatches, 54 SemanticMatches, 346 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2370 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2250occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 33 MinimizatonAttempts, 23075 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2.4s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 3690 NumberOfCodeBlocks, 3690 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 7016 ConstructedInterpolants, 0 QuantifiedInterpolants, 2587719 SizeOfPredicates, 121 NumberOfNonLiveVariables, 11655 ConjunctsInSsa, 228 ConjunctsInUnsatCore, 80 InterpolantComputations, 60 PerfectInterpolantSequences, 608/834 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...