./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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 bc86cc3add356b600fcf92e092d72b9013e4f56a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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 bc86cc3add356b600fcf92e092d72b9013e4f56a ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:05:08,382 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 02:05:08,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 02:05:08,479 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 02:05:08,480 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 02:05:08,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 02:05:08,488 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 02:05:08,497 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 02:05:08,500 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 02:05:08,507 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 02:05:08,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 02:05:08,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 02:05:08,510 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 02:05:08,512 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 02:05:08,513 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 02:05:08,514 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 02:05:08,515 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 02:05:08,517 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 02:05:08,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 02:05:08,530 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 02:05:08,532 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 02:05:08,534 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 02:05:08,540 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 02:05:08,542 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 02:05:08,547 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 02:05:08,547 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 02:05:08,548 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 02:05:08,550 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 02:05:08,551 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 02:05:08,552 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 02:05:08,552 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 02:05:08,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 02:05:08,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 02:05:08,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 02:05:08,559 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 02:05:08,559 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 02:05:08,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 02:05:08,560 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 02:05:08,560 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 02:05:08,561 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 02:05:08,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 02:05:08,563 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-30 02:05:08,608 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 02:05:08,608 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 02:05:08,610 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 02:05:08,610 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 02:05:08,610 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 02:05:08,610 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 02:05:08,611 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-30 02:05:08,611 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 02:05:08,611 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 02:05:08,611 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-30 02:05:08,612 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-30 02:05:08,613 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 02:05:08,613 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-30 02:05:08,613 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-30 02:05:08,613 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-30 02:05:08,614 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 02:05:08,614 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 02:05:08,614 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 02:05:08,615 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 02:05:08,615 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 02:05:08,615 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 02:05:08,615 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 02:05:08,615 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 02:05:08,616 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 02:05:08,616 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 02:05:08,616 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 02:05:08,616 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 02:05:08,617 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 02:05:08,617 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 02:05:08,617 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 02:05:08,617 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 02:05:08,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 02:05:08,618 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 02:05:08,618 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 02:05:08,618 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 02:05:08,619 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-30 02:05:08,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 02:05:08,619 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 02:05:08,619 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 02:05:08,619 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 02:05:08,620 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_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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 -> bc86cc3add356b600fcf92e092d72b9013e4f56a [2020-11-30 02:05:08,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 02:05:08,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 02:05:08,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 02:05:08,920 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 02:05:08,920 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 02:05:08,921 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/bin/utaipan/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2020-11-30 02:05:09,004 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/bin/utaipan/data/36e9e4b2c/49a74ebaecfb4b18a64b8f563898f537/FLAG8d07f284f [2020-11-30 02:05:09,528 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 02:05:09,529 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2020-11-30 02:05:09,551 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/bin/utaipan/data/36e9e4b2c/49a74ebaecfb4b18a64b8f563898f537/FLAG8d07f284f [2020-11-30 02:05:09,825 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/bin/utaipan/data/36e9e4b2c/49a74ebaecfb4b18a64b8f563898f537 [2020-11-30 02:05:09,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 02:05:09,828 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 02:05:09,831 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 02:05:09,831 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 02:05:09,834 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 02:05:09,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:05:09" (1/1) ... [2020-11-30 02:05:09,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33213332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:05:09, skipping insertion in model container [2020-11-30 02:05:09,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:05:09" (1/1) ... [2020-11-30 02:05:09,845 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 02:05:09,882 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 02:05:10,131 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:05:10,141 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 02:05:10,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:05:10,232 INFO L208 MainTranslator]: Completed translation [2020-11-30 02:05:10,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:05:10 WrapperNode [2020-11-30 02:05:10,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 02:05:10,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 02:05:10,234 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 02:05:10,234 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 02:05:10,241 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:05:10" (1/1) ... [2020-11-30 02:05:10,255 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:05:10" (1/1) ... [2020-11-30 02:05:10,328 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 02:05:10,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 02:05:10,329 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 02:05:10,329 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 02:05:10,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:05:10" (1/1) ... [2020-11-30 02:05:10,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:05:10" (1/1) ... [2020-11-30 02:05:10,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:05:10" (1/1) ... [2020-11-30 02:05:10,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:05:10" (1/1) ... [2020-11-30 02:05:10,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:05:10" (1/1) ... [2020-11-30 02:05:10,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:05:10" (1/1) ... [2020-11-30 02:05:10,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:05:10" (1/1) ... [2020-11-30 02:05:10,427 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 02:05:10,428 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 02:05:10,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 02:05:10,429 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 02:05:10,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:05:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:05:10,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 02:05:10,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 02:05:10,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 02:05:10,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 02:05:12,732 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 02:05:12,733 INFO L298 CfgBuilder]: Removed 169 assume(true) statements. [2020-11-30 02:05:12,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:05:12 BoogieIcfgContainer [2020-11-30 02:05:12,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 02:05:12,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 02:05:12,737 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 02:05:12,741 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 02:05:12,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 02:05:09" (1/3) ... [2020-11-30 02:05:12,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da08af6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:05:12, skipping insertion in model container [2020-11-30 02:05:12,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:05:10" (2/3) ... [2020-11-30 02:05:12,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da08af6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:05:12, skipping insertion in model container [2020-11-30 02:05:12,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:05:12" (3/3) ... [2020-11-30 02:05:12,746 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2020-11-30 02:05:12,778 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 02:05:12,783 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2020-11-30 02:05:12,794 INFO L253 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2020-11-30 02:05:12,833 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 02:05:12,833 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 02:05:12,834 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 02:05:12,834 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 02:05:12,834 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 02:05:12,834 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 02:05:12,834 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 02:05:12,834 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 02:05:12,859 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states. [2020-11-30 02:05:12,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-30 02:05:12,867 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:05:12,868 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:05:12,868 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:05:12,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:05:12,874 INFO L82 PathProgramCache]: Analyzing trace with hash -929909247, now seen corresponding path program 1 times [2020-11-30 02:05:12,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:05:12,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101339249] [2020-11-30 02:05:12,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:05:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:05:13,259 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:05:13,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101339249] [2020-11-30 02:05:13,260 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:05:13,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:05:13,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068092834] [2020-11-30 02:05:13,265 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:05:13,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:05:13,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:05:13,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:05:13,288 INFO L87 Difference]: Start difference. First operand 231 states. Second operand 3 states. [2020-11-30 02:05:13,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:05:13,406 INFO L93 Difference]: Finished difference Result 460 states and 717 transitions. [2020-11-30 02:05:13,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:05:13,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-30 02:05:13,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:05:13,431 INFO L225 Difference]: With dead ends: 460 [2020-11-30 02:05:13,439 INFO L226 Difference]: Without dead ends: 230 [2020-11-30 02:05:13,443 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:05:13,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-11-30 02:05:13,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 206. [2020-11-30 02:05:13,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-11-30 02:05:13,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 298 transitions. [2020-11-30 02:05:13,525 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 298 transitions. Word has length 11 [2020-11-30 02:05:13,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:05:13,527 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 298 transitions. [2020-11-30 02:05:13,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:05:13,527 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 298 transitions. [2020-11-30 02:05:13,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-30 02:05:13,528 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:05:13,529 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:05:13,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 02:05:13,530 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:05:13,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:05:13,533 INFO L82 PathProgramCache]: Analyzing trace with hash -88860995, now seen corresponding path program 1 times [2020-11-30 02:05:13,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:05:13,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090343750] [2020-11-30 02:05:13,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:05:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:05:13,685 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:05:13,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090343750] [2020-11-30 02:05:13,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:05:13,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:05:13,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301047614] [2020-11-30 02:05:13,687 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:05:13,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:05:13,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:05:13,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:05:13,689 INFO L87 Difference]: Start difference. First operand 206 states and 298 transitions. Second operand 3 states. [2020-11-30 02:05:13,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:05:13,737 INFO L93 Difference]: Finished difference Result 432 states and 627 transitions. [2020-11-30 02:05:13,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:05:13,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-11-30 02:05:13,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:05:13,743 INFO L225 Difference]: With dead ends: 432 [2020-11-30 02:05:13,745 INFO L226 Difference]: Without dead ends: 227 [2020-11-30 02:05:13,747 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:05:13,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-11-30 02:05:13,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 201. [2020-11-30 02:05:13,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2020-11-30 02:05:13,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 290 transitions. [2020-11-30 02:05:13,770 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 290 transitions. Word has length 13 [2020-11-30 02:05:13,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:05:13,771 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 290 transitions. [2020-11-30 02:05:13,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:05:13,772 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 290 transitions. [2020-11-30 02:05:13,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-30 02:05:13,773 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:05:13,774 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:05:13,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 02:05:13,786 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:05:13,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:05:13,787 INFO L82 PathProgramCache]: Analyzing trace with hash -276485033, now seen corresponding path program 1 times [2020-11-30 02:05:13,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:05:13,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060249217] [2020-11-30 02:05:13,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:05:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:05:13,926 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:05:13,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060249217] [2020-11-30 02:05:13,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:05:13,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:05:13,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848876641] [2020-11-30 02:05:13,928 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:05:13,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:05:13,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:05:13,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:05:13,930 INFO L87 Difference]: Start difference. First operand 201 states and 290 transitions. Second operand 3 states. [2020-11-30 02:05:14,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:05:14,040 INFO L93 Difference]: Finished difference Result 431 states and 626 transitions. [2020-11-30 02:05:14,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:05:14,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-11-30 02:05:14,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:05:14,043 INFO L225 Difference]: With dead ends: 431 [2020-11-30 02:05:14,043 INFO L226 Difference]: Without dead ends: 231 [2020-11-30 02:05:14,044 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:05:14,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2020-11-30 02:05:14,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 181. [2020-11-30 02:05:14,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-11-30 02:05:14,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 258 transitions. [2020-11-30 02:05:14,062 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 258 transitions. Word has length 17 [2020-11-30 02:05:14,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:05:14,062 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 258 transitions. [2020-11-30 02:05:14,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:05:14,062 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 258 transitions. [2020-11-30 02:05:14,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-30 02:05:14,063 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:05:14,064 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:05:14,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 02:05:14,064 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:05:14,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:05:14,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1145892081, now seen corresponding path program 1 times [2020-11-30 02:05:14,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:05:14,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555895955] [2020-11-30 02:05:14,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:05:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:05:14,163 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:05:14,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555895955] [2020-11-30 02:05:14,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:05:14,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:05:14,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230560975] [2020-11-30 02:05:14,165 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:05:14,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:05:14,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:05:14,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:05:14,166 INFO L87 Difference]: Start difference. First operand 181 states and 258 transitions. Second operand 3 states. [2020-11-30 02:05:14,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:05:14,233 INFO L93 Difference]: Finished difference Result 399 states and 570 transitions. [2020-11-30 02:05:14,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:05:14,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-11-30 02:05:14,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:05:14,235 INFO L225 Difference]: With dead ends: 399 [2020-11-30 02:05:14,235 INFO L226 Difference]: Without dead ends: 219 [2020-11-30 02:05:14,236 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:05:14,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-11-30 02:05:14,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 169. [2020-11-30 02:05:14,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-11-30 02:05:14,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 240 transitions. [2020-11-30 02:05:14,243 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 240 transitions. Word has length 21 [2020-11-30 02:05:14,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:05:14,251 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 240 transitions. [2020-11-30 02:05:14,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:05:14,251 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 240 transitions. [2020-11-30 02:05:14,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 02:05:14,254 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:05:14,255 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:05:14,255 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 02:05:14,255 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:05:14,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:05:14,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1719672529, now seen corresponding path program 1 times [2020-11-30 02:05:14,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:05:14,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363892965] [2020-11-30 02:05:14,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:05:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:05:14,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:05:14,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363892965] [2020-11-30 02:05:14,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:05:14,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:05:14,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768148838] [2020-11-30 02:05:14,345 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:05:14,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:05:14,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:05:14,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:05:14,346 INFO L87 Difference]: Start difference. First operand 169 states and 240 transitions. Second operand 3 states. [2020-11-30 02:05:14,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:05:14,448 INFO L93 Difference]: Finished difference Result 395 states and 562 transitions. [2020-11-30 02:05:14,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:05:14,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-11-30 02:05:14,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:05:14,453 INFO L225 Difference]: With dead ends: 395 [2020-11-30 02:05:14,453 INFO L226 Difference]: Without dead ends: 227 [2020-11-30 02:05:14,454 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:05:14,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-11-30 02:05:14,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 149. [2020-11-30 02:05:14,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-11-30 02:05:14,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 208 transitions. [2020-11-30 02:05:14,464 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 208 transitions. Word has length 22 [2020-11-30 02:05:14,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:05:14,465 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 208 transitions. [2020-11-30 02:05:14,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:05:14,465 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 208 transitions. [2020-11-30 02:05:14,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-30 02:05:14,470 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:05:14,470 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:05:14,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 02:05:14,471 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:05:14,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:05:14,473 INFO L82 PathProgramCache]: Analyzing trace with hash -383744033, now seen corresponding path program 1 times [2020-11-30 02:05:14,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:05:14,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353471789] [2020-11-30 02:05:14,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:05:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:05:14,721 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:05:14,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353471789] [2020-11-30 02:05:14,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:05:14,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 02:05:14,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78491507] [2020-11-30 02:05:14,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:05:14,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:05:14,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:05:14,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:05:14,723 INFO L87 Difference]: Start difference. First operand 149 states and 208 transitions. Second operand 6 states. [2020-11-30 02:05:14,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:05:14,982 INFO L93 Difference]: Finished difference Result 584 states and 812 transitions. [2020-11-30 02:05:14,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 02:05:14,982 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-11-30 02:05:14,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:05:14,986 INFO L225 Difference]: With dead ends: 584 [2020-11-30 02:05:14,986 INFO L226 Difference]: Without dead ends: 436 [2020-11-30 02:05:14,987 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:05:14,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2020-11-30 02:05:14,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 203. [2020-11-30 02:05:14,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2020-11-30 02:05:14,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 289 transitions. [2020-11-30 02:05:15,000 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 289 transitions. Word has length 27 [2020-11-30 02:05:15,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:05:15,000 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 289 transitions. [2020-11-30 02:05:15,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:05:15,001 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 289 transitions. [2020-11-30 02:05:15,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 02:05:15,002 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:05:15,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] [2020-11-30 02:05:15,002 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 02:05:15,003 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:05:15,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:05:15,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1237529768, now seen corresponding path program 1 times [2020-11-30 02:05:15,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:05:15,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480654928] [2020-11-30 02:05:15,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:05:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:05:15,062 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:05:15,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480654928] [2020-11-30 02:05:15,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:05:15,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:05:15,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663151463] [2020-11-30 02:05:15,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:05:15,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:05:15,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:05:15,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:05:15,064 INFO L87 Difference]: Start difference. First operand 203 states and 289 transitions. Second operand 3 states. [2020-11-30 02:05:15,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:05:15,135 INFO L93 Difference]: Finished difference Result 371 states and 528 transitions. [2020-11-30 02:05:15,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:05:15,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-11-30 02:05:15,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:05:15,138 INFO L225 Difference]: With dead ends: 371 [2020-11-30 02:05:15,138 INFO L226 Difference]: Without dead ends: 223 [2020-11-30 02:05:15,139 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:05:15,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2020-11-30 02:05:15,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 199. [2020-11-30 02:05:15,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2020-11-30 02:05:15,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 282 transitions. [2020-11-30 02:05:15,148 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 282 transitions. Word has length 28 [2020-11-30 02:05:15,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:05:15,149 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 282 transitions. [2020-11-30 02:05:15,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:05:15,149 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 282 transitions. [2020-11-30 02:05:15,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 02:05:15,150 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:05:15,150 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:05:15,150 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 02:05:15,150 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:05:15,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:05:15,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1577197982, now seen corresponding path program 1 times [2020-11-30 02:05:15,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:05:15,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418658033] [2020-11-30 02:05:15,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:05:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:05:15,198 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:05:15,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418658033] [2020-11-30 02:05:15,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:05:15,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:05:15,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550962002] [2020-11-30 02:05:15,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:05:15,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:05:15,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:05:15,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:05:15,200 INFO L87 Difference]: Start difference. First operand 199 states and 282 transitions. Second operand 3 states. [2020-11-30 02:05:15,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:05:15,271 INFO L93 Difference]: Finished difference Result 423 states and 591 transitions. [2020-11-30 02:05:15,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:05:15,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-11-30 02:05:15,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:05:15,274 INFO L225 Difference]: With dead ends: 423 [2020-11-30 02:05:15,274 INFO L226 Difference]: Without dead ends: 262 [2020-11-30 02:05:15,275 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:05:15,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-11-30 02:05:15,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 183. [2020-11-30 02:05:15,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-11-30 02:05:15,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 256 transitions. [2020-11-30 02:05:15,285 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 256 transitions. Word has length 28 [2020-11-30 02:05:15,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:05:15,285 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 256 transitions. [2020-11-30 02:05:15,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:05:15,285 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 256 transitions. [2020-11-30 02:05:15,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-11-30 02:05:15,286 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:05:15,286 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:05:15,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 02:05:15,287 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:05:15,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:05:15,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1633229765, now seen corresponding path program 1 times [2020-11-30 02:05:15,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:05:15,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764133643] [2020-11-30 02:05:15,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:05:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:05:15,399 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:05:15,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764133643] [2020-11-30 02:05:15,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:05:15,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 02:05:15,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209465647] [2020-11-30 02:05:15,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:05:15,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:05:15,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:05:15,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:05:15,402 INFO L87 Difference]: Start difference. First operand 183 states and 256 transitions. Second operand 6 states. [2020-11-30 02:05:15,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:05:15,821 INFO L93 Difference]: Finished difference Result 808 states and 1104 transitions. [2020-11-30 02:05:15,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 02:05:15,822 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-11-30 02:05:15,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:05:15,827 INFO L225 Difference]: With dead ends: 808 [2020-11-30 02:05:15,827 INFO L226 Difference]: Without dead ends: 658 [2020-11-30 02:05:15,828 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:05:15,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2020-11-30 02:05:15,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 229. [2020-11-30 02:05:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2020-11-30 02:05:15,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 318 transitions. [2020-11-30 02:05:15,848 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 318 transitions. Word has length 31 [2020-11-30 02:05:15,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:05:15,848 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 318 transitions. [2020-11-30 02:05:15,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:05:15,849 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 318 transitions. [2020-11-30 02:05:15,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-30 02:05:15,850 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:05:15,850 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:05:15,850 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 02:05:15,850 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:05:15,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:05:15,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1317380623, now seen corresponding path program 1 times [2020-11-30 02:05:15,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:05:15,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860259710] [2020-11-30 02:05:15,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:05:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:05:15,930 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:05:15,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860259710] [2020-11-30 02:05:15,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:05:15,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 02:05:15,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737634848] [2020-11-30 02:05:15,931 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:05:15,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:05:15,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:05:15,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:05:15,932 INFO L87 Difference]: Start difference. First operand 229 states and 318 transitions. Second operand 4 states. [2020-11-30 02:05:16,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:05:16,063 INFO L93 Difference]: Finished difference Result 370 states and 517 transitions. [2020-11-30 02:05:16,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:05:16,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-11-30 02:05:16,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:05:16,066 INFO L225 Difference]: With dead ends: 370 [2020-11-30 02:05:16,066 INFO L226 Difference]: Without dead ends: 368 [2020-11-30 02:05:16,066 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:05:16,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2020-11-30 02:05:16,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 231. [2020-11-30 02:05:16,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2020-11-30 02:05:16,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 320 transitions. [2020-11-30 02:05:16,089 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 320 transitions. Word has length 32 [2020-11-30 02:05:16,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:05:16,089 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 320 transitions. [2020-11-30 02:05:16,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:05:16,089 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 320 transitions. [2020-11-30 02:05:16,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-30 02:05:16,092 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:05:16,092 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:05:16,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 02:05:16,093 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:05:16,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:05:16,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1586501112, now seen corresponding path program 1 times [2020-11-30 02:05:16,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:05:16,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044214901] [2020-11-30 02:05:16,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:05:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:05:16,440 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:05:16,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044214901] [2020-11-30 02:05:16,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:05:16,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-30 02:05:16,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791416181] [2020-11-30 02:05:16,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 02:05:16,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:05:16,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 02:05:16,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-30 02:05:16,442 INFO L87 Difference]: Start difference. First operand 231 states and 320 transitions. Second operand 10 states. [2020-11-30 02:05:17,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:05:17,375 INFO L93 Difference]: Finished difference Result 918 states and 1251 transitions. [2020-11-30 02:05:17,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-30 02:05:17,376 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2020-11-30 02:05:17,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:05:17,381 INFO L225 Difference]: With dead ends: 918 [2020-11-30 02:05:17,381 INFO L226 Difference]: Without dead ends: 761 [2020-11-30 02:05:17,382 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2020-11-30 02:05:17,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2020-11-30 02:05:17,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 240. [2020-11-30 02:05:17,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2020-11-30 02:05:17,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 330 transitions. [2020-11-30 02:05:17,408 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 330 transitions. Word has length 32 [2020-11-30 02:05:17,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:05:17,408 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 330 transitions. [2020-11-30 02:05:17,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 02:05:17,408 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 330 transitions. [2020-11-30 02:05:17,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-30 02:05:17,409 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:05:17,409 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:05:17,409 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 02:05:17,411 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:05:17,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:05:17,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1069042916, now seen corresponding path program 1 times [2020-11-30 02:05:17,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:05:17,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849023667] [2020-11-30 02:05:17,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:05:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:05:17,464 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:05:17,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849023667] [2020-11-30 02:05:17,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:05:17,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 02:05:17,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150258537] [2020-11-30 02:05:17,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:05:17,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:05:17,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:05:17,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:05:17,466 INFO L87 Difference]: Start difference. First operand 240 states and 330 transitions. Second operand 4 states. [2020-11-30 02:05:17,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:05:17,606 INFO L93 Difference]: Finished difference Result 707 states and 957 transitions. [2020-11-30 02:05:17,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:05:17,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-11-30 02:05:17,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:05:17,610 INFO L225 Difference]: With dead ends: 707 [2020-11-30 02:05:17,610 INFO L226 Difference]: Without dead ends: 531 [2020-11-30 02:05:17,611 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:05:17,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-11-30 02:05:17,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 340. [2020-11-30 02:05:17,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-11-30 02:05:17,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 461 transitions. [2020-11-30 02:05:17,653 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 461 transitions. Word has length 33 [2020-11-30 02:05:17,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:05:17,654 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 461 transitions. [2020-11-30 02:05:17,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:05:17,654 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 461 transitions. [2020-11-30 02:05:17,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-30 02:05:17,655 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:05:17,655 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:05:17,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 02:05:17,655 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:05:17,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:05:17,656 INFO L82 PathProgramCache]: Analyzing trace with hash -263008609, now seen corresponding path program 1 times [2020-11-30 02:05:17,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:05:17,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561049170] [2020-11-30 02:05:17,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:05:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:05:17,846 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:05:17,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561049170] [2020-11-30 02:05:17,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:05:17,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 02:05:17,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105945864] [2020-11-30 02:05:17,848 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 02:05:17,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:05:17,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 02:05:17,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:05:17,849 INFO L87 Difference]: Start difference. First operand 340 states and 461 transitions. Second operand 5 states. [2020-11-30 02:05:17,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:05:17,918 INFO L93 Difference]: Finished difference Result 612 states and 835 transitions. [2020-11-30 02:05:17,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 02:05:17,919 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-11-30 02:05:17,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:05:17,922 INFO L225 Difference]: With dead ends: 612 [2020-11-30 02:05:17,922 INFO L226 Difference]: Without dead ends: 389 [2020-11-30 02:05:17,923 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:05:17,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2020-11-30 02:05:17,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 336. [2020-11-30 02:05:17,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2020-11-30 02:05:17,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 454 transitions. [2020-11-30 02:05:17,955 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 454 transitions. Word has length 33 [2020-11-30 02:05:17,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:05:17,956 INFO L481 AbstractCegarLoop]: Abstraction has 336 states and 454 transitions. [2020-11-30 02:05:17,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 02:05:17,956 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 454 transitions. [2020-11-30 02:05:17,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-30 02:05:17,957 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:05:17,957 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:05:17,957 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-30 02:05:17,957 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:05:17,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:05:17,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1483645175, now seen corresponding path program 1 times [2020-11-30 02:05:17,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:05:17,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33305387] [2020-11-30 02:05:17,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:05:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:05:17,993 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:05:17,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33305387] [2020-11-30 02:05:17,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:05:17,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:05:17,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902896998] [2020-11-30 02:05:17,994 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:05:17,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:05:17,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:05:17,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:05:17,995 INFO L87 Difference]: Start difference. First operand 336 states and 454 transitions. Second operand 4 states. [2020-11-30 02:05:18,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:05:18,093 INFO L93 Difference]: Finished difference Result 757 states and 1008 transitions. [2020-11-30 02:05:18,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:05:18,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-11-30 02:05:18,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:05:18,097 INFO L225 Difference]: With dead ends: 757 [2020-11-30 02:05:18,097 INFO L226 Difference]: Without dead ends: 448 [2020-11-30 02:05:18,099 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:05:18,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2020-11-30 02:05:18,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 295. [2020-11-30 02:05:18,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2020-11-30 02:05:18,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 392 transitions. [2020-11-30 02:05:18,137 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 392 transitions. Word has length 35 [2020-11-30 02:05:18,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:05:18,137 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 392 transitions. [2020-11-30 02:05:18,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:05:18,137 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 392 transitions. [2020-11-30 02:05:18,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-30 02:05:18,138 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:05:18,138 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:05:18,139 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-30 02:05:18,139 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:05:18,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:05:18,139 INFO L82 PathProgramCache]: Analyzing trace with hash 942954065, now seen corresponding path program 1 times [2020-11-30 02:05:18,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:05:18,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359854506] [2020-11-30 02:05:18,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:05:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:05:18,287 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:05:18,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359854506] [2020-11-30 02:05:18,287 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:05:18,287 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 02:05:18,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87878928] [2020-11-30 02:05:18,288 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:05:18,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:05:18,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:05:18,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:05:18,289 INFO L87 Difference]: Start difference. First operand 295 states and 392 transitions. Second operand 6 states. [2020-11-30 02:05:18,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:05:18,814 INFO L93 Difference]: Finished difference Result 1424 states and 1853 transitions. [2020-11-30 02:05:18,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 02:05:18,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-11-30 02:05:18,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:05:18,822 INFO L225 Difference]: With dead ends: 1424 [2020-11-30 02:05:18,822 INFO L226 Difference]: Without dead ends: 1187 [2020-11-30 02:05:18,824 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:05:18,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2020-11-30 02:05:18,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 358. [2020-11-30 02:05:18,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2020-11-30 02:05:18,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 467 transitions. [2020-11-30 02:05:18,882 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 467 transitions. Word has length 35 [2020-11-30 02:05:18,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:05:18,883 INFO L481 AbstractCegarLoop]: Abstraction has 358 states and 467 transitions. [2020-11-30 02:05:18,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:05:18,883 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 467 transitions. [2020-11-30 02:05:18,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-30 02:05:18,884 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:05:18,884 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:05:18,884 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-30 02:05:18,885 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:05:18,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:05:18,885 INFO L82 PathProgramCache]: Analyzing trace with hash -2102067361, now seen corresponding path program 1 times [2020-11-30 02:05:18,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:05:18,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102984560] [2020-11-30 02:05:18,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:05:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:05:18,930 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:05:18,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102984560] [2020-11-30 02:05:18,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:05:18,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 02:05:18,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253168300] [2020-11-30 02:05:18,931 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:05:18,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:05:18,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:05:18,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:05:18,932 INFO L87 Difference]: Start difference. First operand 358 states and 467 transitions. Second operand 4 states. [2020-11-30 02:05:19,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:05:19,089 INFO L93 Difference]: Finished difference Result 1011 states and 1317 transitions. [2020-11-30 02:05:19,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:05:19,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2020-11-30 02:05:19,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:05:19,094 INFO L225 Difference]: With dead ends: 1011 [2020-11-30 02:05:19,094 INFO L226 Difference]: Without dead ends: 750 [2020-11-30 02:05:19,095 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:05:19,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2020-11-30 02:05:19,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 483. [2020-11-30 02:05:19,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2020-11-30 02:05:19,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 621 transitions. [2020-11-30 02:05:19,151 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 621 transitions. Word has length 37 [2020-11-30 02:05:19,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:05:19,152 INFO L481 AbstractCegarLoop]: Abstraction has 483 states and 621 transitions. [2020-11-30 02:05:19,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:05:19,152 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 621 transitions. [2020-11-30 02:05:19,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-11-30 02:05:19,153 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:05:19,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] [2020-11-30 02:05:19,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-30 02:05:19,154 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:05:19,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:05:19,155 INFO L82 PathProgramCache]: Analyzing trace with hash -940978392, now seen corresponding path program 1 times [2020-11-30 02:05:19,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:05:19,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094322994] [2020-11-30 02:05:19,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:05:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:05:19,334 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:05:19,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094322994] [2020-11-30 02:05:19,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:05:19,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 02:05:19,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33840688] [2020-11-30 02:05:19,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 02:05:19,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:05:19,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 02:05:19,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:05:19,336 INFO L87 Difference]: Start difference. First operand 483 states and 621 transitions. Second operand 5 states. [2020-11-30 02:05:19,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:05:19,496 INFO L93 Difference]: Finished difference Result 959 states and 1238 transitions. [2020-11-30 02:05:19,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:05:19,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-11-30 02:05:19,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:05:19,500 INFO L225 Difference]: With dead ends: 959 [2020-11-30 02:05:19,500 INFO L226 Difference]: Without dead ends: 599 [2020-11-30 02:05:19,501 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:05:19,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-11-30 02:05:19,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 479. [2020-11-30 02:05:19,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2020-11-30 02:05:19,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 614 transitions. [2020-11-30 02:05:19,559 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 614 transitions. Word has length 38 [2020-11-30 02:05:19,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:05:19,559 INFO L481 AbstractCegarLoop]: Abstraction has 479 states and 614 transitions. [2020-11-30 02:05:19,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 02:05:19,559 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 614 transitions. [2020-11-30 02:05:19,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-30 02:05:19,560 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:05:19,560 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:05:19,560 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-30 02:05:19,561 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:05:19,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:05:19,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1538804575, now seen corresponding path program 1 times [2020-11-30 02:05:19,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:05:19,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387708547] [2020-11-30 02:05:19,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:05:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:05:19,596 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:05:19,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387708547] [2020-11-30 02:05:19,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:05:19,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:05:19,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844757473] [2020-11-30 02:05:19,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:05:19,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:05:19,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:05:19,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:05:19,598 INFO L87 Difference]: Start difference. First operand 479 states and 614 transitions. Second operand 4 states. [2020-11-30 02:05:19,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:05:19,749 INFO L93 Difference]: Finished difference Result 1129 states and 1438 transitions. [2020-11-30 02:05:19,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:05:19,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-11-30 02:05:19,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:05:19,754 INFO L225 Difference]: With dead ends: 1129 [2020-11-30 02:05:19,754 INFO L226 Difference]: Without dead ends: 682 [2020-11-30 02:05:19,755 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:05:19,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2020-11-30 02:05:19,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 443. [2020-11-30 02:05:19,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2020-11-30 02:05:19,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 562 transitions. [2020-11-30 02:05:19,811 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 562 transitions. Word has length 40 [2020-11-30 02:05:19,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:05:19,811 INFO L481 AbstractCegarLoop]: Abstraction has 443 states and 562 transitions. [2020-11-30 02:05:19,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:05:19,811 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 562 transitions. [2020-11-30 02:05:19,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-30 02:05:19,812 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:05:19,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:05:19,812 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-30 02:05:19,812 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:05:19,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:05:19,813 INFO L82 PathProgramCache]: Analyzing trace with hash 737910954, now seen corresponding path program 1 times [2020-11-30 02:05:19,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:05:19,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531025114] [2020-11-30 02:05:19,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:05:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:05:19,961 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:05:19,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531025114] [2020-11-30 02:05:19,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:05:19,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 02:05:19,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635090031] [2020-11-30 02:05:19,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 02:05:19,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:05:19,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 02:05:19,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:05:19,963 INFO L87 Difference]: Start difference. First operand 443 states and 562 transitions. Second operand 5 states. [2020-11-30 02:05:20,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:05:20,184 INFO L93 Difference]: Finished difference Result 1227 states and 1562 transitions. [2020-11-30 02:05:20,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:05:20,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2020-11-30 02:05:20,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:05:20,191 INFO L225 Difference]: With dead ends: 1227 [2020-11-30 02:05:20,191 INFO L226 Difference]: Without dead ends: 871 [2020-11-30 02:05:20,194 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:05:20,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2020-11-30 02:05:20,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 439. [2020-11-30 02:05:20,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2020-11-30 02:05:20,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 555 transitions. [2020-11-30 02:05:20,255 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 555 transitions. Word has length 46 [2020-11-30 02:05:20,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:05:20,255 INFO L481 AbstractCegarLoop]: Abstraction has 439 states and 555 transitions. [2020-11-30 02:05:20,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 02:05:20,255 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 555 transitions. [2020-11-30 02:05:20,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-30 02:05:20,256 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:05:20,256 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:05:20,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-30 02:05:20,257 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:05:20,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:05:20,257 INFO L82 PathProgramCache]: Analyzing trace with hash -545227092, now seen corresponding path program 1 times [2020-11-30 02:05:20,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:05:20,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945722078] [2020-11-30 02:05:20,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:05:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:05:20,321 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:05:20,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945722078] [2020-11-30 02:05:20,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:05:20,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:05:20,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859909446] [2020-11-30 02:05:20,321 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:05:20,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:05:20,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:05:20,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:05:20,322 INFO L87 Difference]: Start difference. First operand 439 states and 555 transitions. Second operand 3 states. [2020-11-30 02:05:20,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:05:20,412 INFO L93 Difference]: Finished difference Result 786 states and 1002 transitions. [2020-11-30 02:05:20,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:05:20,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-11-30 02:05:20,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:05:20,415 INFO L225 Difference]: With dead ends: 786 [2020-11-30 02:05:20,415 INFO L226 Difference]: Without dead ends: 434 [2020-11-30 02:05:20,416 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:05:20,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-11-30 02:05:20,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2020-11-30 02:05:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-11-30 02:05:20,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 547 transitions. [2020-11-30 02:05:20,471 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 547 transitions. Word has length 54 [2020-11-30 02:05:20,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:05:20,472 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 547 transitions. [2020-11-30 02:05:20,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:05:20,472 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 547 transitions. [2020-11-30 02:05:20,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-30 02:05:20,473 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:05:20,473 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] [2020-11-30 02:05:20,474 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-30 02:05:20,474 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:05:20,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:05:20,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1395563784, now seen corresponding path program 1 times [2020-11-30 02:05:20,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:05:20,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610522829] [2020-11-30 02:05:20,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:05:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:05:20,665 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:05:20,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610522829] [2020-11-30 02:05:20,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760727608] [2020-11-30 02:05:20,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:05:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:05:20,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 02:05:20,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:05:21,156 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:05:21,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:05:21,174 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 02:05:21,179 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:05:21,181 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 2, 2, 1] term [2020-11-30 02:05:21,181 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:05:21,185 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 02:05:21,185 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:05:21,209 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 02:05:21,229 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:05:21,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-11-30 02:05:21,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [7] total 9 [2020-11-30 02:05:21,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071792291] [2020-11-30 02:05:21,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:05:21,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:05:21,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:05:21,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-30 02:05:21,234 INFO L87 Difference]: Start difference. First operand 434 states and 547 transitions. Second operand 4 states. [2020-11-30 02:05:21,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:05:21,384 INFO L93 Difference]: Finished difference Result 915 states and 1149 transitions. [2020-11-30 02:05:21,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 02:05:21,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2020-11-30 02:05:21,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:05:21,388 INFO L225 Difference]: With dead ends: 915 [2020-11-30 02:05:21,388 INFO L226 Difference]: Without dead ends: 537 [2020-11-30 02:05:21,389 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 111 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:05:21,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-11-30 02:05:21,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 434. [2020-11-30 02:05:21,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-11-30 02:05:21,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 545 transitions. [2020-11-30 02:05:21,492 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 545 transitions. Word has length 57 [2020-11-30 02:05:21,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:05:21,492 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 545 transitions. [2020-11-30 02:05:21,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:05:21,492 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 545 transitions. [2020-11-30 02:05:21,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-30 02:05:21,493 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:05:21,494 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:05:21,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2020-11-30 02:05:21,708 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:05:21,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:05:21,709 INFO L82 PathProgramCache]: Analyzing trace with hash 672488240, now seen corresponding path program 1 times [2020-11-30 02:05:21,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:05:21,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614664422] [2020-11-30 02:05:21,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:05:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:05:21,928 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:05:21,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614664422] [2020-11-30 02:05:21,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:05:21,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 02:05:21,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486716000] [2020-11-30 02:05:21,930 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 02:05:21,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:05:21,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 02:05:21,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-30 02:05:21,931 INFO L87 Difference]: Start difference. First operand 434 states and 545 transitions. Second operand 7 states. [2020-11-30 02:05:22,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:05:22,381 INFO L93 Difference]: Finished difference Result 1105 states and 1390 transitions. [2020-11-30 02:05:22,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 02:05:22,382 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2020-11-30 02:05:22,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:05:22,386 INFO L225 Difference]: With dead ends: 1105 [2020-11-30 02:05:22,386 INFO L226 Difference]: Without dead ends: 758 [2020-11-30 02:05:22,389 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:05:22,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2020-11-30 02:05:22,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 444. [2020-11-30 02:05:22,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-11-30 02:05:22,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 554 transitions. [2020-11-30 02:05:22,498 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 554 transitions. Word has length 60 [2020-11-30 02:05:22,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:05:22,499 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 554 transitions. [2020-11-30 02:05:22,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 02:05:22,499 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 554 transitions. [2020-11-30 02:05:22,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-30 02:05:22,500 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:05:22,500 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:05:22,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-30 02:05:22,501 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:05:22,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:05:22,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1674458195, now seen corresponding path program 1 times [2020-11-30 02:05:22,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:05:22,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515410062] [2020-11-30 02:05:22,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:05:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:05:23,027 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:05:23,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515410062] [2020-11-30 02:05:23,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:05:23,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-30 02:05:23,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297908221] [2020-11-30 02:05:23,029 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-30 02:05:23,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:05:23,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-30 02:05:23,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2020-11-30 02:05:23,030 INFO L87 Difference]: Start difference. First operand 444 states and 554 transitions. Second operand 15 states. [2020-11-30 02:05:24,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:05:24,166 INFO L93 Difference]: Finished difference Result 1105 states and 1403 transitions. [2020-11-30 02:05:24,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-30 02:05:24,167 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 64 [2020-11-30 02:05:24,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:05:24,172 INFO L225 Difference]: With dead ends: 1105 [2020-11-30 02:05:24,172 INFO L226 Difference]: Without dead ends: 748 [2020-11-30 02:05:24,173 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2020-11-30 02:05:24,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2020-11-30 02:05:24,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 471. [2020-11-30 02:05:24,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2020-11-30 02:05:24,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 584 transitions. [2020-11-30 02:05:24,264 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 584 transitions. Word has length 64 [2020-11-30 02:05:24,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:05:24,265 INFO L481 AbstractCegarLoop]: Abstraction has 471 states and 584 transitions. [2020-11-30 02:05:24,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-30 02:05:24,265 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 584 transitions. [2020-11-30 02:05:24,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-30 02:05:24,272 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:05:24,272 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] [2020-11-30 02:05:24,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-30 02:05:24,273 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:05:24,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:05:24,273 INFO L82 PathProgramCache]: Analyzing trace with hash -589568605, now seen corresponding path program 1 times [2020-11-30 02:05:24,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:05:24,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222404641] [2020-11-30 02:05:24,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:05:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:05:24,568 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:05:24,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222404641] [2020-11-30 02:05:24,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789298809] [2020-11-30 02:05:24,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:05:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:05:24,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 24 conjunts are in the unsatisfiable core [2020-11-30 02:05:24,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:05:24,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-30 02:05:24,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:05:25,066 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:05:25,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:05:25,170 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:05:25,215 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-30 02:05:25,215 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:05:25,216 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:05:25,217 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:05:25,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:05:25,233 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:05:25,241 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:05:25,242 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:05:25,248 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:05:25,413 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 27 [2020-11-30 02:05:25,506 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:05:25,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [926629934] [2020-11-30 02:05:25,534 INFO L159 IcfgInterpreter]: Started Sifa with 46 locations of interest [2020-11-30 02:05:25,534 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:05:25,539 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 02:05:25,545 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 02:05:25,545 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 02:05:25,794 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:05:25,841 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:05:25,924 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:05:25,952 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:05:25,978 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:05:26,007 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:05:26,037 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:05:26,060 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:05:26,088 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:05:26,122 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:05:26,145 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:05:26,167 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:05:30,123 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 117 [2020-11-30 02:05:31,272 WARN L193 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 286 DAG size of output: 120 [2020-11-30 02:05:31,551 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 287 [2020-11-30 02:05:31,583 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 02:05:31,625 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 02:05:32,166 WARN L193 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 156 [2020-11-30 02:05:32,571 WARN L193 SmtUtils]: Spent 402.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:05:32,927 WARN L193 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:05:33,261 WARN L193 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:05:33,531 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:05:33,752 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:05:33,993 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-30 02:05:34,264 WARN L193 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-30 02:05:34,526 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-30 02:05:34,757 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-30 02:05:35,041 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:05:35,298 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:05:35,610 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:05:35,869 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:05:36,208 WARN L193 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:05:36,519 WARN L193 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:05:36,859 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:05:37,117 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:05:37,481 WARN L193 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:05:37,761 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:05:38,095 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:05:38,370 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:05:38,665 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:05:38,938 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:05:39,231 WARN L193 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:05:39,502 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:05:39,982 WARN L193 SmtUtils]: Spent 420.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:05:40,395 WARN L193 SmtUtils]: Spent 410.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:05:40,832 WARN L193 SmtUtils]: Spent 408.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2020-11-30 02:05:41,104 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2020-11-30 02:05:41,408 WARN L193 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2020-11-30 02:05:41,701 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2020-11-30 02:05:41,954 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:05:42,203 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:05:42,497 WARN L193 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:05:42,763 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:05:43,151 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:05:43,400 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:05:43,688 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:05:43,929 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:05:44,192 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:05:44,437 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:05:44,709 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:05:44,957 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:05:45,243 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:05:45,512 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:05:45,857 WARN L193 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:05:46,125 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:05:46,444 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:05:46,732 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:05:47,029 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:05:47,319 WARN L193 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:05:47,608 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:05:47,882 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:05:48,312 WARN L193 SmtUtils]: Spent 378.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:05:48,611 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:05:48,886 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:05:49,147 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:05:49,548 WARN L193 SmtUtils]: Spent 371.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:05:49,819 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:05:50,123 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:05:50,385 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:05:50,708 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2020-11-30 02:05:50,993 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2020-11-30 02:05:51,308 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2020-11-30 02:05:51,590 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2020-11-30 02:05:52,226 WARN L193 SmtUtils]: Spent 634.00 ms on a formula simplification that was a NOOP. DAG size: 239 [2020-11-30 02:05:52,354 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 02:05:53,461 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 02:06:00,323 WARN L193 SmtUtils]: Spent 4.97 s on a formula simplification. DAG size of input: 720 DAG size of output: 260 [2020-11-30 02:06:01,591 WARN L193 SmtUtils]: Spent 1.26 s on a formula simplification that was a NOOP. DAG size: 260 [2020-11-30 02:06:03,377 WARN L193 SmtUtils]: Spent 1.63 s on a formula simplification that was a NOOP. DAG size: 266 [2020-11-30 02:06:04,856 WARN L193 SmtUtils]: Spent 1.48 s on a formula simplification that was a NOOP. DAG size: 266 [2020-11-30 02:06:06,223 WARN L193 SmtUtils]: Spent 1.32 s on a formula simplification that was a NOOP. DAG size: 266 [2020-11-30 02:06:07,532 WARN L193 SmtUtils]: Spent 1.31 s on a formula simplification that was a NOOP. DAG size: 266 [2020-11-30 02:06:07,594 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 02:06:07,619 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 02:06:07,907 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 156 [2020-11-30 02:06:08,111 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:06:08,328 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:06:08,550 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:06:08,791 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:06:08,985 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:06:09,241 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-30 02:06:09,459 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-30 02:06:09,701 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-30 02:06:09,921 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-30 02:06:10,191 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:06:10,436 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:06:10,704 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:06:10,952 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:06:11,249 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:06:11,506 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:06:11,784 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:06:12,029 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:06:12,327 WARN L193 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:06:12,605 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:06:12,983 WARN L193 SmtUtils]: Spent 346.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:06:13,271 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:06:13,603 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:06:13,885 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:06:14,223 WARN L193 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:06:14,505 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:06:14,828 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:06:15,107 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:06:15,428 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2020-11-30 02:06:15,705 WARN L193 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2020-11-30 02:06:16,030 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2020-11-30 02:06:16,340 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2020-11-30 02:06:16,709 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2020-11-30 02:06:17,032 WARN L193 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2020-11-30 02:06:17,342 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2020-11-30 02:06:17,667 WARN L193 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2020-11-30 02:06:17,970 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:06:18,280 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:06:18,608 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:06:18,900 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:06:19,188 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:06:19,461 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:06:19,735 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:06:20,025 WARN L193 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:06:20,325 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:06:20,610 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:06:20,865 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:06:21,123 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:06:21,420 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:06:21,673 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:06:21,963 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:06:22,205 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:06:22,473 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:06:22,718 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:06:23,003 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:06:23,246 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:06:23,523 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:06:23,766 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:06:24,063 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:06:24,350 WARN L193 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:06:24,653 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:06:24,926 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:06:25,225 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:06:25,497 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:06:25,796 WARN L193 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:06:26,066 WARN L193 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:06:26,367 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:06:26,639 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:06:27,061 WARN L193 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:06:27,318 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:06:27,606 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:06:27,869 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:06:28,158 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:06:28,418 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:06:28,733 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:06:28,991 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:06:29,300 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2020-11-30 02:06:29,583 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2020-11-30 02:06:29,897 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2020-11-30 02:06:30,177 WARN L193 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2020-11-30 02:06:30,832 WARN L193 SmtUtils]: Spent 638.00 ms on a formula simplification that was a NOOP. DAG size: 239 [2020-11-30 02:06:31,510 WARN L193 SmtUtils]: Spent 623.00 ms on a formula simplification that was a NOOP. DAG size: 239 [2020-11-30 02:06:31,683 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 02:06:31,753 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 5184 conjuctions. This might take some time... [2020-11-30 02:06:43,760 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 5184 conjuctions. [2020-11-30 02:06:43,816 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 02:06:43,864 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 5184 conjuctions. This might take some time... [2020-11-30 02:06:55,766 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 5184 conjuctions. [2020-11-30 02:06:59,241 WARN L193 SmtUtils]: Spent 2.88 s on a formula simplification. DAG size of input: 835 DAG size of output: 191 [2020-11-30 02:06:59,731 WARN L193 SmtUtils]: Spent 486.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2020-11-30 02:07:00,023 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2020-11-30 02:07:00,303 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2020-11-30 02:07:00,598 WARN L193 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2020-11-30 02:07:00,876 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2020-11-30 02:07:01,139 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:07:01,395 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:07:01,689 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:07:01,945 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:07:02,220 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:07:02,478 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:07:02,749 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:07:03,029 WARN L193 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:07:03,336 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:07:03,641 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:07:03,929 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:07:04,200 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:07:04,479 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:07:04,748 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:07:05,030 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:07:05,300 WARN L193 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:07:05,579 WARN L193 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:07:05,853 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:07:06,109 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:07:06,358 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:07:06,633 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:07:06,885 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:07:07,155 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:07:07,413 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:07:07,671 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:07:07,916 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:07:08,172 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:07:08,419 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:07:08,671 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:07:08,916 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:07:09,169 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:07:09,418 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:07:09,673 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:07:09,915 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:07:10,167 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:07:10,413 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:07:10,646 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-30 02:07:10,869 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-30 02:07:11,106 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-30 02:07:11,335 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-30 02:07:11,542 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:07:11,735 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:07:11,930 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:07:12,120 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:07:12,121 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 02:07:12,374 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 156 [2020-11-30 02:07:12,567 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:07:12,568 INFO L180 IcfgInterpreter]: Interpretation finished [2020-11-30 02:07:13,629 WARN L193 SmtUtils]: Spent 988.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 121 [2020-11-30 02:07:14,259 WARN L193 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 111 [2020-11-30 02:07:14,709 WARN L193 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 113 [2020-11-30 02:07:15,202 WARN L193 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 117 [2020-11-30 02:07:17,341 WARN L193 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 191 DAG size of output: 83 [2020-11-30 02:07:17,816 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 98 [2020-11-30 02:07:18,413 WARN L193 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 101 [2020-11-30 02:07:18,898 WARN L193 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 [2020-11-30 02:07:26,352 WARN L193 SmtUtils]: Spent 7.15 s on a formula simplification that was a NOOP. DAG size: 156 [2020-11-30 02:07:34,658 WARN L193 SmtUtils]: Spent 7.84 s on a formula simplification that was a NOOP. DAG size: 164 [2020-11-30 02:07:44,167 WARN L193 SmtUtils]: Spent 9.00 s on a formula simplification that was a NOOP. DAG size: 170 [2020-11-30 02:07:55,286 WARN L193 SmtUtils]: Spent 10.41 s on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 02:08:05,086 WARN L193 SmtUtils]: Spent 9.22 s on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:08:15,811 WARN L193 SmtUtils]: Spent 10.19 s on a formula simplification that was a NOOP. DAG size: 180 [2020-11-30 02:08:26,857 WARN L193 SmtUtils]: Spent 10.38 s on a formula simplification that was a NOOP. DAG size: 181 [2020-11-30 02:08:27,374 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2020-11-30 02:08:28,289 WARN L193 SmtUtils]: Spent 693.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 127 [2020-11-30 02:08:39,065 WARN L193 SmtUtils]: Spent 10.08 s on a formula simplification that was a NOOP. DAG size: 172 [2020-11-30 02:08:50,799 WARN L193 SmtUtils]: Spent 10.99 s on a formula simplification that was a NOOP. DAG size: 179 [2020-11-30 02:09:02,592 WARN L193 SmtUtils]: Spent 10.93 s on a formula simplification that was a NOOP. DAG size: 186 [2020-11-30 02:09:02,596 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-30 02:09:02,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:09:02,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2020-11-30 02:09:02,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295973828] [2020-11-30 02:09:02,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-30 02:09:02,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:09:02,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-30 02:09:02,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1568, Unknown=0, NotChecked=0, Total=1722 [2020-11-30 02:09:02,599 INFO L87 Difference]: Start difference. First operand 471 states and 584 transitions. Second operand 20 states. [2020-11-30 02:09:04,891 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-11-30 02:09:05,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:09:05,566 INFO L93 Difference]: Finished difference Result 2029 states and 2529 transitions. [2020-11-30 02:09:05,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-30 02:09:05,567 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 65 [2020-11-30 02:09:05,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:09:05,577 INFO L225 Difference]: With dead ends: 2029 [2020-11-30 02:09:05,577 INFO L226 Difference]: Without dead ends: 1672 [2020-11-30 02:09:05,580 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 993 ImplicationChecksByTransitivity, 111.7s TimeCoverageRelationStatistics Valid=289, Invalid=2681, Unknown=0, NotChecked=0, Total=2970 [2020-11-30 02:09:05,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2020-11-30 02:09:05,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 854. [2020-11-30 02:09:05,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2020-11-30 02:09:05,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1048 transitions. [2020-11-30 02:09:05,769 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1048 transitions. Word has length 65 [2020-11-30 02:09:05,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:09:05,770 INFO L481 AbstractCegarLoop]: Abstraction has 854 states and 1048 transitions. [2020-11-30 02:09:05,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-30 02:09:05,770 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1048 transitions. [2020-11-30 02:09:05,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-30 02:09:05,772 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:09:05,773 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] [2020-11-30 02:09:05,988 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2020-11-30 02:09:05,988 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:09:05,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:09:05,989 INFO L82 PathProgramCache]: Analyzing trace with hash -2087620582, now seen corresponding path program 1 times [2020-11-30 02:09:05,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:09:05,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915600975] [2020-11-30 02:09:05,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:09:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:09:06,329 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:09:06,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915600975] [2020-11-30 02:09:06,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735634275] [2020-11-30 02:09:06,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:09:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:09:06,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 19 conjunts are in the unsatisfiable core [2020-11-30 02:09:06,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:09:06,786 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:09:06,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:09:07,188 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 27 [2020-11-30 02:09:07,287 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:09:07,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [631341635] [2020-11-30 02:09:07,293 INFO L159 IcfgInterpreter]: Started Sifa with 48 locations of interest [2020-11-30 02:09:07,293 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:09:07,294 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 02:09:07,294 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 02:09:07,295 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 02:09:07,400 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:09:07,430 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:09:07,460 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:09:07,493 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:09:07,524 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:09:07,554 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:09:07,584 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:09:07,615 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:09:07,645 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:09:07,673 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:09:07,700 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:09:07,784 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:09:08,108 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 282 [2020-11-30 02:09:11,239 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 5460 conjuctions. This might take some time... [2020-11-30 02:09:20,554 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 5460 conjuctions. [2020-11-30 02:09:50,053 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 252 DAG size of output: 248 [2020-11-30 02:10:04,903 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2020-11-30 02:10:09,034 WARN L193 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 213 DAG size of output: 166 [2020-11-30 02:10:11,170 WARN L193 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 244 DAG size of output: 195 [2020-11-30 02:10:11,848 WARN L193 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 124 [2020-11-30 02:10:12,164 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-11-30 02:10:12,768 WARN L193 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 121 [2020-11-30 02:10:13,413 WARN L193 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 122 [2020-11-30 02:10:13,740 WARN L193 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-11-30 02:10:14,415 WARN L193 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 121 [2020-11-30 02:10:15,144 WARN L193 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 123 [2020-11-30 02:10:15,836 WARN L193 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 123 [2020-11-30 02:10:16,399 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 02:10:16,422 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 02:10:17,007 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 02:10:19,083 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 02:10:21,752 WARN L193 SmtUtils]: Spent 941.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 130 [2020-11-30 02:10:22,490 WARN L193 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 130 [2020-11-30 02:10:23,191 WARN L193 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 126 [2020-11-30 02:10:23,909 WARN L193 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 124 [2020-11-30 02:10:24,629 WARN L193 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 132 [2020-11-30 02:10:25,384 WARN L193 SmtUtils]: Spent 750.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 132 [2020-11-30 02:10:26,167 WARN L193 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 130 [2020-11-30 02:10:26,946 WARN L193 SmtUtils]: Spent 765.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 132 [2020-11-30 02:10:27,707 WARN L193 SmtUtils]: Spent 756.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 126 [2020-11-30 02:10:28,463 WARN L193 SmtUtils]: Spent 753.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 124 [2020-11-30 02:10:31,245 WARN L193 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 254 DAG size of output: 206 [2020-11-30 02:10:31,994 WARN L193 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 121 [2020-11-30 02:10:32,721 WARN L193 SmtUtils]: Spent 725.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 129 [2020-11-30 02:10:33,083 WARN L193 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-11-30 02:10:33,876 WARN L193 SmtUtils]: Spent 791.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 121 [2020-11-30 02:10:34,670 WARN L193 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 123 [2020-11-30 02:10:35,453 WARN L193 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 127 [2020-11-30 02:10:35,815 WARN L193 SmtUtils]: Spent 361.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-11-30 02:10:36,492 WARN L193 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 121 [2020-11-30 02:10:37,201 WARN L193 SmtUtils]: Spent 708.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 119 [2020-11-30 02:10:37,913 WARN L193 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 123 [2020-11-30 02:10:42,074 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-30 02:10:43,427 INFO L180 IcfgInterpreter]: Interpretation finished [2020-11-30 02:10:44,125 WARN L193 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2020-11-30 02:10:47,487 WARN L193 SmtUtils]: Spent 3.09 s on a formula simplification. DAG size of input: 369 DAG size of output: 288 [2020-11-30 02:10:49,746 WARN L193 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 266 DAG size of output: 227 [2020-11-30 02:10:58,142 WARN L193 SmtUtils]: Spent 3.60 s on a formula simplification that was a NOOP. DAG size: 1293 [2020-11-30 02:11:05,403 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-11-30 02:11:05,403 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:226) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:899) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.generateInterpolants(SifaRunner.java:148) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:118) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) ... 38 more [2020-11-30 02:11:05,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:11:05,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2020-11-30 02:11:05,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719231911] [2020-11-30 02:11:05,407 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-30 02:11:05,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:11:05,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-30 02:11:05,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2020-11-30 02:11:05,408 INFO L87 Difference]: Start difference. First operand 854 states and 1048 transitions. Second operand 20 states. [2020-11-30 02:11:05,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-30 02:11:05,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable392,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:11:05,618 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@2429d11a at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:356) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:204) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:61) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:63) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1064) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:966) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:187) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:743) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:674) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) 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:11:05,620 INFO L168 Benchmark]: Toolchain (without parser) took 355791.76 ms. Allocated memory was 90.2 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 59.4 MB in the beginning and 509.0 MB in the end (delta: -449.5 MB). Peak memory consumption was 614.9 MB. Max. memory is 16.1 GB. [2020-11-30 02:11:05,621 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 90.2 MB. Free memory was 47.0 MB in the beginning and 46.9 MB in the end (delta: 34.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 02:11:05,621 INFO L168 Benchmark]: CACSL2BoogieTranslator took 402.52 ms. Allocated memory is still 90.2 MB. Free memory was 59.2 MB in the beginning and 61.0 MB in the end (delta: -1.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 02:11:05,621 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.85 ms. Allocated memory is still 90.2 MB. Free memory was 61.0 MB in the beginning and 56.4 MB in the end (delta: 4.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-30 02:11:05,621 INFO L168 Benchmark]: Boogie Preprocessor took 99.27 ms. Allocated memory is still 90.2 MB. Free memory was 56.4 MB in the beginning and 52.6 MB in the end (delta: 3.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 02:11:05,621 INFO L168 Benchmark]: RCFGBuilder took 2307.44 ms. Allocated memory was 90.2 MB in the beginning and 109.1 MB in the end (delta: 18.9 MB). Free memory was 52.6 MB in the beginning and 39.9 MB in the end (delta: 12.8 MB). Peak memory consumption was 39.7 MB. Max. memory is 16.1 GB. [2020-11-30 02:11:05,622 INFO L168 Benchmark]: TraceAbstraction took 352882.17 ms. Allocated memory was 109.1 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 39.9 MB in the beginning and 509.0 MB in the end (delta: -469.1 MB). Peak memory consumption was 576.9 MB. Max. memory is 16.1 GB. [2020-11-30 02:11:05,623 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 90.2 MB. Free memory was 47.0 MB in the beginning and 46.9 MB in the end (delta: 34.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 402.52 ms. Allocated memory is still 90.2 MB. Free memory was 59.2 MB in the beginning and 61.0 MB in the end (delta: -1.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 93.85 ms. Allocated memory is still 90.2 MB. Free memory was 61.0 MB in the beginning and 56.4 MB in the end (delta: 4.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 99.27 ms. Allocated memory is still 90.2 MB. Free memory was 56.4 MB in the beginning and 52.6 MB in the end (delta: 3.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2307.44 ms. Allocated memory was 90.2 MB in the beginning and 109.1 MB in the end (delta: 18.9 MB). Free memory was 52.6 MB in the beginning and 39.9 MB in the end (delta: 12.8 MB). Peak memory consumption was 39.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 352882.17 ms. Allocated memory was 109.1 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 39.9 MB in the beginning and 509.0 MB in the end (delta: -469.1 MB). Peak memory consumption was 576.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@2429d11a de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@2429d11a: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) 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:11:08,494 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 02:11:08,497 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 02:11:08,547 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 02:11:08,548 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 02:11:08,550 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 02:11:08,553 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 02:11:08,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 02:11:08,559 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 02:11:08,561 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 02:11:08,562 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 02:11:08,564 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 02:11:08,565 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 02:11:08,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 02:11:08,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 02:11:08,570 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 02:11:08,572 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 02:11:08,574 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 02:11:08,577 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 02:11:08,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 02:11:08,594 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 02:11:08,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 02:11:08,604 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 02:11:08,606 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 02:11:08,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 02:11:08,618 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 02:11:08,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 02:11:08,620 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 02:11:08,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 02:11:08,624 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 02:11:08,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 02:11:08,629 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 02:11:08,631 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 02:11:08,633 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 02:11:08,635 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 02:11:08,636 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 02:11:08,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 02:11:08,637 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 02:11:08,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 02:11:08,640 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 02:11:08,641 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 02:11:08,643 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2020-11-30 02:11:08,706 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 02:11:08,707 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 02:11:08,709 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 02:11:08,710 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 02:11:08,710 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 02:11:08,711 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 02:11:08,711 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 02:11:08,711 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 02:11:08,711 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 02:11:08,713 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 02:11:08,715 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 02:11:08,715 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 02:11:08,716 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 02:11:08,716 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 02:11:08,716 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 02:11:08,717 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 02:11:08,717 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 02:11:08,717 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-11-30 02:11:08,717 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-11-30 02:11:08,718 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 02:11:08,718 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 02:11:08,718 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 02:11:08,719 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 02:11:08,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 02:11:08,719 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 02:11:08,719 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 02:11:08,720 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 02:11:08,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 02:11:08,744 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 02:11:08,744 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 02:11:08,745 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 02:11:08,745 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-11-30 02:11:08,745 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-11-30 02:11:08,746 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 02:11:08,746 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 02:11:08,746 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 02:11:08,747 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_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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 -> bc86cc3add356b600fcf92e092d72b9013e4f56a [2020-11-30 02:11:09,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 02:11:09,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 02:11:09,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 02:11:09,287 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 02:11:09,288 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 02:11:09,290 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/bin/utaipan/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2020-11-30 02:11:09,378 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/bin/utaipan/data/f84d9b2b7/5462f3a50cbc4d4086394391cdb07d24/FLAG86f2c4e7a [2020-11-30 02:11:10,088 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 02:11:10,089 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2020-11-30 02:11:10,104 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/bin/utaipan/data/f84d9b2b7/5462f3a50cbc4d4086394391cdb07d24/FLAG86f2c4e7a [2020-11-30 02:11:10,343 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/bin/utaipan/data/f84d9b2b7/5462f3a50cbc4d4086394391cdb07d24 [2020-11-30 02:11:10,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 02:11:10,348 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 02:11:10,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 02:11:10,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 02:11:10,358 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 02:11:10,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:11:10" (1/1) ... [2020-11-30 02:11:10,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c67a604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:11:10, skipping insertion in model container [2020-11-30 02:11:10,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:11:10" (1/1) ... [2020-11-30 02:11:10,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 02:11:10,420 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 02:11:10,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:11:10,801 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 02:11:10,973 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:11:11,002 INFO L208 MainTranslator]: Completed translation [2020-11-30 02:11:11,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:11:11 WrapperNode [2020-11-30 02:11:11,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 02:11:11,004 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 02:11:11,005 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 02:11:11,005 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 02:11:11,014 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:11:11" (1/1) ... [2020-11-30 02:11:11,038 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:11:11" (1/1) ... [2020-11-30 02:11:11,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 02:11:11,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 02:11:11,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 02:11:11,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 02:11:11,158 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:11:11" (1/1) ... [2020-11-30 02:11:11,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:11:11" (1/1) ... [2020-11-30 02:11:11,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:11:11" (1/1) ... [2020-11-30 02:11:11,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:11:11" (1/1) ... [2020-11-30 02:11:11,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:11:11" (1/1) ... [2020-11-30 02:11:11,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:11:11" (1/1) ... [2020-11-30 02:11:11,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:11:11" (1/1) ... [2020-11-30 02:11:11,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 02:11:11,257 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 02:11:11,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 02:11:11,258 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 02:11:11,259 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:11:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:11,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-11-30 02:11:11,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 02:11:11,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 02:11:11,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 02:11:13,254 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 02:11:13,255 INFO L298 CfgBuilder]: Removed 169 assume(true) statements. [2020-11-30 02:11:13,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:11:13 BoogieIcfgContainer [2020-11-30 02:11:13,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 02:11:13,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 02:11:13,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 02:11:13,266 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 02:11:13,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 02:11:10" (1/3) ... [2020-11-30 02:11:13,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d0ab53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:11:13, skipping insertion in model container [2020-11-30 02:11:13,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:11:11" (2/3) ... [2020-11-30 02:11:13,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d0ab53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:11:13, skipping insertion in model container [2020-11-30 02:11:13,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:11:13" (3/3) ... [2020-11-30 02:11:13,271 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2020-11-30 02:11:13,285 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 02:11:13,293 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2020-11-30 02:11:13,309 INFO L253 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2020-11-30 02:11:13,342 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 02:11:13,342 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 02:11:13,342 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 02:11:13,343 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 02:11:13,343 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 02:11:13,343 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 02:11:13,343 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 02:11:13,343 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 02:11:13,386 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states. [2020-11-30 02:11:13,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-30 02:11:13,394 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:13,395 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:11:13,396 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:11:13,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:13,403 INFO L82 PathProgramCache]: Analyzing trace with hash 349506240, now seen corresponding path program 1 times [2020-11-30 02:11:13,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:13,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308909478] [2020-11-30 02:11:13,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:13,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 1 conjunts are in the unsatisfiable core [2020-11-30 02:11:13,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:13,700 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:11:13,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:13,714 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:11:13,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308909478] [2020-11-30 02:11:13,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:11:13,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-11-30 02:11:13,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377950310] [2020-11-30 02:11:13,723 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-11-30 02:11:13,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:13,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-30 02:11:13,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-30 02:11:13,749 INFO L87 Difference]: Start difference. First operand 317 states. Second operand 2 states. [2020-11-30 02:11:13,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:13,855 INFO L93 Difference]: Finished difference Result 591 states and 911 transitions. [2020-11-30 02:11:13,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-30 02:11:13,857 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2020-11-30 02:11:13,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:13,895 INFO L225 Difference]: With dead ends: 591 [2020-11-30 02:11:13,896 INFO L226 Difference]: Without dead ends: 290 [2020-11-30 02:11:13,902 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:11:13,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2020-11-30 02:11:13,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2020-11-30 02:11:13,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2020-11-30 02:11:13,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 424 transitions. [2020-11-30 02:11:13,986 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 424 transitions. Word has length 33 [2020-11-30 02:11:13,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:13,987 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 424 transitions. [2020-11-30 02:11:13,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-11-30 02:11:13,988 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 424 transitions. [2020-11-30 02:11:13,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-30 02:11:13,990 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:13,990 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:11:14,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-11-30 02:11:14,201 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:11:14,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:14,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1047215368, now seen corresponding path program 1 times [2020-11-30 02:11:14,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:14,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [825138027] [2020-11-30 02:11:14,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:14,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 02:11:14,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:14,716 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:11:14,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:14,762 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:11:14,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [825138027] [2020-11-30 02:11:14,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:11:14,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-11-30 02:11:14,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710363728] [2020-11-30 02:11:14,766 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:11:14,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:14,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:11:14,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:11:14,769 INFO L87 Difference]: Start difference. First operand 290 states and 424 transitions. Second operand 4 states. [2020-11-30 02:11:14,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:14,912 INFO L93 Difference]: Finished difference Result 566 states and 822 transitions. [2020-11-30 02:11:14,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 02:11:14,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-11-30 02:11:14,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:14,923 INFO L225 Difference]: With dead ends: 566 [2020-11-30 02:11:14,928 INFO L226 Difference]: Without dead ends: 290 [2020-11-30 02:11:14,931 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:11:14,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2020-11-30 02:11:14,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2020-11-30 02:11:14,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2020-11-30 02:11:14,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 412 transitions. [2020-11-30 02:11:14,979 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 412 transitions. Word has length 33 [2020-11-30 02:11:14,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:14,979 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 412 transitions. [2020-11-30 02:11:14,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:11:14,980 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 412 transitions. [2020-11-30 02:11:14,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-30 02:11:14,982 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:14,982 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:11:15,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-11-30 02:11:15,184 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:11:15,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:15,185 INFO L82 PathProgramCache]: Analyzing trace with hash -600938825, now seen corresponding path program 1 times [2020-11-30 02:11:15,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:15,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7427772] [2020-11-30 02:11:15,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:15,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 02:11:15,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:15,414 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:11:15,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:15,436 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:11:15,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7427772] [2020-11-30 02:11:15,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:11:15,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-11-30 02:11:15,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655218476] [2020-11-30 02:11:15,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:11:15,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:15,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:11:15,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:11:15,451 INFO L87 Difference]: Start difference. First operand 290 states and 412 transitions. Second operand 3 states. [2020-11-30 02:11:15,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:15,552 INFO L93 Difference]: Finished difference Result 642 states and 921 transitions. [2020-11-30 02:11:15,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:11:15,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-11-30 02:11:15,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:15,557 INFO L225 Difference]: With dead ends: 642 [2020-11-30 02:11:15,557 INFO L226 Difference]: Without dead ends: 369 [2020-11-30 02:11:15,559 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:11:15,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2020-11-30 02:11:15,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 266. [2020-11-30 02:11:15,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2020-11-30 02:11:15,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 376 transitions. [2020-11-30 02:11:15,599 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 376 transitions. Word has length 44 [2020-11-30 02:11:15,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:15,599 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 376 transitions. [2020-11-30 02:11:15,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:11:15,600 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 376 transitions. [2020-11-30 02:11:15,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-30 02:11:15,604 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:15,606 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:11:15,820 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-11-30 02:11:15,822 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:11:15,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:15,823 INFO L82 PathProgramCache]: Analyzing trace with hash 906623156, now seen corresponding path program 1 times [2020-11-30 02:11:15,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:15,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1886784022] [2020-11-30 02:11:15,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:16,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 02:11:16,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:16,121 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:11:16,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:16,208 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:11:16,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1886784022] [2020-11-30 02:11:16,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:11:16,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-11-30 02:11:16,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071773166] [2020-11-30 02:11:16,212 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 02:11:16,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:16,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 02:11:16,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-30 02:11:16,215 INFO L87 Difference]: Start difference. First operand 266 states and 376 transitions. Second operand 8 states. [2020-11-30 02:11:16,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:16,995 INFO L93 Difference]: Finished difference Result 1058 states and 1517 transitions. [2020-11-30 02:11:16,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 02:11:16,996 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2020-11-30 02:11:16,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:17,004 INFO L225 Difference]: With dead ends: 1058 [2020-11-30 02:11:17,004 INFO L226 Difference]: Without dead ends: 809 [2020-11-30 02:11:17,006 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2020-11-30 02:11:17,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2020-11-30 02:11:17,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 323. [2020-11-30 02:11:17,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-11-30 02:11:17,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 458 transitions. [2020-11-30 02:11:17,036 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 458 transitions. Word has length 53 [2020-11-30 02:11:17,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:17,037 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 458 transitions. [2020-11-30 02:11:17,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 02:11:17,037 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 458 transitions. [2020-11-30 02:11:17,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-30 02:11:17,039 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:17,039 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:11:17,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-11-30 02:11:17,253 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:11:17,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:17,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1461923786, now seen corresponding path program 1 times [2020-11-30 02:11:17,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:17,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079942529] [2020-11-30 02:11:17,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:17,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 02:11:17,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:17,521 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:11:17,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:17,594 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:11:17,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079942529] [2020-11-30 02:11:17,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:11:17,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-11-30 02:11:17,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433661704] [2020-11-30 02:11:17,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 02:11:17,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:17,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 02:11:17,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-30 02:11:17,599 INFO L87 Difference]: Start difference. First operand 323 states and 458 transitions. Second operand 8 states. [2020-11-30 02:11:18,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:18,344 INFO L93 Difference]: Finished difference Result 1058 states and 1515 transitions. [2020-11-30 02:11:18,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 02:11:18,345 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2020-11-30 02:11:18,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:18,354 INFO L225 Difference]: With dead ends: 1058 [2020-11-30 02:11:18,354 INFO L226 Difference]: Without dead ends: 809 [2020-11-30 02:11:18,355 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:11:18,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2020-11-30 02:11:18,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 323. [2020-11-30 02:11:18,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-11-30 02:11:18,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 457 transitions. [2020-11-30 02:11:18,395 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 457 transitions. Word has length 54 [2020-11-30 02:11:18,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:18,396 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 457 transitions. [2020-11-30 02:11:18,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 02:11:18,397 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 457 transitions. [2020-11-30 02:11:18,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-11-30 02:11:18,401 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:18,402 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:11:18,621 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-11-30 02:11:18,622 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:11:18,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:18,623 INFO L82 PathProgramCache]: Analyzing trace with hash -194359609, now seen corresponding path program 1 times [2020-11-30 02:11:18,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:18,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747920833] [2020-11-30 02:11:18,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:18,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 02:11:18,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:18,870 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:11:18,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:18,888 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:11:18,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1747920833] [2020-11-30 02:11:18,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:11:18,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-11-30 02:11:18,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060291366] [2020-11-30 02:11:18,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:11:18,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:18,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:11:18,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:11:18,900 INFO L87 Difference]: Start difference. First operand 323 states and 457 transitions. Second operand 3 states. [2020-11-30 02:11:18,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:18,980 INFO L93 Difference]: Finished difference Result 827 states and 1180 transitions. [2020-11-30 02:11:18,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:11:18,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-11-30 02:11:18,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:18,986 INFO L225 Difference]: With dead ends: 827 [2020-11-30 02:11:18,986 INFO L226 Difference]: Without dead ends: 578 [2020-11-30 02:11:18,988 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:11:18,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-11-30 02:11:19,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 385. [2020-11-30 02:11:19,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-11-30 02:11:19,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 545 transitions. [2020-11-30 02:11:19,033 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 545 transitions. Word has length 55 [2020-11-30 02:11:19,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:19,036 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 545 transitions. [2020-11-30 02:11:19,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:11:19,036 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 545 transitions. [2020-11-30 02:11:19,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-30 02:11:19,038 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:19,039 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:11:19,252 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-11-30 02:11:19,253 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:11:19,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:19,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1235396363, now seen corresponding path program 1 times [2020-11-30 02:11:19,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:19,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138678850] [2020-11-30 02:11:19,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:19,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 02:11:19,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:19,503 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:11:19,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:19,516 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:11:19,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2138678850] [2020-11-30 02:11:19,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:11:19,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-11-30 02:11:19,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929837489] [2020-11-30 02:11:19,519 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:11:19,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:19,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:11:19,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:11:19,521 INFO L87 Difference]: Start difference. First operand 385 states and 545 transitions. Second operand 3 states. [2020-11-30 02:11:19,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:19,599 INFO L93 Difference]: Finished difference Result 917 states and 1305 transitions. [2020-11-30 02:11:19,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:11:19,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-11-30 02:11:19,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:19,605 INFO L225 Difference]: With dead ends: 917 [2020-11-30 02:11:19,605 INFO L226 Difference]: Without dead ends: 635 [2020-11-30 02:11:19,608 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:11:19,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-11-30 02:11:19,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 418. [2020-11-30 02:11:19,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-11-30 02:11:19,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 587 transitions. [2020-11-30 02:11:19,656 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 587 transitions. Word has length 56 [2020-11-30 02:11:19,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:19,657 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 587 transitions. [2020-11-30 02:11:19,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:11:19,657 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 587 transitions. [2020-11-30 02:11:19,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-30 02:11:19,658 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:19,658 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:11:19,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-11-30 02:11:19,874 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:11:19,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:19,874 INFO L82 PathProgramCache]: Analyzing trace with hash -555337993, now seen corresponding path program 1 times [2020-11-30 02:11:19,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:19,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127052378] [2020-11-30 02:11:19,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:20,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 02:11:20,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:20,119 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:11:20,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:20,131 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:11:20,146 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:11:20,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127052378] [2020-11-30 02:11:20,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:11:20,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-11-30 02:11:20,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464534485] [2020-11-30 02:11:20,149 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:11:20,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:20,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:11:20,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:11:20,151 INFO L87 Difference]: Start difference. First operand 418 states and 587 transitions. Second operand 4 states. [2020-11-30 02:11:20,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:20,228 INFO L93 Difference]: Finished difference Result 723 states and 1026 transitions. [2020-11-30 02:11:20,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 02:11:20,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2020-11-30 02:11:20,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:20,234 INFO L225 Difference]: With dead ends: 723 [2020-11-30 02:11:20,234 INFO L226 Difference]: Without dead ends: 389 [2020-11-30 02:11:20,235 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:11:20,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2020-11-30 02:11:20,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2020-11-30 02:11:20,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-11-30 02:11:20,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 550 transitions. [2020-11-30 02:11:20,272 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 550 transitions. Word has length 56 [2020-11-30 02:11:20,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:20,274 INFO L481 AbstractCegarLoop]: Abstraction has 389 states and 550 transitions. [2020-11-30 02:11:20,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:11:20,274 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 550 transitions. [2020-11-30 02:11:20,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-30 02:11:20,275 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:20,275 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:11:20,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-11-30 02:11:20,489 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:11:20,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:20,489 INFO L82 PathProgramCache]: Analyzing trace with hash -290850577, now seen corresponding path program 1 times [2020-11-30 02:11:20,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:20,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473216801] [2020-11-30 02:11:20,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:20,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 02:11:20,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:20,716 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:11:20,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:20,745 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:11:20,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473216801] [2020-11-30 02:11:20,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:11:20,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-11-30 02:11:20,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520107964] [2020-11-30 02:11:20,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:11:20,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:20,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:11:20,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:11:20,749 INFO L87 Difference]: Start difference. First operand 389 states and 550 transitions. Second operand 3 states. [2020-11-30 02:11:20,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:20,835 INFO L93 Difference]: Finished difference Result 824 states and 1177 transitions. [2020-11-30 02:11:20,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:11:20,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-11-30 02:11:20,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:20,840 INFO L225 Difference]: With dead ends: 824 [2020-11-30 02:11:20,840 INFO L226 Difference]: Without dead ends: 538 [2020-11-30 02:11:20,842 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:11:20,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-11-30 02:11:20,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 384. [2020-11-30 02:11:20,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-11-30 02:11:20,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 542 transitions. [2020-11-30 02:11:20,883 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 542 transitions. Word has length 56 [2020-11-30 02:11:20,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:20,884 INFO L481 AbstractCegarLoop]: Abstraction has 384 states and 542 transitions. [2020-11-30 02:11:20,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:11:20,884 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 542 transitions. [2020-11-30 02:11:20,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-30 02:11:20,885 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:20,885 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:11:21,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-11-30 02:11:21,099 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:11:21,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:21,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1417323913, now seen corresponding path program 1 times [2020-11-30 02:11:21,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:21,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818790039] [2020-11-30 02:11:21,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:21,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 02:11:21,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:21,320 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:11:21,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:21,332 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:11:21,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818790039] [2020-11-30 02:11:21,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:11:21,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-11-30 02:11:21,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857545579] [2020-11-30 02:11:21,334 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:11:21,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:21,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:11:21,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:11:21,336 INFO L87 Difference]: Start difference. First operand 384 states and 542 transitions. Second operand 3 states. [2020-11-30 02:11:21,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:21,464 INFO L93 Difference]: Finished difference Result 806 states and 1157 transitions. [2020-11-30 02:11:21,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:11:21,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-11-30 02:11:21,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:21,469 INFO L225 Difference]: With dead ends: 806 [2020-11-30 02:11:21,469 INFO L226 Difference]: Without dead ends: 525 [2020-11-30 02:11:21,471 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:11:21,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2020-11-30 02:11:21,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 364. [2020-11-30 02:11:21,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2020-11-30 02:11:21,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 510 transitions. [2020-11-30 02:11:21,515 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 510 transitions. Word has length 60 [2020-11-30 02:11:21,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:21,515 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 510 transitions. [2020-11-30 02:11:21,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:11:21,516 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 510 transitions. [2020-11-30 02:11:21,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-30 02:11:21,517 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:21,517 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:11:21,729 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-11-30 02:11:21,730 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:11:21,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:21,731 INFO L82 PathProgramCache]: Analyzing trace with hash -761365213, now seen corresponding path program 1 times [2020-11-30 02:11:21,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:21,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437046965] [2020-11-30 02:11:21,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:21,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 02:11:21,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:21,984 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:11:21,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:21,996 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:11:21,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437046965] [2020-11-30 02:11:21,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:11:21,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-11-30 02:11:21,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94447427] [2020-11-30 02:11:21,998 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:11:21,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:21,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:11:21,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:11:22,000 INFO L87 Difference]: Start difference. First operand 364 states and 510 transitions. Second operand 3 states. [2020-11-30 02:11:22,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:22,097 INFO L93 Difference]: Finished difference Result 745 states and 1055 transitions. [2020-11-30 02:11:22,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:11:22,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-11-30 02:11:22,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:22,102 INFO L225 Difference]: With dead ends: 745 [2020-11-30 02:11:22,102 INFO L226 Difference]: Without dead ends: 484 [2020-11-30 02:11:22,103 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:11:22,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2020-11-30 02:11:22,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 352. [2020-11-30 02:11:22,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-11-30 02:11:22,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 492 transitions. [2020-11-30 02:11:22,137 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 492 transitions. Word has length 64 [2020-11-30 02:11:22,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:22,137 INFO L481 AbstractCegarLoop]: Abstraction has 352 states and 492 transitions. [2020-11-30 02:11:22,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:11:22,137 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 492 transitions. [2020-11-30 02:11:22,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-30 02:11:22,138 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:22,139 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:11:22,351 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-11-30 02:11:22,352 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:11:22,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:22,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1570728737, now seen corresponding path program 1 times [2020-11-30 02:11:22,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:22,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1350815319] [2020-11-30 02:11:22,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:22,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 02:11:22,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:22,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:11:22,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:22,659 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:11:22,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1350815319] [2020-11-30 02:11:22,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:11:22,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2020-11-30 02:11:22,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944107018] [2020-11-30 02:11:22,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:11:22,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:22,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:11:22,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:11:22,662 INFO L87 Difference]: Start difference. First operand 352 states and 492 transitions. Second operand 6 states. [2020-11-30 02:11:23,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:23,002 INFO L93 Difference]: Finished difference Result 1308 states and 1843 transitions. [2020-11-30 02:11:23,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 02:11:23,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2020-11-30 02:11:23,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:23,010 INFO L225 Difference]: With dead ends: 1308 [2020-11-30 02:11:23,011 INFO L226 Difference]: Without dead ends: 1059 [2020-11-30 02:11:23,012 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:11:23,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2020-11-30 02:11:23,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 369. [2020-11-30 02:11:23,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-11-30 02:11:23,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 510 transitions. [2020-11-30 02:11:23,057 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 510 transitions. Word has length 65 [2020-11-30 02:11:23,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:23,058 INFO L481 AbstractCegarLoop]: Abstraction has 369 states and 510 transitions. [2020-11-30 02:11:23,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:11:23,058 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 510 transitions. [2020-11-30 02:11:23,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-11-30 02:11:23,059 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:23,059 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:11:23,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-11-30 02:11:23,274 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:11:23,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:23,275 INFO L82 PathProgramCache]: Analyzing trace with hash 888641750, now seen corresponding path program 1 times [2020-11-30 02:11:23,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:23,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715163175] [2020-11-30 02:11:23,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:23,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 02:11:23,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:23,508 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:11:23,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:23,522 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:11:23,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715163175] [2020-11-30 02:11:23,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:11:23,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-11-30 02:11:23,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033172063] [2020-11-30 02:11:23,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:11:23,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:23,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:11:23,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:11:23,526 INFO L87 Difference]: Start difference. First operand 369 states and 510 transitions. Second operand 3 states. [2020-11-30 02:11:23,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:23,683 INFO L93 Difference]: Finished difference Result 769 states and 1085 transitions. [2020-11-30 02:11:23,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:11:23,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-11-30 02:11:23,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:23,688 INFO L225 Difference]: With dead ends: 769 [2020-11-30 02:11:23,688 INFO L226 Difference]: Without dead ends: 520 [2020-11-30 02:11:23,690 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:11:23,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2020-11-30 02:11:23,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 349. [2020-11-30 02:11:23,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-11-30 02:11:23,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 478 transitions. [2020-11-30 02:11:23,729 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 478 transitions. Word has length 67 [2020-11-30 02:11:23,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:23,729 INFO L481 AbstractCegarLoop]: Abstraction has 349 states and 478 transitions. [2020-11-30 02:11:23,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:11:23,729 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 478 transitions. [2020-11-30 02:11:23,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-11-30 02:11:23,731 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:23,731 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:11:23,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2020-11-30 02:11:23,944 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:11:23,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:23,945 INFO L82 PathProgramCache]: Analyzing trace with hash 2042958320, now seen corresponding path program 1 times [2020-11-30 02:11:23,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:23,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483359425] [2020-11-30 02:11:23,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:24,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 02:11:24,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:24,183 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:11:24,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:24,208 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:11:24,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [483359425] [2020-11-30 02:11:24,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:11:24,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-11-30 02:11:24,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921156261] [2020-11-30 02:11:24,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:11:24,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:24,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:11:24,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:11:24,211 INFO L87 Difference]: Start difference. First operand 349 states and 478 transitions. Second operand 3 states. [2020-11-30 02:11:24,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:24,339 INFO L93 Difference]: Finished difference Result 726 states and 1009 transitions. [2020-11-30 02:11:24,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:11:24,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2020-11-30 02:11:24,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:24,343 INFO L225 Difference]: With dead ends: 726 [2020-11-30 02:11:24,344 INFO L226 Difference]: Without dead ends: 497 [2020-11-30 02:11:24,346 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:11:24,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2020-11-30 02:11:24,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 337. [2020-11-30 02:11:24,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2020-11-30 02:11:24,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 460 transitions. [2020-11-30 02:11:24,387 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 460 transitions. Word has length 71 [2020-11-30 02:11:24,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:24,387 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 460 transitions. [2020-11-30 02:11:24,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:11:24,388 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 460 transitions. [2020-11-30 02:11:24,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-11-30 02:11:24,389 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:24,389 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:11:24,603 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2020-11-30 02:11:24,603 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:11:24,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:24,604 INFO L82 PathProgramCache]: Analyzing trace with hash -305093618, now seen corresponding path program 1 times [2020-11-30 02:11:24,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:24,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [771809691] [2020-11-30 02:11:24,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:24,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 02:11:24,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:24,905 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:11:24,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:24,960 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:11:24,961 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [771809691] [2020-11-30 02:11:24,961 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:11:24,961 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2020-11-30 02:11:24,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728565884] [2020-11-30 02:11:24,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:11:24,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:24,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:11:24,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:11:24,969 INFO L87 Difference]: Start difference. First operand 337 states and 460 transitions. Second operand 6 states. [2020-11-30 02:11:25,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:25,350 INFO L93 Difference]: Finished difference Result 991 states and 1376 transitions. [2020-11-30 02:11:25,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 02:11:25,350 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2020-11-30 02:11:25,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:25,356 INFO L225 Difference]: With dead ends: 991 [2020-11-30 02:11:25,356 INFO L226 Difference]: Without dead ends: 774 [2020-11-30 02:11:25,363 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:11:25,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2020-11-30 02:11:25,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 341. [2020-11-30 02:11:25,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-11-30 02:11:25,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 464 transitions. [2020-11-30 02:11:25,410 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 464 transitions. Word has length 74 [2020-11-30 02:11:25,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:25,410 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 464 transitions. [2020-11-30 02:11:25,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:11:25,411 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 464 transitions. [2020-11-30 02:11:25,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-11-30 02:11:25,412 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:25,412 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:11:25,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2020-11-30 02:11:25,626 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:11:25,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:25,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1214147209, now seen corresponding path program 1 times [2020-11-30 02:11:25,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:25,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748769556] [2020-11-30 02:11:25,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:25,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 02:11:25,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:25,941 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:11:25,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:25,984 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:11:25,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748769556] [2020-11-30 02:11:25,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:11:25,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2020-11-30 02:11:25,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207780947] [2020-11-30 02:11:25,986 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 02:11:25,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:25,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 02:11:25,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-30 02:11:25,987 INFO L87 Difference]: Start difference. First operand 341 states and 464 transitions. Second operand 7 states. [2020-11-30 02:11:26,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:26,580 INFO L93 Difference]: Finished difference Result 1405 states and 1936 transitions. [2020-11-30 02:11:26,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 02:11:26,581 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2020-11-30 02:11:26,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:26,589 INFO L225 Difference]: With dead ends: 1405 [2020-11-30 02:11:26,589 INFO L226 Difference]: Without dead ends: 1188 [2020-11-30 02:11:26,591 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:11:26,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-11-30 02:11:26,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 373. [2020-11-30 02:11:26,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-11-30 02:11:26,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 500 transitions. [2020-11-30 02:11:26,662 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 500 transitions. Word has length 74 [2020-11-30 02:11:26,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:26,662 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 500 transitions. [2020-11-30 02:11:26,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 02:11:26,663 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 500 transitions. [2020-11-30 02:11:26,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-11-30 02:11:26,664 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:26,664 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:11:26,880 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2020-11-30 02:11:26,880 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:11:26,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:26,880 INFO L82 PathProgramCache]: Analyzing trace with hash -89915041, now seen corresponding path program 1 times [2020-11-30 02:11:26,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:26,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976006363] [2020-11-30 02:11:26,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:27,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 02:11:27,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:27,165 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:11:27,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:27,204 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:11:27,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976006363] [2020-11-30 02:11:27,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:11:27,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2020-11-30 02:11:27,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132059055] [2020-11-30 02:11:27,206 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 02:11:27,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:27,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 02:11:27,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-30 02:11:27,207 INFO L87 Difference]: Start difference. First operand 373 states and 500 transitions. Second operand 7 states. [2020-11-30 02:11:27,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:27,848 INFO L93 Difference]: Finished difference Result 1283 states and 1757 transitions. [2020-11-30 02:11:27,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 02:11:27,849 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2020-11-30 02:11:27,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:27,857 INFO L225 Difference]: With dead ends: 1283 [2020-11-30 02:11:27,857 INFO L226 Difference]: Without dead ends: 1045 [2020-11-30 02:11:27,867 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:11:27,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2020-11-30 02:11:27,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 398. [2020-11-30 02:11:27,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-11-30 02:11:27,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 527 transitions. [2020-11-30 02:11:27,938 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 527 transitions. Word has length 75 [2020-11-30 02:11:27,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:27,938 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 527 transitions. [2020-11-30 02:11:27,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 02:11:27,939 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 527 transitions. [2020-11-30 02:11:27,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-11-30 02:11:27,941 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:27,942 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:11:28,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2020-11-30 02:11:28,155 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:11:28,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:28,156 INFO L82 PathProgramCache]: Analyzing trace with hash 575095941, now seen corresponding path program 1 times [2020-11-30 02:11:28,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:28,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [927701793] [2020-11-30 02:11:28,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:28,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 02:11:28,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:28,450 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:11:28,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:28,480 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:11:28,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [927701793] [2020-11-30 02:11:28,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:11:28,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-11-30 02:11:28,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358976115] [2020-11-30 02:11:28,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:11:28,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:28,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:11:28,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:11:28,485 INFO L87 Difference]: Start difference. First operand 398 states and 527 transitions. Second operand 4 states. [2020-11-30 02:11:28,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:28,810 INFO L93 Difference]: Finished difference Result 1065 states and 1421 transitions. [2020-11-30 02:11:28,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:11:28,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-11-30 02:11:28,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:28,817 INFO L225 Difference]: With dead ends: 1065 [2020-11-30 02:11:28,817 INFO L226 Difference]: Without dead ends: 813 [2020-11-30 02:11:28,819 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:11:28,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2020-11-30 02:11:28,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 620. [2020-11-30 02:11:28,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2020-11-30 02:11:28,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 807 transitions. [2020-11-30 02:11:28,907 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 807 transitions. Word has length 75 [2020-11-30 02:11:28,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:28,907 INFO L481 AbstractCegarLoop]: Abstraction has 620 states and 807 transitions. [2020-11-30 02:11:28,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:11:28,908 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 807 transitions. [2020-11-30 02:11:28,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-30 02:11:28,912 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:28,912 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:11:29,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2020-11-30 02:11:29,126 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:11:29,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:29,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1521700342, now seen corresponding path program 1 times [2020-11-30 02:11:29,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:29,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171162085] [2020-11-30 02:11:29,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:29,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 02:11:29,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:29,417 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:11:29,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:29,459 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:11:29,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1171162085] [2020-11-30 02:11:29,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:11:29,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-11-30 02:11:29,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583042899] [2020-11-30 02:11:29,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 02:11:29,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:29,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 02:11:29,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-30 02:11:29,465 INFO L87 Difference]: Start difference. First operand 620 states and 807 transitions. Second operand 7 states. [2020-11-30 02:11:30,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:30,185 INFO L93 Difference]: Finished difference Result 1484 states and 1938 transitions. [2020-11-30 02:11:30,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 02:11:30,186 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2020-11-30 02:11:30,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:30,193 INFO L225 Difference]: With dead ends: 1484 [2020-11-30 02:11:30,193 INFO L226 Difference]: Without dead ends: 921 [2020-11-30 02:11:30,195 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:11:30,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2020-11-30 02:11:30,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 543. [2020-11-30 02:11:30,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2020-11-30 02:11:30,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 708 transitions. [2020-11-30 02:11:30,287 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 708 transitions. Word has length 77 [2020-11-30 02:11:30,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:30,288 INFO L481 AbstractCegarLoop]: Abstraction has 543 states and 708 transitions. [2020-11-30 02:11:30,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 02:11:30,288 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 708 transitions. [2020-11-30 02:11:30,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-30 02:11:30,289 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:30,290 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:11:30,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2020-11-30 02:11:30,505 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:11:30,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:30,506 INFO L82 PathProgramCache]: Analyzing trace with hash 2120832612, now seen corresponding path program 1 times [2020-11-30 02:11:30,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:30,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [139784335] [2020-11-30 02:11:30,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:30,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 02:11:30,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:30,795 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:11:30,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:30,847 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:11:30,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [139784335] [2020-11-30 02:11:30,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:11:30,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2020-11-30 02:11:30,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093008127] [2020-11-30 02:11:30,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 02:11:30,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:30,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 02:11:30,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-30 02:11:30,850 INFO L87 Difference]: Start difference. First operand 543 states and 708 transitions. Second operand 7 states. [2020-11-30 02:11:31,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:31,328 INFO L93 Difference]: Finished difference Result 1662 states and 2260 transitions. [2020-11-30 02:11:31,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 02:11:31,335 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2020-11-30 02:11:31,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:31,342 INFO L225 Difference]: With dead ends: 1662 [2020-11-30 02:11:31,342 INFO L226 Difference]: Without dead ends: 1257 [2020-11-30 02:11:31,343 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:11:31,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2020-11-30 02:11:31,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 516. [2020-11-30 02:11:31,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2020-11-30 02:11:31,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 672 transitions. [2020-11-30 02:11:31,416 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 672 transitions. Word has length 77 [2020-11-30 02:11:31,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:31,416 INFO L481 AbstractCegarLoop]: Abstraction has 516 states and 672 transitions. [2020-11-30 02:11:31,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 02:11:31,417 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 672 transitions. [2020-11-30 02:11:31,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-30 02:11:31,417 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:31,418 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:11:31,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2020-11-30 02:11:31,618 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:11:31,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:31,619 INFO L82 PathProgramCache]: Analyzing trace with hash 412430714, now seen corresponding path program 1 times [2020-11-30 02:11:31,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:31,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296774793] [2020-11-30 02:11:31,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:31,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 02:11:31,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:31,839 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:11:31,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:31,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:11:31,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296774793] [2020-11-30 02:11:31,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:11:31,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-11-30 02:11:31,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323987886] [2020-11-30 02:11:31,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:11:31,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:31,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:11:31,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:11:31,861 INFO L87 Difference]: Start difference. First operand 516 states and 672 transitions. Second operand 4 states. [2020-11-30 02:11:32,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:32,224 INFO L93 Difference]: Finished difference Result 1427 states and 1896 transitions. [2020-11-30 02:11:32,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:11:32,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-11-30 02:11:32,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:32,231 INFO L225 Difference]: With dead ends: 1427 [2020-11-30 02:11:32,231 INFO L226 Difference]: Without dead ends: 1049 [2020-11-30 02:11:32,232 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:11:32,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2020-11-30 02:11:32,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 714. [2020-11-30 02:11:32,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2020-11-30 02:11:32,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 919 transitions. [2020-11-30 02:11:32,326 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 919 transitions. Word has length 77 [2020-11-30 02:11:32,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:32,326 INFO L481 AbstractCegarLoop]: Abstraction has 714 states and 919 transitions. [2020-11-30 02:11:32,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:11:32,326 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 919 transitions. [2020-11-30 02:11:32,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-30 02:11:32,328 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:32,328 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:11:32,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2020-11-30 02:11:32,542 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:11:32,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:32,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1966375292, now seen corresponding path program 1 times [2020-11-30 02:11:32,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:32,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117923914] [2020-11-30 02:11:32,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:32,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 02:11:32,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:32,762 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:11:32,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:32,780 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:11:32,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [117923914] [2020-11-30 02:11:32,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:11:32,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2020-11-30 02:11:32,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872259704] [2020-11-30 02:11:32,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:11:32,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:32,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:11:32,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:11:32,782 INFO L87 Difference]: Start difference. First operand 714 states and 919 transitions. Second operand 6 states. [2020-11-30 02:11:33,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:33,125 INFO L93 Difference]: Finished difference Result 1970 states and 2613 transitions. [2020-11-30 02:11:33,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 02:11:33,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2020-11-30 02:11:33,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:33,137 INFO L225 Difference]: With dead ends: 1970 [2020-11-30 02:11:33,137 INFO L226 Difference]: Without dead ends: 1447 [2020-11-30 02:11:33,139 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 150 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:11:33,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2020-11-30 02:11:33,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 738. [2020-11-30 02:11:33,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2020-11-30 02:11:33,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 946 transitions. [2020-11-30 02:11:33,260 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 946 transitions. Word has length 78 [2020-11-30 02:11:33,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:33,260 INFO L481 AbstractCegarLoop]: Abstraction has 738 states and 946 transitions. [2020-11-30 02:11:33,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:11:33,261 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 946 transitions. [2020-11-30 02:11:33,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-30 02:11:33,262 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:33,262 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:11:33,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2020-11-30 02:11:33,476 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:11:33,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:33,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1076784811, now seen corresponding path program 1 times [2020-11-30 02:11:33,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:33,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195685066] [2020-11-30 02:11:33,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:33,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 02:11:33,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:33,680 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:11:33,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:33,702 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:11:33,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195685066] [2020-11-30 02:11:33,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:11:33,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2020-11-30 02:11:33,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401406146] [2020-11-30 02:11:33,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:11:33,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:33,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:11:33,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:11:33,705 INFO L87 Difference]: Start difference. First operand 738 states and 946 transitions. Second operand 6 states. [2020-11-30 02:11:34,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:34,110 INFO L93 Difference]: Finished difference Result 1898 states and 2525 transitions. [2020-11-30 02:11:34,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 02:11:34,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2020-11-30 02:11:34,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:34,117 INFO L225 Difference]: With dead ends: 1898 [2020-11-30 02:11:34,117 INFO L226 Difference]: Without dead ends: 1375 [2020-11-30 02:11:34,119 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:11:34,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2020-11-30 02:11:34,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 748. [2020-11-30 02:11:34,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2020-11-30 02:11:34,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 956 transitions. [2020-11-30 02:11:34,240 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 956 transitions. Word has length 79 [2020-11-30 02:11:34,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:34,240 INFO L481 AbstractCegarLoop]: Abstraction has 748 states and 956 transitions. [2020-11-30 02:11:34,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:11:34,240 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 956 transitions. [2020-11-30 02:11:34,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-11-30 02:11:34,251 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:34,251 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:11:34,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2020-11-30 02:11:34,464 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:11:34,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:34,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1463168021, now seen corresponding path program 1 times [2020-11-30 02:11:34,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:34,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [866633695] [2020-11-30 02:11:34,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:34,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 02:11:34,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:34,690 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:11:34,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:34,746 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:11:34,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [866633695] [2020-11-30 02:11:34,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:11:34,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-11-30 02:11:34,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414699969] [2020-11-30 02:11:34,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 02:11:34,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:34,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 02:11:34,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-30 02:11:34,753 INFO L87 Difference]: Start difference. First operand 748 states and 956 transitions. Second operand 7 states. [2020-11-30 02:11:35,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:35,376 INFO L93 Difference]: Finished difference Result 1794 states and 2325 transitions. [2020-11-30 02:11:35,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 02:11:35,376 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2020-11-30 02:11:35,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:35,381 INFO L225 Difference]: With dead ends: 1794 [2020-11-30 02:11:35,382 INFO L226 Difference]: Without dead ends: 1125 [2020-11-30 02:11:35,383 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-11-30 02:11:35,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2020-11-30 02:11:35,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 692. [2020-11-30 02:11:35,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2020-11-30 02:11:35,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 880 transitions. [2020-11-30 02:11:35,530 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 880 transitions. Word has length 80 [2020-11-30 02:11:35,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:35,530 INFO L481 AbstractCegarLoop]: Abstraction has 692 states and 880 transitions. [2020-11-30 02:11:35,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 02:11:35,531 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 880 transitions. [2020-11-30 02:11:35,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-11-30 02:11:35,533 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:35,533 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:11:35,748 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2020-11-30 02:11:35,748 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:11:35,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:35,749 INFO L82 PathProgramCache]: Analyzing trace with hash -662287858, now seen corresponding path program 1 times [2020-11-30 02:11:35,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:35,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [205555778] [2020-11-30 02:11:35,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:35,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 02:11:35,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:35,988 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:11:35,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:36,009 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:11:36,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [205555778] [2020-11-30 02:11:36,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:11:36,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-11-30 02:11:36,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075242241] [2020-11-30 02:11:36,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:11:36,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:36,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:11:36,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:11:36,012 INFO L87 Difference]: Start difference. First operand 692 states and 880 transitions. Second operand 3 states. [2020-11-30 02:11:36,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:36,194 INFO L93 Difference]: Finished difference Result 1340 states and 1757 transitions. [2020-11-30 02:11:36,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:11:36,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2020-11-30 02:11:36,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:36,200 INFO L225 Difference]: With dead ends: 1340 [2020-11-30 02:11:36,200 INFO L226 Difference]: Without dead ends: 817 [2020-11-30 02:11:36,201 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:11:36,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2020-11-30 02:11:36,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 688. [2020-11-30 02:11:36,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2020-11-30 02:11:36,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 873 transitions. [2020-11-30 02:11:36,303 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 873 transitions. Word has length 83 [2020-11-30 02:11:36,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:36,303 INFO L481 AbstractCegarLoop]: Abstraction has 688 states and 873 transitions. [2020-11-30 02:11:36,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:11:36,304 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 873 transitions. [2020-11-30 02:11:36,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-11-30 02:11:36,305 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:36,305 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:11:36,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2020-11-30 02:11:36,519 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:11:36,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:36,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1680315765, now seen corresponding path program 1 times [2020-11-30 02:11:36,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:36,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765666606] [2020-11-30 02:11:36,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:36,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 02:11:36,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:36,734 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:11:36,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:36,752 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:11:36,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765666606] [2020-11-30 02:11:36,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:11:36,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2020-11-30 02:11:36,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916429613] [2020-11-30 02:11:36,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:11:36,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:36,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:11:36,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:11:36,754 INFO L87 Difference]: Start difference. First operand 688 states and 873 transitions. Second operand 6 states. [2020-11-30 02:11:37,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:37,107 INFO L93 Difference]: Finished difference Result 2083 states and 2771 transitions. [2020-11-30 02:11:37,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 02:11:37,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2020-11-30 02:11:37,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:37,115 INFO L225 Difference]: With dead ends: 2083 [2020-11-30 02:11:37,115 INFO L226 Difference]: Without dead ends: 1564 [2020-11-30 02:11:37,129 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:11:37,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2020-11-30 02:11:37,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 682. [2020-11-30 02:11:37,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2020-11-30 02:11:37,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 867 transitions. [2020-11-30 02:11:37,224 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 867 transitions. Word has length 83 [2020-11-30 02:11:37,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:37,224 INFO L481 AbstractCegarLoop]: Abstraction has 682 states and 867 transitions. [2020-11-30 02:11:37,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:11:37,224 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 867 transitions. [2020-11-30 02:11:37,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-11-30 02:11:37,226 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:37,226 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:11:37,440 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2020-11-30 02:11:37,440 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:11:37,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:37,441 INFO L82 PathProgramCache]: Analyzing trace with hash -246180747, now seen corresponding path program 1 times [2020-11-30 02:11:37,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:37,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642289389] [2020-11-30 02:11:37,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:37,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 02:11:37,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:37,635 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:11:37,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:37,658 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:11:37,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642289389] [2020-11-30 02:11:37,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:11:37,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-11-30 02:11:37,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445211162] [2020-11-30 02:11:37,659 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:11:37,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:37,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:11:37,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:11:37,660 INFO L87 Difference]: Start difference. First operand 682 states and 867 transitions. Second operand 6 states. [2020-11-30 02:11:37,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:37,993 INFO L93 Difference]: Finished difference Result 1224 states and 1595 transitions. [2020-11-30 02:11:37,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 02:11:37,994 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2020-11-30 02:11:37,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:38,000 INFO L225 Difference]: With dead ends: 1224 [2020-11-30 02:11:38,000 INFO L226 Difference]: Without dead ends: 1222 [2020-11-30 02:11:38,001 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:11:38,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2020-11-30 02:11:38,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 684. [2020-11-30 02:11:38,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2020-11-30 02:11:38,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 869 transitions. [2020-11-30 02:11:38,114 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 869 transitions. Word has length 87 [2020-11-30 02:11:38,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:38,114 INFO L481 AbstractCegarLoop]: Abstraction has 684 states and 869 transitions. [2020-11-30 02:11:38,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:11:38,114 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 869 transitions. [2020-11-30 02:11:38,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-30 02:11:38,115 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:38,116 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:11:38,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2020-11-30 02:11:38,321 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:11:38,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:38,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1488770823, now seen corresponding path program 1 times [2020-11-30 02:11:38,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:38,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1379154047] [2020-11-30 02:11:38,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:38,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 02:11:38,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:38,542 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:11:38,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:38,666 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:11:38,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1379154047] [2020-11-30 02:11:38,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:11:38,667 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2020-11-30 02:11:38,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547689407] [2020-11-30 02:11:38,668 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 02:11:38,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:38,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 02:11:38,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-30 02:11:38,669 INFO L87 Difference]: Start difference. First operand 684 states and 869 transitions. Second operand 10 states. [2020-11-30 02:11:39,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:39,091 INFO L93 Difference]: Finished difference Result 1592 states and 2125 transitions. [2020-11-30 02:11:39,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 02:11:39,091 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2020-11-30 02:11:39,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:39,098 INFO L225 Difference]: With dead ends: 1592 [2020-11-30 02:11:39,099 INFO L226 Difference]: Without dead ends: 1071 [2020-11-30 02:11:39,100 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:11:39,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2020-11-30 02:11:39,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 690. [2020-11-30 02:11:39,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2020-11-30 02:11:39,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 875 transitions. [2020-11-30 02:11:39,218 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 875 transitions. Word has length 88 [2020-11-30 02:11:39,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:39,218 INFO L481 AbstractCegarLoop]: Abstraction has 690 states and 875 transitions. [2020-11-30 02:11:39,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 02:11:39,218 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 875 transitions. [2020-11-30 02:11:39,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-11-30 02:11:39,220 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:39,220 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] [2020-11-30 02:11:39,421 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2020-11-30 02:11:39,421 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:11:39,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:39,422 INFO L82 PathProgramCache]: Analyzing trace with hash -306219226, now seen corresponding path program 1 times [2020-11-30 02:11:39,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:39,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571299133] [2020-11-30 02:11:39,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:39,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-30 02:11:39,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:39,837 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:11:39,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:40,148 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:11:40,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571299133] [2020-11-30 02:11:40,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1427166418] [2020-11-30 02:11:40,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:40,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-30 02:11:40,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:40,606 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:11:40,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:40,669 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:11:40,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642048671] [2020-11-30 02:11:40,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:40,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-30 02:11:40,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:40,947 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:11:40,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:41,013 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:11:41,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-11-30 02:11:41,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9, 9] total 17 [2020-11-30 02:11:41,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720549502] [2020-11-30 02:11:41,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-30 02:11:41,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:41,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-30 02:11:41,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2020-11-30 02:11:41,015 INFO L87 Difference]: Start difference. First operand 690 states and 875 transitions. Second operand 18 states. [2020-11-30 02:11:44,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:44,090 INFO L93 Difference]: Finished difference Result 2543 states and 3316 transitions. [2020-11-30 02:11:44,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2020-11-30 02:11:44,090 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 137 [2020-11-30 02:11:44,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:44,102 INFO L225 Difference]: With dead ends: 2543 [2020-11-30 02:11:44,102 INFO L226 Difference]: Without dead ends: 2022 [2020-11-30 02:11:44,105 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 858 GetRequests, 791 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:11:44,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2020-11-30 02:11:44,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 1012. [2020-11-30 02:11:44,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2020-11-30 02:11:44,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1289 transitions. [2020-11-30 02:11:44,327 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1289 transitions. Word has length 137 [2020-11-30 02:11:44,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:44,327 INFO L481 AbstractCegarLoop]: Abstraction has 1012 states and 1289 transitions. [2020-11-30 02:11:44,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-30 02:11:44,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1289 transitions. [2020-11-30 02:11:44,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-11-30 02:11:44,331 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:44,331 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] [2020-11-30 02:11:44,948 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:11:44,949 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:11:44,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:44,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1826559228, now seen corresponding path program 1 times [2020-11-30 02:11:44,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:44,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918696004] [2020-11-30 02:11:44,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:45,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-30 02:11:45,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:45,512 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:11:45,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:45,814 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:11:45,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1918696004] [2020-11-30 02:11:45,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1315611964] [2020-11-30 02:11:45,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:46,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-30 02:11:46,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:46,230 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:11:46,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:46,314 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:11:46,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756695112] [2020-11-30 02:11:46,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:46,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-30 02:11:46,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:46,582 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:11:46,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:46,683 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:11:46,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-11-30 02:11:46,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9, 9] total 17 [2020-11-30 02:11:46,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212578584] [2020-11-30 02:11:46,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-30 02:11:46,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:46,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-30 02:11:46,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2020-11-30 02:11:46,686 INFO L87 Difference]: Start difference. First operand 1012 states and 1289 transitions. Second operand 18 states. [2020-11-30 02:11:50,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:50,262 INFO L93 Difference]: Finished difference Result 3871 states and 5067 transitions. [2020-11-30 02:11:50,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2020-11-30 02:11:50,263 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 138 [2020-11-30 02:11:50,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:50,279 INFO L225 Difference]: With dead ends: 3871 [2020-11-30 02:11:50,279 INFO L226 Difference]: Without dead ends: 3097 [2020-11-30 02:11:50,283 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 868 GetRequests, 795 SyntacticMatches, 11 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=757, Invalid=3275, Unknown=0, NotChecked=0, Total=4032 [2020-11-30 02:11:50,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3097 states. [2020-11-30 02:11:50,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3097 to 1532. [2020-11-30 02:11:50,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1532 states. [2020-11-30 02:11:50,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1964 transitions. [2020-11-30 02:11:50,643 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1964 transitions. Word has length 138 [2020-11-30 02:11:50,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:50,643 INFO L481 AbstractCegarLoop]: Abstraction has 1532 states and 1964 transitions. [2020-11-30 02:11:50,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-30 02:11:50,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1964 transitions. [2020-11-30 02:11:50,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-11-30 02:11:50,647 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:50,648 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] [2020-11-30 02:11:51,280 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:11:51,281 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:11:51,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:51,281 INFO L82 PathProgramCache]: Analyzing trace with hash 2091174721, now seen corresponding path program 1 times [2020-11-30 02:11:51,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:51,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [849894009] [2020-11-30 02:11:51,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:51,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 02:11:51,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:51,631 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:11:51,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:51,768 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:11:51,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [849894009] [2020-11-30 02:11:51,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [26095082] [2020-11-30 02:11:51,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:52,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 02:11:52,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:52,144 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:11:52,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:52,217 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:11:52,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896334532] [2020-11-30 02:11:52,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:52,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 02:11:52,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:52,484 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:11:52,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:52,613 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:11:52,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-11-30 02:11:52,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 11 [2020-11-30 02:11:52,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595521238] [2020-11-30 02:11:52,615 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-30 02:11:52,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:52,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-30 02:11:52,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-11-30 02:11:52,616 INFO L87 Difference]: Start difference. First operand 1532 states and 1964 transitions. Second operand 12 states. [2020-11-30 02:11:54,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:54,409 INFO L93 Difference]: Finished difference Result 5752 states and 7631 transitions. [2020-11-30 02:11:54,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-30 02:11:54,410 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 139 [2020-11-30 02:11:54,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:54,423 INFO L225 Difference]: With dead ends: 5752 [2020-11-30 02:11:54,424 INFO L226 Difference]: Without dead ends: 4552 [2020-11-30 02:11:54,427 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 846 GetRequests, 809 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=251, Invalid=619, Unknown=0, NotChecked=0, Total=870 [2020-11-30 02:11:54,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4552 states. [2020-11-30 02:11:54,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4552 to 1824. [2020-11-30 02:11:54,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2020-11-30 02:11:54,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2366 transitions. [2020-11-30 02:11:54,825 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2366 transitions. Word has length 139 [2020-11-30 02:11:54,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:54,826 INFO L481 AbstractCegarLoop]: Abstraction has 1824 states and 2366 transitions. [2020-11-30 02:11:54,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-30 02:11:54,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2366 transitions. [2020-11-30 02:11:54,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-11-30 02:11:54,830 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:54,831 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] [2020-11-30 02:11:55,454 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:11:55,454 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:11:55,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:55,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1358835379, now seen corresponding path program 1 times [2020-11-30 02:11:55,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:55,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136679327] [2020-11-30 02:11:55,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:55,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 02:11:55,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:55,791 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:11:55,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:55,893 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:11:55,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136679327] [2020-11-30 02:11:55,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1304579871] [2020-11-30 02:11:55,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:56,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 02:11:56,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:56,306 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:11:56,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:56,360 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:11:56,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 2 imperfect interpolant sequences. [2020-11-30 02:11:56,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7, 7] total 16 [2020-11-30 02:11:56,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970267772] [2020-11-30 02:11:56,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:11:56,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:56,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:11:56,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2020-11-30 02:11:56,363 INFO L87 Difference]: Start difference. First operand 1824 states and 2366 transitions. Second operand 6 states. [2020-11-30 02:11:58,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:11:58,097 INFO L93 Difference]: Finished difference Result 8952 states and 11973 transitions. [2020-11-30 02:11:58,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-30 02:11:58,098 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2020-11-30 02:11:58,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:11:58,113 INFO L225 Difference]: With dead ends: 8952 [2020-11-30 02:11:58,113 INFO L226 Difference]: Without dead ends: 7460 [2020-11-30 02:11:58,117 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 543 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2020-11-30 02:11:58,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7460 states. [2020-11-30 02:11:58,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7460 to 2243. [2020-11-30 02:11:58,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2243 states. [2020-11-30 02:11:58,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 2853 transitions. [2020-11-30 02:11:58,683 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 2853 transitions. Word has length 140 [2020-11-30 02:11:58,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:11:58,683 INFO L481 AbstractCegarLoop]: Abstraction has 2243 states and 2853 transitions. [2020-11-30 02:11:58,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:11:58,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 2853 transitions. [2020-11-30 02:11:58,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-11-30 02:11:58,689 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:11:58,689 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] [2020-11-30 02:11:59,102 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:11:59,103 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:11:59,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:11:59,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1872137183, now seen corresponding path program 1 times [2020-11-30 02:11:59,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:11:59,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284080603] [2020-11-30 02:11:59,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:11:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:11:59,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 02:11:59,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:11:59,458 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:11:59,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:11:59,500 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:11:59,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284080603] [2020-11-30 02:11:59,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:11:59,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2020-11-30 02:11:59,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708854519] [2020-11-30 02:11:59,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:11:59,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:11:59,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:11:59,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:11:59,504 INFO L87 Difference]: Start difference. First operand 2243 states and 2853 transitions. Second operand 6 states. [2020-11-30 02:12:00,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:12:00,487 INFO L93 Difference]: Finished difference Result 6401 states and 8319 transitions. [2020-11-30 02:12:00,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 02:12:00,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2020-11-30 02:12:00,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:12:00,498 INFO L225 Difference]: With dead ends: 6401 [2020-11-30 02:12:00,498 INFO L226 Difference]: Without dead ends: 4470 [2020-11-30 02:12:00,502 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 274 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:12:00,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4470 states. [2020-11-30 02:12:01,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4470 to 2243. [2020-11-30 02:12:01,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2243 states. [2020-11-30 02:12:01,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 2851 transitions. [2020-11-30 02:12:01,015 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 2851 transitions. Word has length 140 [2020-11-30 02:12:01,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:12:01,016 INFO L481 AbstractCegarLoop]: Abstraction has 2243 states and 2851 transitions. [2020-11-30 02:12:01,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:12:01,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 2851 transitions. [2020-11-30 02:12:01,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-11-30 02:12:01,022 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:12:01,022 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] [2020-11-30 02:12:01,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 mathsat -unsat_core_generation=3 [2020-11-30 02:12:01,235 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:12:01,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:12:01,236 INFO L82 PathProgramCache]: Analyzing trace with hash -531708588, now seen corresponding path program 1 times [2020-11-30 02:12:01,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:12:01,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424879190] [2020-11-30 02:12:01,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/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:12:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 02:12:01,535 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 02:12:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 02:12:01,726 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 02:12:02,089 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-11-30 02:12:02,089 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 02:12:02,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 mathsat -unsat_core_generation=3 [2020-11-30 02:12:02,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 02:12:02 BoogieIcfgContainer [2020-11-30 02:12:02,654 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 02:12:02,655 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 02:12:02,655 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 02:12:02,655 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 02:12:02,656 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:11:13" (3/4) ... [2020-11-30 02:12:02,658 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 02:12:02,923 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f22b0d33-6873-47aa-8efc-f5a24c87c9bf/bin/utaipan/witness.graphml [2020-11-30 02:12:02,923 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 02:12:02,926 INFO L168 Benchmark]: Toolchain (without parser) took 52577.04 ms. Allocated memory was 67.1 MB in the beginning and 824.2 MB in the end (delta: 757.1 MB). Free memory was 46.6 MB in the beginning and 391.6 MB in the end (delta: -345.0 MB). Peak memory consumption was 414.6 MB. Max. memory is 16.1 GB. [2020-11-30 02:12:02,926 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 67.1 MB. Free memory is still 48.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 02:12:02,927 INFO L168 Benchmark]: CACSL2BoogieTranslator took 653.66 ms. Allocated memory is still 67.1 MB. Free memory was 46.4 MB in the beginning and 44.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-11-30 02:12:02,927 INFO L168 Benchmark]: Boogie Procedure Inliner took 141.12 ms. Allocated memory is still 67.1 MB. Free memory was 44.6 MB in the beginning and 39.8 MB in the end (delta: 4.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-30 02:12:02,928 INFO L168 Benchmark]: Boogie Preprocessor took 109.91 ms. Allocated memory is still 67.1 MB. Free memory was 39.8 MB in the beginning and 36.2 MB in the end (delta: 3.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 02:12:02,928 INFO L168 Benchmark]: RCFGBuilder took 2003.23 ms. Allocated memory was 67.1 MB in the beginning and 88.1 MB in the end (delta: 21.0 MB). Free memory was 36.2 MB in the beginning and 42.7 MB in the end (delta: -6.5 MB). Peak memory consumption was 23.7 MB. Max. memory is 16.1 GB. [2020-11-30 02:12:02,929 INFO L168 Benchmark]: TraceAbstraction took 49391.79 ms. Allocated memory was 88.1 MB in the beginning and 824.2 MB in the end (delta: 736.1 MB). Free memory was 42.1 MB in the beginning and 436.7 MB in the end (delta: -394.5 MB). Peak memory consumption was 341.1 MB. Max. memory is 16.1 GB. [2020-11-30 02:12:02,929 INFO L168 Benchmark]: Witness Printer took 269.02 ms. Allocated memory is still 824.2 MB. Free memory was 436.7 MB in the beginning and 391.6 MB in the end (delta: 45.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 16.1 GB. [2020-11-30 02:12:02,932 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.31 ms. Allocated memory is still 67.1 MB. Free memory is still 48.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 653.66 ms. Allocated memory is still 67.1 MB. Free memory was 46.4 MB in the beginning and 44.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 141.12 ms. Allocated memory is still 67.1 MB. Free memory was 44.6 MB in the beginning and 39.8 MB in the end (delta: 4.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 109.91 ms. Allocated memory is still 67.1 MB. Free memory was 39.8 MB in the beginning and 36.2 MB in the end (delta: 3.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2003.23 ms. Allocated memory was 67.1 MB in the beginning and 88.1 MB in the end (delta: 21.0 MB). Free memory was 36.2 MB in the beginning and 42.7 MB in the end (delta: -6.5 MB). Peak memory consumption was 23.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 49391.79 ms. Allocated memory was 88.1 MB in the beginning and 824.2 MB in the end (delta: 736.1 MB). Free memory was 42.1 MB in the beginning and 436.7 MB in the end (delta: -394.5 MB). Peak memory consumption was 341.1 MB. Max. memory is 16.1 GB. * Witness Printer took 269.02 ms. Allocated memory is still 824.2 MB. Free memory was 436.7 MB in the beginning and 391.6 MB in the end (delta: 45.1 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 1 [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() [L608] 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] [L574] COND TRUE 1 [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() [L608] 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.UNBOUNDED.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, 317 locations, 23 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 48.9s, OverallIterations: 34, TraceHistogramMax: 2, AutomataDifference: 20.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 14159 SDtfs, 33812 SDslu, 39792 SDs, 0 SdLazy, 5472 SolverSat, 469 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7222 GetRequests, 6822 SyntacticMatches, 54 SemanticMatches, 346 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2370 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2243occurred 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.9s AutomataMinimizationTime, 33 MinimizatonAttempts, 22941 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2.3s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 3677 NumberOfCodeBlocks, 3677 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 6992 ConstructedInterpolants, 0 QuantifiedInterpolants, 2554846 SizeOfPredicates, 121 NumberOfNonLiveVariables, 11591 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...