./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix016_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ab81682c-dd23-4b4d-b324-911df412abb5/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ab81682c-dd23-4b4d-b324-911df412abb5/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ab81682c-dd23-4b4d-b324-911df412abb5/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ab81682c-dd23-4b4d-b324-911df412abb5/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix016_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ab81682c-dd23-4b4d-b324-911df412abb5/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ab81682c-dd23-4b4d-b324-911df412abb5/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf20c345c36ec06b443bd96a4c96f453b9e252aa .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 19:21:55,669 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:21:55,670 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:21:55,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:21:55,679 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:21:55,679 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:21:55,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:21:55,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:21:55,684 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:21:55,685 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:21:55,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:21:55,686 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:21:55,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:21:55,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:21:55,688 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:21:55,689 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:21:55,690 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:21:55,691 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:21:55,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:21:55,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:21:55,696 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:21:55,697 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:21:55,698 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:21:55,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:21:55,701 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:21:55,701 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:21:55,701 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:21:55,702 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:21:55,702 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:21:55,703 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:21:55,703 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:21:55,703 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:21:55,704 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:21:55,704 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:21:55,705 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:21:55,705 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:21:55,706 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:21:55,706 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:21:55,706 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:21:55,707 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:21:55,707 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:21:55,708 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ab81682c-dd23-4b4d-b324-911df412abb5/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 19:21:55,720 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:21:55,720 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:21:55,720 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:21:55,721 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:21:55,721 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:21:55,721 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:21:55,721 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:21:55,721 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:21:55,721 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:21:55,721 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:21:55,721 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:21:55,721 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:21:55,722 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:21:55,722 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:21:55,722 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:21:55,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:21:55,723 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:21:55,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:21:55,723 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:21:55,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:21:55,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:21:55,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:21:55,723 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:21:55,723 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:21:55,723 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:21:55,724 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:21:55,724 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:21:55,724 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:21:55,724 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:21:55,724 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:21:55,724 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:21:55,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:21:55,724 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:21:55,725 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:21:55,725 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:21:55,725 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:21:55,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:21:55,725 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:21:55,725 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:21:55,725 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:21:55,725 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_ab81682c-dd23-4b4d-b324-911df412abb5/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(__VERIFIER_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 -> bf20c345c36ec06b443bd96a4c96f453b9e252aa [2019-12-07 19:21:55,834 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:21:55,844 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:21:55,847 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:21:55,848 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:21:55,849 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:21:55,849 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ab81682c-dd23-4b4d-b324-911df412abb5/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix016_rmo.opt.i [2019-12-07 19:21:55,891 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ab81682c-dd23-4b4d-b324-911df412abb5/bin/utaipan/data/c28e9f836/ce8e41818af94021a457f8a765093d8e/FLAG690624885 [2019-12-07 19:21:56,336 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:21:56,336 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ab81682c-dd23-4b4d-b324-911df412abb5/sv-benchmarks/c/pthread-wmm/mix016_rmo.opt.i [2019-12-07 19:21:56,347 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ab81682c-dd23-4b4d-b324-911df412abb5/bin/utaipan/data/c28e9f836/ce8e41818af94021a457f8a765093d8e/FLAG690624885 [2019-12-07 19:21:56,355 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ab81682c-dd23-4b4d-b324-911df412abb5/bin/utaipan/data/c28e9f836/ce8e41818af94021a457f8a765093d8e [2019-12-07 19:21:56,357 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:21:56,358 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:21:56,359 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:21:56,359 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:21:56,361 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:21:56,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:21:56" (1/1) ... [2019-12-07 19:21:56,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2ff042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:21:56, skipping insertion in model container [2019-12-07 19:21:56,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:21:56" (1/1) ... [2019-12-07 19:21:56,368 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:21:56,396 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:21:56,634 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:21:56,642 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:21:56,684 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:21:56,729 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:21:56,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:21:56 WrapperNode [2019-12-07 19:21:56,730 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:21:56,730 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:21:56,730 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:21:56,730 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:21:56,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:21:56" (1/1) ... [2019-12-07 19:21:56,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:21:56" (1/1) ... [2019-12-07 19:21:56,768 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:21:56,768 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:21:56,768 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:21:56,768 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:21:56,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:21:56" (1/1) ... [2019-12-07 19:21:56,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:21:56" (1/1) ... [2019-12-07 19:21:56,778 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:21:56" (1/1) ... [2019-12-07 19:21:56,778 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:21:56" (1/1) ... [2019-12-07 19:21:56,785 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:21:56" (1/1) ... [2019-12-07 19:21:56,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:21:56" (1/1) ... [2019-12-07 19:21:56,790 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:21:56" (1/1) ... [2019-12-07 19:21:56,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:21:56,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:21:56,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:21:56,794 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:21:56,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:21:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab81682c-dd23-4b4d-b324-911df412abb5/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 [2019-12-07 19:21:56,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 19:21:56,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 19:21:56,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 19:21:56,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 19:21:56,834 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 19:21:56,834 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 19:21:56,834 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 19:21:56,834 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 19:21:56,834 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 19:21:56,834 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 19:21:56,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 19:21:56,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:21:56,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:21:56,835 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 19:21:57,192 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:21:57,192 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 19:21:57,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:21:57 BoogieIcfgContainer [2019-12-07 19:21:57,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:21:57,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:21:57,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:21:57,196 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:21:57,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:21:56" (1/3) ... [2019-12-07 19:21:57,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47056afe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:21:57, skipping insertion in model container [2019-12-07 19:21:57,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:21:56" (2/3) ... [2019-12-07 19:21:57,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47056afe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:21:57, skipping insertion in model container [2019-12-07 19:21:57,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:21:57" (3/3) ... [2019-12-07 19:21:57,198 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_rmo.opt.i [2019-12-07 19:21:57,204 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 19:21:57,204 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:21:57,208 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 19:21:57,209 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 19:21:57,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,235 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,235 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,247 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,247 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,247 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,247 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,247 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,251 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,251 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:21:57,265 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 19:21:57,277 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:21:57,277 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:21:57,277 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:21:57,278 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:21:57,278 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:21:57,278 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:21:57,278 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:21:57,278 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:21:57,289 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-07 19:21:57,290 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-07 19:21:57,342 INFO L134 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-07 19:21:57,342 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:21:57,352 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 712 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 19:21:57,367 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-07 19:21:57,393 INFO L134 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-07 19:21:57,393 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:21:57,398 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 712 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 19:21:57,414 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-07 19:21:57,415 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 19:22:00,407 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-12-07 19:22:00,580 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-07 19:22:00,670 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75392 [2019-12-07 19:22:00,670 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-07 19:22:00,673 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 91 transitions [2019-12-07 19:22:09,843 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86190 states. [2019-12-07 19:22:09,845 INFO L276 IsEmpty]: Start isEmpty. Operand 86190 states. [2019-12-07 19:22:09,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 19:22:09,849 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:09,849 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 19:22:09,849 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:09,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:09,853 INFO L82 PathProgramCache]: Analyzing trace with hash 802149997, now seen corresponding path program 1 times [2019-12-07 19:22:09,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:09,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300037564] [2019-12-07 19:22:09,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:09,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:09,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300037564] [2019-12-07 19:22:09,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:09,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:22:09,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052610718] [2019-12-07 19:22:10,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:22:10,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:10,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:22:10,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:22:10,011 INFO L87 Difference]: Start difference. First operand 86190 states. Second operand 3 states. [2019-12-07 19:22:10,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:10,582 INFO L93 Difference]: Finished difference Result 85100 states and 365324 transitions. [2019-12-07 19:22:10,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:22:10,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 19:22:10,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:10,955 INFO L225 Difference]: With dead ends: 85100 [2019-12-07 19:22:10,956 INFO L226 Difference]: Without dead ends: 79822 [2019-12-07 19:22:10,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:22:14,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79822 states. [2019-12-07 19:22:15,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79822 to 79822. [2019-12-07 19:22:15,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79822 states. [2019-12-07 19:22:15,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79822 states to 79822 states and 342168 transitions. [2019-12-07 19:22:15,607 INFO L78 Accepts]: Start accepts. Automaton has 79822 states and 342168 transitions. Word has length 5 [2019-12-07 19:22:15,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:15,607 INFO L462 AbstractCegarLoop]: Abstraction has 79822 states and 342168 transitions. [2019-12-07 19:22:15,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:22:15,607 INFO L276 IsEmpty]: Start isEmpty. Operand 79822 states and 342168 transitions. [2019-12-07 19:22:15,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:22:15,616 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:15,616 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:15,616 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:15,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:15,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1460490103, now seen corresponding path program 1 times [2019-12-07 19:22:15,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:15,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554667788] [2019-12-07 19:22:15,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:15,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:15,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554667788] [2019-12-07 19:22:15,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:15,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:22:15,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973970428] [2019-12-07 19:22:15,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:22:15,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:15,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:22:15,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:22:15,676 INFO L87 Difference]: Start difference. First operand 79822 states and 342168 transitions. Second operand 3 states. [2019-12-07 19:22:15,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:15,863 INFO L93 Difference]: Finished difference Result 21012 states and 72403 transitions. [2019-12-07 19:22:15,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:22:15,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 19:22:15,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:15,930 INFO L225 Difference]: With dead ends: 21012 [2019-12-07 19:22:15,930 INFO L226 Difference]: Without dead ends: 21012 [2019-12-07 19:22:15,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:22:16,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21012 states. [2019-12-07 19:22:16,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21012 to 21012. [2019-12-07 19:22:16,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21012 states. [2019-12-07 19:22:16,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21012 states to 21012 states and 72403 transitions. [2019-12-07 19:22:16,301 INFO L78 Accepts]: Start accepts. Automaton has 21012 states and 72403 transitions. Word has length 13 [2019-12-07 19:22:16,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:16,301 INFO L462 AbstractCegarLoop]: Abstraction has 21012 states and 72403 transitions. [2019-12-07 19:22:16,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:22:16,301 INFO L276 IsEmpty]: Start isEmpty. Operand 21012 states and 72403 transitions. [2019-12-07 19:22:16,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:22:16,303 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:16,303 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:16,303 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:16,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:16,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1843446667, now seen corresponding path program 1 times [2019-12-07 19:22:16,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:16,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772072752] [2019-12-07 19:22:16,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:16,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:16,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772072752] [2019-12-07 19:22:16,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:16,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:22:16,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415920942] [2019-12-07 19:22:16,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:22:16,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:16,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:22:16,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:22:16,350 INFO L87 Difference]: Start difference. First operand 21012 states and 72403 transitions. Second operand 4 states. [2019-12-07 19:22:16,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:16,576 INFO L93 Difference]: Finished difference Result 31168 states and 104167 transitions. [2019-12-07 19:22:16,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:22:16,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 19:22:16,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:16,628 INFO L225 Difference]: With dead ends: 31168 [2019-12-07 19:22:16,628 INFO L226 Difference]: Without dead ends: 31154 [2019-12-07 19:22:16,628 INFO L630 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 [2019-12-07 19:22:16,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31154 states. [2019-12-07 19:22:18,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31154 to 27751. [2019-12-07 19:22:18,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27751 states. [2019-12-07 19:22:18,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27751 states to 27751 states and 93636 transitions. [2019-12-07 19:22:18,083 INFO L78 Accepts]: Start accepts. Automaton has 27751 states and 93636 transitions. Word has length 13 [2019-12-07 19:22:18,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:18,083 INFO L462 AbstractCegarLoop]: Abstraction has 27751 states and 93636 transitions. [2019-12-07 19:22:18,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:22:18,083 INFO L276 IsEmpty]: Start isEmpty. Operand 27751 states and 93636 transitions. [2019-12-07 19:22:18,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:22:18,085 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:18,085 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:18,085 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:18,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:18,085 INFO L82 PathProgramCache]: Analyzing trace with hash 890356816, now seen corresponding path program 1 times [2019-12-07 19:22:18,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:18,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049971865] [2019-12-07 19:22:18,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:18,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:18,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049971865] [2019-12-07 19:22:18,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:18,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:22:18,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136943247] [2019-12-07 19:22:18,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:22:18,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:18,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:22:18,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:22:18,137 INFO L87 Difference]: Start difference. First operand 27751 states and 93636 transitions. Second operand 5 states. [2019-12-07 19:22:18,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:18,435 INFO L93 Difference]: Finished difference Result 40618 states and 134851 transitions. [2019-12-07 19:22:18,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:22:18,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 19:22:18,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:18,500 INFO L225 Difference]: With dead ends: 40618 [2019-12-07 19:22:18,500 INFO L226 Difference]: Without dead ends: 40602 [2019-12-07 19:22:18,501 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:22:18,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40602 states. [2019-12-07 19:22:19,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40602 to 32075. [2019-12-07 19:22:19,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32075 states. [2019-12-07 19:22:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32075 states to 32075 states and 107493 transitions. [2019-12-07 19:22:19,138 INFO L78 Accepts]: Start accepts. Automaton has 32075 states and 107493 transitions. Word has length 14 [2019-12-07 19:22:19,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:19,139 INFO L462 AbstractCegarLoop]: Abstraction has 32075 states and 107493 transitions. [2019-12-07 19:22:19,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:22:19,139 INFO L276 IsEmpty]: Start isEmpty. Operand 32075 states and 107493 transitions. [2019-12-07 19:22:19,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 19:22:19,150 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:19,150 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:19,150 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:19,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:19,150 INFO L82 PathProgramCache]: Analyzing trace with hash 454702152, now seen corresponding path program 1 times [2019-12-07 19:22:19,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:19,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081044114] [2019-12-07 19:22:19,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:19,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:19,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081044114] [2019-12-07 19:22:19,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:19,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:22:19,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11372561] [2019-12-07 19:22:19,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:22:19,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:19,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:22:19,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:22:19,213 INFO L87 Difference]: Start difference. First operand 32075 states and 107493 transitions. Second operand 6 states. [2019-12-07 19:22:19,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:19,788 INFO L93 Difference]: Finished difference Result 48617 states and 159685 transitions. [2019-12-07 19:22:19,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 19:22:19,789 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 19:22:19,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:19,860 INFO L225 Difference]: With dead ends: 48617 [2019-12-07 19:22:19,860 INFO L226 Difference]: Without dead ends: 48589 [2019-12-07 19:22:19,861 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 19:22:20,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48589 states. [2019-12-07 19:22:20,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48589 to 33099. [2019-12-07 19:22:20,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33099 states. [2019-12-07 19:22:20,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33099 states to 33099 states and 109984 transitions. [2019-12-07 19:22:20,614 INFO L78 Accepts]: Start accepts. Automaton has 33099 states and 109984 transitions. Word has length 22 [2019-12-07 19:22:20,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:20,615 INFO L462 AbstractCegarLoop]: Abstraction has 33099 states and 109984 transitions. [2019-12-07 19:22:20,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:22:20,615 INFO L276 IsEmpty]: Start isEmpty. Operand 33099 states and 109984 transitions. [2019-12-07 19:22:20,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 19:22:20,627 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:20,627 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:20,627 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:20,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:20,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1218687100, now seen corresponding path program 1 times [2019-12-07 19:22:20,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:20,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733474456] [2019-12-07 19:22:20,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:20,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:20,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733474456] [2019-12-07 19:22:20,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:20,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:22:20,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348088395] [2019-12-07 19:22:20,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:22:20,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:20,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:22:20,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:22:20,678 INFO L87 Difference]: Start difference. First operand 33099 states and 109984 transitions. Second operand 5 states. [2019-12-07 19:22:21,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:21,040 INFO L93 Difference]: Finished difference Result 44410 states and 145510 transitions. [2019-12-07 19:22:21,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:22:21,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 19:22:21,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:21,106 INFO L225 Difference]: With dead ends: 44410 [2019-12-07 19:22:21,106 INFO L226 Difference]: Without dead ends: 44386 [2019-12-07 19:22:21,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:22:21,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44386 states. [2019-12-07 19:22:21,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44386 to 37188. [2019-12-07 19:22:21,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37188 states. [2019-12-07 19:22:21,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37188 states to 37188 states and 122796 transitions. [2019-12-07 19:22:21,801 INFO L78 Accepts]: Start accepts. Automaton has 37188 states and 122796 transitions. Word has length 25 [2019-12-07 19:22:21,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:21,802 INFO L462 AbstractCegarLoop]: Abstraction has 37188 states and 122796 transitions. [2019-12-07 19:22:21,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:22:21,802 INFO L276 IsEmpty]: Start isEmpty. Operand 37188 states and 122796 transitions. [2019-12-07 19:22:21,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 19:22:21,817 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:21,817 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:21,817 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:21,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:21,817 INFO L82 PathProgramCache]: Analyzing trace with hash 191244626, now seen corresponding path program 1 times [2019-12-07 19:22:21,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:21,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361026527] [2019-12-07 19:22:21,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:21,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:21,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361026527] [2019-12-07 19:22:21,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:21,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:22:21,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136087231] [2019-12-07 19:22:21,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:22:21,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:21,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:22:21,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:22:21,883 INFO L87 Difference]: Start difference. First operand 37188 states and 122796 transitions. Second operand 6 states. [2019-12-07 19:22:22,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:22,337 INFO L93 Difference]: Finished difference Result 54689 states and 179263 transitions. [2019-12-07 19:22:22,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 19:22:22,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-07 19:22:22,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:22,427 INFO L225 Difference]: With dead ends: 54689 [2019-12-07 19:22:22,428 INFO L226 Difference]: Without dead ends: 54645 [2019-12-07 19:22:22,428 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:22:22,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54645 states. [2019-12-07 19:22:23,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54645 to 38894. [2019-12-07 19:22:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38894 states. [2019-12-07 19:22:23,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38894 states to 38894 states and 128348 transitions. [2019-12-07 19:22:23,289 INFO L78 Accepts]: Start accepts. Automaton has 38894 states and 128348 transitions. Word has length 27 [2019-12-07 19:22:23,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:23,289 INFO L462 AbstractCegarLoop]: Abstraction has 38894 states and 128348 transitions. [2019-12-07 19:22:23,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:22:23,289 INFO L276 IsEmpty]: Start isEmpty. Operand 38894 states and 128348 transitions. [2019-12-07 19:22:23,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 19:22:23,308 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:23,308 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:23,308 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:23,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:23,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1914419867, now seen corresponding path program 1 times [2019-12-07 19:22:23,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:23,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048895987] [2019-12-07 19:22:23,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:23,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:23,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048895987] [2019-12-07 19:22:23,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:23,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:22:23,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505489514] [2019-12-07 19:22:23,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:22:23,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:23,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:22:23,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:22:23,367 INFO L87 Difference]: Start difference. First operand 38894 states and 128348 transitions. Second operand 5 states. [2019-12-07 19:22:23,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:23,827 INFO L93 Difference]: Finished difference Result 53533 states and 175344 transitions. [2019-12-07 19:22:23,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:22:23,828 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 19:22:23,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:23,915 INFO L225 Difference]: With dead ends: 53533 [2019-12-07 19:22:23,916 INFO L226 Difference]: Without dead ends: 53533 [2019-12-07 19:22:23,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:22:24,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53533 states. [2019-12-07 19:22:24,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53533 to 46904. [2019-12-07 19:22:24,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46904 states. [2019-12-07 19:22:24,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46904 states to 46904 states and 154341 transitions. [2019-12-07 19:22:24,760 INFO L78 Accepts]: Start accepts. Automaton has 46904 states and 154341 transitions. Word has length 28 [2019-12-07 19:22:24,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:24,760 INFO L462 AbstractCegarLoop]: Abstraction has 46904 states and 154341 transitions. [2019-12-07 19:22:24,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:22:24,760 INFO L276 IsEmpty]: Start isEmpty. Operand 46904 states and 154341 transitions. [2019-12-07 19:22:24,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 19:22:24,789 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:24,790 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:24,790 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:24,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:24,790 INFO L82 PathProgramCache]: Analyzing trace with hash -916578417, now seen corresponding path program 1 times [2019-12-07 19:22:24,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:24,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989728693] [2019-12-07 19:22:24,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:24,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:24,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989728693] [2019-12-07 19:22:24,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:24,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:22:24,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618714338] [2019-12-07 19:22:24,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:22:24,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:24,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:22:24,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:22:24,829 INFO L87 Difference]: Start difference. First operand 46904 states and 154341 transitions. Second operand 4 states. [2019-12-07 19:22:24,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:24,897 INFO L93 Difference]: Finished difference Result 19460 states and 59560 transitions. [2019-12-07 19:22:24,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:22:24,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-07 19:22:24,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:24,920 INFO L225 Difference]: With dead ends: 19460 [2019-12-07 19:22:24,921 INFO L226 Difference]: Without dead ends: 19460 [2019-12-07 19:22:24,921 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:22:24,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19460 states. [2019-12-07 19:22:25,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19460 to 18663. [2019-12-07 19:22:25,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18663 states. [2019-12-07 19:22:25,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18663 states to 18663 states and 57156 transitions. [2019-12-07 19:22:25,190 INFO L78 Accepts]: Start accepts. Automaton has 18663 states and 57156 transitions. Word has length 29 [2019-12-07 19:22:25,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:25,190 INFO L462 AbstractCegarLoop]: Abstraction has 18663 states and 57156 transitions. [2019-12-07 19:22:25,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:22:25,190 INFO L276 IsEmpty]: Start isEmpty. Operand 18663 states and 57156 transitions. [2019-12-07 19:22:25,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 19:22:25,213 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:25,213 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:25,214 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:25,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:25,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1155983199, now seen corresponding path program 1 times [2019-12-07 19:22:25,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:25,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849298789] [2019-12-07 19:22:25,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:25,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:25,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849298789] [2019-12-07 19:22:25,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:25,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:22:25,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684705027] [2019-12-07 19:22:25,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:22:25,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:25,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:22:25,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:22:25,373 INFO L87 Difference]: Start difference. First operand 18663 states and 57156 transitions. Second operand 7 states. [2019-12-07 19:22:26,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:26,040 INFO L93 Difference]: Finished difference Result 22399 states and 67051 transitions. [2019-12-07 19:22:26,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 19:22:26,041 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-07 19:22:26,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:26,065 INFO L225 Difference]: With dead ends: 22399 [2019-12-07 19:22:26,065 INFO L226 Difference]: Without dead ends: 22395 [2019-12-07 19:22:26,065 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2019-12-07 19:22:26,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22395 states. [2019-12-07 19:22:26,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22395 to 17745. [2019-12-07 19:22:26,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17745 states. [2019-12-07 19:22:26,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17745 states to 17745 states and 54352 transitions. [2019-12-07 19:22:26,351 INFO L78 Accepts]: Start accepts. Automaton has 17745 states and 54352 transitions. Word has length 39 [2019-12-07 19:22:26,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:26,352 INFO L462 AbstractCegarLoop]: Abstraction has 17745 states and 54352 transitions. [2019-12-07 19:22:26,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:22:26,352 INFO L276 IsEmpty]: Start isEmpty. Operand 17745 states and 54352 transitions. [2019-12-07 19:22:26,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 19:22:26,368 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:26,369 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:26,369 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:26,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:26,369 INFO L82 PathProgramCache]: Analyzing trace with hash 827320773, now seen corresponding path program 1 times [2019-12-07 19:22:26,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:26,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007788909] [2019-12-07 19:22:26,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:26,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:26,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007788909] [2019-12-07 19:22:26,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:26,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:22:26,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886292742] [2019-12-07 19:22:26,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:22:26,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:26,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:22:26,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:22:26,430 INFO L87 Difference]: Start difference. First operand 17745 states and 54352 transitions. Second operand 6 states. [2019-12-07 19:22:26,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:26,948 INFO L93 Difference]: Finished difference Result 30545 states and 93524 transitions. [2019-12-07 19:22:26,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:22:26,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-07 19:22:26,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:26,995 INFO L225 Difference]: With dead ends: 30545 [2019-12-07 19:22:26,995 INFO L226 Difference]: Without dead ends: 30545 [2019-12-07 19:22:26,996 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:22:27,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30545 states. [2019-12-07 19:22:27,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30545 to 19975. [2019-12-07 19:22:27,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19975 states. [2019-12-07 19:22:27,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19975 states to 19975 states and 61415 transitions. [2019-12-07 19:22:27,377 INFO L78 Accepts]: Start accepts. Automaton has 19975 states and 61415 transitions. Word has length 39 [2019-12-07 19:22:27,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:27,377 INFO L462 AbstractCegarLoop]: Abstraction has 19975 states and 61415 transitions. [2019-12-07 19:22:27,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:22:27,377 INFO L276 IsEmpty]: Start isEmpty. Operand 19975 states and 61415 transitions. [2019-12-07 19:22:27,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 19:22:27,397 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:27,397 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:27,397 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:27,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:27,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1003399843, now seen corresponding path program 2 times [2019-12-07 19:22:27,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:27,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764347553] [2019-12-07 19:22:27,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:27,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:27,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764347553] [2019-12-07 19:22:27,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:27,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:22:27,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810177952] [2019-12-07 19:22:27,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:22:27,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:27,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:22:27,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:22:27,438 INFO L87 Difference]: Start difference. First operand 19975 states and 61415 transitions. Second operand 3 states. [2019-12-07 19:22:27,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:27,488 INFO L93 Difference]: Finished difference Result 16931 states and 51280 transitions. [2019-12-07 19:22:27,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:22:27,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 19:22:27,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:27,507 INFO L225 Difference]: With dead ends: 16931 [2019-12-07 19:22:27,508 INFO L226 Difference]: Without dead ends: 16931 [2019-12-07 19:22:27,508 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:22:27,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16931 states. [2019-12-07 19:22:27,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16931 to 16775. [2019-12-07 19:22:27,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16775 states. [2019-12-07 19:22:27,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16775 states to 16775 states and 50862 transitions. [2019-12-07 19:22:27,738 INFO L78 Accepts]: Start accepts. Automaton has 16775 states and 50862 transitions. Word has length 39 [2019-12-07 19:22:27,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:27,738 INFO L462 AbstractCegarLoop]: Abstraction has 16775 states and 50862 transitions. [2019-12-07 19:22:27,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:22:27,739 INFO L276 IsEmpty]: Start isEmpty. Operand 16775 states and 50862 transitions. [2019-12-07 19:22:27,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 19:22:27,755 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:27,755 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:27,755 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:27,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:27,755 INFO L82 PathProgramCache]: Analyzing trace with hash -859113598, now seen corresponding path program 1 times [2019-12-07 19:22:27,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:27,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907546555] [2019-12-07 19:22:27,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:27,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:27,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:27,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907546555] [2019-12-07 19:22:27,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:27,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 19:22:27,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477145744] [2019-12-07 19:22:27,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:22:27,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:27,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:22:27,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:22:27,845 INFO L87 Difference]: Start difference. First operand 16775 states and 50862 transitions. Second operand 8 states. [2019-12-07 19:22:29,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:29,012 INFO L93 Difference]: Finished difference Result 26304 states and 78699 transitions. [2019-12-07 19:22:29,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 19:22:29,013 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-12-07 19:22:29,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:29,045 INFO L225 Difference]: With dead ends: 26304 [2019-12-07 19:22:29,045 INFO L226 Difference]: Without dead ends: 26304 [2019-12-07 19:22:29,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-07 19:22:29,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26304 states. [2019-12-07 19:22:29,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26304 to 17447. [2019-12-07 19:22:29,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17447 states. [2019-12-07 19:22:29,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17447 states to 17447 states and 52918 transitions. [2019-12-07 19:22:29,353 INFO L78 Accepts]: Start accepts. Automaton has 17447 states and 52918 transitions. Word has length 40 [2019-12-07 19:22:29,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:29,353 INFO L462 AbstractCegarLoop]: Abstraction has 17447 states and 52918 transitions. [2019-12-07 19:22:29,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:22:29,353 INFO L276 IsEmpty]: Start isEmpty. Operand 17447 states and 52918 transitions. [2019-12-07 19:22:29,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 19:22:29,369 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:29,369 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:29,369 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:29,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:29,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1791261594, now seen corresponding path program 2 times [2019-12-07 19:22:29,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:29,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464599071] [2019-12-07 19:22:29,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:29,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:29,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464599071] [2019-12-07 19:22:29,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:29,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:22:29,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369570621] [2019-12-07 19:22:29,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:22:29,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:29,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:22:29,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:22:29,412 INFO L87 Difference]: Start difference. First operand 17447 states and 52918 transitions. Second operand 3 states. [2019-12-07 19:22:29,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:29,461 INFO L93 Difference]: Finished difference Result 17447 states and 52832 transitions. [2019-12-07 19:22:29,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:22:29,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 19:22:29,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:29,481 INFO L225 Difference]: With dead ends: 17447 [2019-12-07 19:22:29,481 INFO L226 Difference]: Without dead ends: 17447 [2019-12-07 19:22:29,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:22:29,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17447 states. [2019-12-07 19:22:29,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17447 to 14601. [2019-12-07 19:22:29,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14601 states. [2019-12-07 19:22:29,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 44374 transitions. [2019-12-07 19:22:29,774 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 44374 transitions. Word has length 40 [2019-12-07 19:22:29,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:29,774 INFO L462 AbstractCegarLoop]: Abstraction has 14601 states and 44374 transitions. [2019-12-07 19:22:29,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:22:29,774 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 44374 transitions. [2019-12-07 19:22:29,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 19:22:29,791 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:29,791 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:29,791 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:29,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:29,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1733144850, now seen corresponding path program 1 times [2019-12-07 19:22:29,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:29,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979199079] [2019-12-07 19:22:29,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:29,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:29,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979199079] [2019-12-07 19:22:29,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:29,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:22:29,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531702296] [2019-12-07 19:22:29,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:22:29,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:29,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:22:29,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:22:29,870 INFO L87 Difference]: Start difference. First operand 14601 states and 44374 transitions. Second operand 5 states. [2019-12-07 19:22:29,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:29,936 INFO L93 Difference]: Finished difference Result 13190 states and 41005 transitions. [2019-12-07 19:22:29,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:22:29,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-07 19:22:29,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:29,951 INFO L225 Difference]: With dead ends: 13190 [2019-12-07 19:22:29,951 INFO L226 Difference]: Without dead ends: 13148 [2019-12-07 19:22:29,951 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:22:30,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13148 states. [2019-12-07 19:22:30,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13148 to 12884. [2019-12-07 19:22:30,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12884 states. [2019-12-07 19:22:30,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12884 states to 12884 states and 40168 transitions. [2019-12-07 19:22:30,133 INFO L78 Accepts]: Start accepts. Automaton has 12884 states and 40168 transitions. Word has length 41 [2019-12-07 19:22:30,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:30,133 INFO L462 AbstractCegarLoop]: Abstraction has 12884 states and 40168 transitions. [2019-12-07 19:22:30,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:22:30,133 INFO L276 IsEmpty]: Start isEmpty. Operand 12884 states and 40168 transitions. [2019-12-07 19:22:30,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:22:30,145 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:30,145 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:30,145 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:30,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:30,146 INFO L82 PathProgramCache]: Analyzing trace with hash -93533690, now seen corresponding path program 1 times [2019-12-07 19:22:30,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:30,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105866638] [2019-12-07 19:22:30,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:30,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:30,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105866638] [2019-12-07 19:22:30,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:30,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:22:30,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371313888] [2019-12-07 19:22:30,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:22:30,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:30,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:22:30,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:22:30,175 INFO L87 Difference]: Start difference. First operand 12884 states and 40168 transitions. Second operand 3 states. [2019-12-07 19:22:30,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:30,240 INFO L93 Difference]: Finished difference Result 17451 states and 53484 transitions. [2019-12-07 19:22:30,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:22:30,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 19:22:30,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:30,258 INFO L225 Difference]: With dead ends: 17451 [2019-12-07 19:22:30,258 INFO L226 Difference]: Without dead ends: 16846 [2019-12-07 19:22:30,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:22:30,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16846 states. [2019-12-07 19:22:30,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16846 to 12553. [2019-12-07 19:22:30,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12553 states. [2019-12-07 19:22:30,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12553 states to 12553 states and 39322 transitions. [2019-12-07 19:22:30,456 INFO L78 Accepts]: Start accepts. Automaton has 12553 states and 39322 transitions. Word has length 55 [2019-12-07 19:22:30,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:30,456 INFO L462 AbstractCegarLoop]: Abstraction has 12553 states and 39322 transitions. [2019-12-07 19:22:30,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:22:30,456 INFO L276 IsEmpty]: Start isEmpty. Operand 12553 states and 39322 transitions. [2019-12-07 19:22:30,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:22:30,468 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:30,468 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:30,468 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:30,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:30,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1220745333, now seen corresponding path program 1 times [2019-12-07 19:22:30,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:30,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457141743] [2019-12-07 19:22:30,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:30,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:30,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457141743] [2019-12-07 19:22:30,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:30,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 19:22:30,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785703792] [2019-12-07 19:22:30,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 19:22:30,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:30,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 19:22:30,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:22:30,629 INFO L87 Difference]: Start difference. First operand 12553 states and 39322 transitions. Second operand 11 states. [2019-12-07 19:22:31,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:31,642 INFO L93 Difference]: Finished difference Result 53791 states and 168018 transitions. [2019-12-07 19:22:31,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 19:22:31,642 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-07 19:22:31,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:31,666 INFO L225 Difference]: With dead ends: 53791 [2019-12-07 19:22:31,666 INFO L226 Difference]: Without dead ends: 20454 [2019-12-07 19:22:31,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2019-12-07 19:22:31,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20454 states. [2019-12-07 19:22:31,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20454 to 10985. [2019-12-07 19:22:31,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10985 states. [2019-12-07 19:22:31,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10985 states to 10985 states and 34488 transitions. [2019-12-07 19:22:31,896 INFO L78 Accepts]: Start accepts. Automaton has 10985 states and 34488 transitions. Word has length 55 [2019-12-07 19:22:31,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:31,896 INFO L462 AbstractCegarLoop]: Abstraction has 10985 states and 34488 transitions. [2019-12-07 19:22:31,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 19:22:31,896 INFO L276 IsEmpty]: Start isEmpty. Operand 10985 states and 34488 transitions. [2019-12-07 19:22:31,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:22:31,906 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:31,906 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:31,907 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:31,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:31,907 INFO L82 PathProgramCache]: Analyzing trace with hash 915079797, now seen corresponding path program 2 times [2019-12-07 19:22:31,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:31,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445579870] [2019-12-07 19:22:31,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:31,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:31,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445579870] [2019-12-07 19:22:31,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:31,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:22:31,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001275866] [2019-12-07 19:22:31,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:22:31,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:31,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:22:31,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:22:31,974 INFO L87 Difference]: Start difference. First operand 10985 states and 34488 transitions. Second operand 7 states. [2019-12-07 19:22:32,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:32,211 INFO L93 Difference]: Finished difference Result 27977 states and 86243 transitions. [2019-12-07 19:22:32,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 19:22:32,211 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-07 19:22:32,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:32,233 INFO L225 Difference]: With dead ends: 27977 [2019-12-07 19:22:32,234 INFO L226 Difference]: Without dead ends: 20415 [2019-12-07 19:22:32,234 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-07 19:22:32,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20415 states. [2019-12-07 19:22:32,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20415 to 13029. [2019-12-07 19:22:32,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13029 states. [2019-12-07 19:22:32,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13029 states to 13029 states and 40716 transitions. [2019-12-07 19:22:32,475 INFO L78 Accepts]: Start accepts. Automaton has 13029 states and 40716 transitions. Word has length 55 [2019-12-07 19:22:32,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:32,475 INFO L462 AbstractCegarLoop]: Abstraction has 13029 states and 40716 transitions. [2019-12-07 19:22:32,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:22:32,476 INFO L276 IsEmpty]: Start isEmpty. Operand 13029 states and 40716 transitions. [2019-12-07 19:22:32,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:22:32,488 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:32,488 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:32,489 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:32,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:32,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1003034569, now seen corresponding path program 3 times [2019-12-07 19:22:32,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:32,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646084882] [2019-12-07 19:22:32,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:32,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:32,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646084882] [2019-12-07 19:22:32,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:32,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 19:22:32,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366413681] [2019-12-07 19:22:32,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 19:22:32,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:32,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 19:22:32,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:22:32,618 INFO L87 Difference]: Start difference. First operand 13029 states and 40716 transitions. Second operand 10 states. [2019-12-07 19:22:33,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:33,355 INFO L93 Difference]: Finished difference Result 21094 states and 65368 transitions. [2019-12-07 19:22:33,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 19:22:33,356 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-07 19:22:33,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:33,374 INFO L225 Difference]: With dead ends: 21094 [2019-12-07 19:22:33,374 INFO L226 Difference]: Without dead ends: 17086 [2019-12-07 19:22:33,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-07 19:22:33,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17086 states. [2019-12-07 19:22:33,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17086 to 13505. [2019-12-07 19:22:33,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13505 states. [2019-12-07 19:22:33,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13505 states to 13505 states and 41878 transitions. [2019-12-07 19:22:33,591 INFO L78 Accepts]: Start accepts. Automaton has 13505 states and 41878 transitions. Word has length 55 [2019-12-07 19:22:33,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:33,591 INFO L462 AbstractCegarLoop]: Abstraction has 13505 states and 41878 transitions. [2019-12-07 19:22:33,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 19:22:33,591 INFO L276 IsEmpty]: Start isEmpty. Operand 13505 states and 41878 transitions. [2019-12-07 19:22:33,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:22:33,604 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:33,604 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:33,604 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:33,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:33,604 INFO L82 PathProgramCache]: Analyzing trace with hash -367516305, now seen corresponding path program 4 times [2019-12-07 19:22:33,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:33,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118273214] [2019-12-07 19:22:33,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:33,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:33,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:33,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118273214] [2019-12-07 19:22:33,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:33,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 19:22:33,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521546931] [2019-12-07 19:22:33,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 19:22:33,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:33,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 19:22:33,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:22:33,714 INFO L87 Difference]: Start difference. First operand 13505 states and 41878 transitions. Second operand 11 states. [2019-12-07 19:22:34,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:34,325 INFO L93 Difference]: Finished difference Result 19994 states and 61445 transitions. [2019-12-07 19:22:34,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 19:22:34,325 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-07 19:22:34,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:34,344 INFO L225 Difference]: With dead ends: 19994 [2019-12-07 19:22:34,345 INFO L226 Difference]: Without dead ends: 16624 [2019-12-07 19:22:34,345 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-07 19:22:34,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16624 states. [2019-12-07 19:22:34,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16624 to 13325. [2019-12-07 19:22:34,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13325 states. [2019-12-07 19:22:34,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13325 states to 13325 states and 41283 transitions. [2019-12-07 19:22:34,574 INFO L78 Accepts]: Start accepts. Automaton has 13325 states and 41283 transitions. Word has length 55 [2019-12-07 19:22:34,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:34,574 INFO L462 AbstractCegarLoop]: Abstraction has 13325 states and 41283 transitions. [2019-12-07 19:22:34,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 19:22:34,574 INFO L276 IsEmpty]: Start isEmpty. Operand 13325 states and 41283 transitions. [2019-12-07 19:22:34,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:22:34,587 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:34,587 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:34,587 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:34,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:34,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1545411663, now seen corresponding path program 5 times [2019-12-07 19:22:34,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:34,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749666600] [2019-12-07 19:22:34,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:34,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:34,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749666600] [2019-12-07 19:22:34,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:34,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 19:22:34,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512701208] [2019-12-07 19:22:34,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 19:22:34,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:34,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 19:22:34,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:22:34,729 INFO L87 Difference]: Start difference. First operand 13325 states and 41283 transitions. Second operand 10 states. [2019-12-07 19:22:35,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:35,269 INFO L93 Difference]: Finished difference Result 25017 states and 76674 transitions. [2019-12-07 19:22:35,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 19:22:35,270 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-07 19:22:35,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:35,298 INFO L225 Difference]: With dead ends: 25017 [2019-12-07 19:22:35,298 INFO L226 Difference]: Without dead ends: 24451 [2019-12-07 19:22:35,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2019-12-07 19:22:35,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24451 states. [2019-12-07 19:22:35,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24451 to 15557. [2019-12-07 19:22:35,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15557 states. [2019-12-07 19:22:35,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15557 states to 15557 states and 47851 transitions. [2019-12-07 19:22:35,589 INFO L78 Accepts]: Start accepts. Automaton has 15557 states and 47851 transitions. Word has length 55 [2019-12-07 19:22:35,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:35,590 INFO L462 AbstractCegarLoop]: Abstraction has 15557 states and 47851 transitions. [2019-12-07 19:22:35,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 19:22:35,590 INFO L276 IsEmpty]: Start isEmpty. Operand 15557 states and 47851 transitions. [2019-12-07 19:22:35,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:22:35,606 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:35,606 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:35,606 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:35,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:35,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1540693839, now seen corresponding path program 6 times [2019-12-07 19:22:35,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:35,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042393954] [2019-12-07 19:22:35,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:35,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:35,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042393954] [2019-12-07 19:22:35,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:35,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 19:22:35,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995170225] [2019-12-07 19:22:35,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 19:22:35,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:35,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 19:22:35,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:22:35,711 INFO L87 Difference]: Start difference. First operand 15557 states and 47851 transitions. Second operand 10 states. [2019-12-07 19:22:36,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:36,158 INFO L93 Difference]: Finished difference Result 24724 states and 75240 transitions. [2019-12-07 19:22:36,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 19:22:36,158 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-07 19:22:36,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:36,180 INFO L225 Difference]: With dead ends: 24724 [2019-12-07 19:22:36,181 INFO L226 Difference]: Without dead ends: 20526 [2019-12-07 19:22:36,181 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-07 19:22:36,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20526 states. [2019-12-07 19:22:36,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20526 to 13210. [2019-12-07 19:22:36,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13210 states. [2019-12-07 19:22:36,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13210 states to 13210 states and 40841 transitions. [2019-12-07 19:22:36,430 INFO L78 Accepts]: Start accepts. Automaton has 13210 states and 40841 transitions. Word has length 55 [2019-12-07 19:22:36,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:36,430 INFO L462 AbstractCegarLoop]: Abstraction has 13210 states and 40841 transitions. [2019-12-07 19:22:36,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 19:22:36,431 INFO L276 IsEmpty]: Start isEmpty. Operand 13210 states and 40841 transitions. [2019-12-07 19:22:36,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:22:36,445 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:36,445 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:36,445 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:36,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:36,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1318747633, now seen corresponding path program 7 times [2019-12-07 19:22:36,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:36,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907597444] [2019-12-07 19:22:36,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:36,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:36,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907597444] [2019-12-07 19:22:36,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:36,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 19:22:36,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104302063] [2019-12-07 19:22:36,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 19:22:36,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:36,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 19:22:36,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:22:36,585 INFO L87 Difference]: Start difference. First operand 13210 states and 40841 transitions. Second operand 11 states. [2019-12-07 19:22:38,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:38,224 INFO L93 Difference]: Finished difference Result 21836 states and 67078 transitions. [2019-12-07 19:22:38,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 19:22:38,225 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-07 19:22:38,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:38,258 INFO L225 Difference]: With dead ends: 21836 [2019-12-07 19:22:38,258 INFO L226 Difference]: Without dead ends: 21526 [2019-12-07 19:22:38,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2019-12-07 19:22:38,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21526 states. [2019-12-07 19:22:38,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21526 to 14685. [2019-12-07 19:22:38,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14685 states. [2019-12-07 19:22:38,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14685 states to 14685 states and 45144 transitions. [2019-12-07 19:22:38,533 INFO L78 Accepts]: Start accepts. Automaton has 14685 states and 45144 transitions. Word has length 55 [2019-12-07 19:22:38,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:38,533 INFO L462 AbstractCegarLoop]: Abstraction has 14685 states and 45144 transitions. [2019-12-07 19:22:38,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 19:22:38,533 INFO L276 IsEmpty]: Start isEmpty. Operand 14685 states and 45144 transitions. [2019-12-07 19:22:38,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:22:38,547 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:38,547 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:38,547 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:38,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:38,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1314029809, now seen corresponding path program 8 times [2019-12-07 19:22:38,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:38,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209000364] [2019-12-07 19:22:38,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:38,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:38,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209000364] [2019-12-07 19:22:38,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:38,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-07 19:22:38,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491238117] [2019-12-07 19:22:38,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 19:22:38,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:38,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 19:22:38,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2019-12-07 19:22:38,987 INFO L87 Difference]: Start difference. First operand 14685 states and 45144 transitions. Second operand 19 states. [2019-12-07 19:22:41,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:41,470 INFO L93 Difference]: Finished difference Result 22290 states and 67355 transitions. [2019-12-07 19:22:41,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-07 19:22:41,471 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2019-12-07 19:22:41,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:41,493 INFO L225 Difference]: With dead ends: 22290 [2019-12-07 19:22:41,493 INFO L226 Difference]: Without dead ends: 21258 [2019-12-07 19:22:41,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=336, Invalid=1644, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 19:22:41,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21258 states. [2019-12-07 19:22:41,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21258 to 14829. [2019-12-07 19:22:41,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14829 states. [2019-12-07 19:22:41,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14829 states to 14829 states and 45496 transitions. [2019-12-07 19:22:41,765 INFO L78 Accepts]: Start accepts. Automaton has 14829 states and 45496 transitions. Word has length 55 [2019-12-07 19:22:41,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:41,765 INFO L462 AbstractCegarLoop]: Abstraction has 14829 states and 45496 transitions. [2019-12-07 19:22:41,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 19:22:41,765 INFO L276 IsEmpty]: Start isEmpty. Operand 14829 states and 45496 transitions. [2019-12-07 19:22:41,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:22:41,782 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:41,783 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:41,783 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:41,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:41,783 INFO L82 PathProgramCache]: Analyzing trace with hash -2101751141, now seen corresponding path program 9 times [2019-12-07 19:22:41,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:41,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658540112] [2019-12-07 19:22:41,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:41,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:41,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658540112] [2019-12-07 19:22:41,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:41,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 19:22:41,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473749587] [2019-12-07 19:22:41,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 19:22:41,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:41,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 19:22:41,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:22:41,946 INFO L87 Difference]: Start difference. First operand 14829 states and 45496 transitions. Second operand 11 states. [2019-12-07 19:22:42,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:42,515 INFO L93 Difference]: Finished difference Result 21914 states and 66796 transitions. [2019-12-07 19:22:42,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 19:22:42,515 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-07 19:22:42,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:42,538 INFO L225 Difference]: With dead ends: 21914 [2019-12-07 19:22:42,538 INFO L226 Difference]: Without dead ends: 19684 [2019-12-07 19:22:42,538 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2019-12-07 19:22:42,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19684 states. [2019-12-07 19:22:42,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19684 to 12800. [2019-12-07 19:22:42,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12800 states. [2019-12-07 19:22:42,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12800 states to 12800 states and 39619 transitions. [2019-12-07 19:22:42,769 INFO L78 Accepts]: Start accepts. Automaton has 12800 states and 39619 transitions. Word has length 55 [2019-12-07 19:22:42,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:42,769 INFO L462 AbstractCegarLoop]: Abstraction has 12800 states and 39619 transitions. [2019-12-07 19:22:42,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 19:22:42,770 INFO L276 IsEmpty]: Start isEmpty. Operand 12800 states and 39619 transitions. [2019-12-07 19:22:42,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:22:42,782 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:42,782 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:42,782 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:42,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:42,782 INFO L82 PathProgramCache]: Analyzing trace with hash -767893923, now seen corresponding path program 10 times [2019-12-07 19:22:42,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:42,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371389481] [2019-12-07 19:22:42,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:43,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:43,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371389481] [2019-12-07 19:22:43,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:43,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 19:22:43,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194136270] [2019-12-07 19:22:43,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 19:22:43,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:43,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 19:22:43,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-12-07 19:22:43,074 INFO L87 Difference]: Start difference. First operand 12800 states and 39619 transitions. Second operand 17 states. [2019-12-07 19:22:43,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:43,906 INFO L93 Difference]: Finished difference Result 14994 states and 45724 transitions. [2019-12-07 19:22:43,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 19:22:43,907 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2019-12-07 19:22:43,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:43,923 INFO L225 Difference]: With dead ends: 14994 [2019-12-07 19:22:43,923 INFO L226 Difference]: Without dead ends: 14906 [2019-12-07 19:22:43,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=840, Unknown=0, NotChecked=0, Total=992 [2019-12-07 19:22:43,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14906 states. [2019-12-07 19:22:44,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14906 to 12905. [2019-12-07 19:22:44,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12905 states. [2019-12-07 19:22:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12905 states to 12905 states and 39840 transitions. [2019-12-07 19:22:44,120 INFO L78 Accepts]: Start accepts. Automaton has 12905 states and 39840 transitions. Word has length 55 [2019-12-07 19:22:44,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:44,120 INFO L462 AbstractCegarLoop]: Abstraction has 12905 states and 39840 transitions. [2019-12-07 19:22:44,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 19:22:44,120 INFO L276 IsEmpty]: Start isEmpty. Operand 12905 states and 39840 transitions. [2019-12-07 19:22:44,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:22:44,132 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:44,133 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:44,133 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:44,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:44,133 INFO L82 PathProgramCache]: Analyzing trace with hash 922212012, now seen corresponding path program 1 times [2019-12-07 19:22:44,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:44,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920633146] [2019-12-07 19:22:44,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:44,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:44,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920633146] [2019-12-07 19:22:44,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:44,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:22:44,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886707895] [2019-12-07 19:22:44,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:22:44,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:44,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:22:44,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:22:44,155 INFO L87 Difference]: Start difference. First operand 12905 states and 39840 transitions. Second operand 3 states. [2019-12-07 19:22:44,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:44,202 INFO L93 Difference]: Finished difference Result 13687 states and 40799 transitions. [2019-12-07 19:22:44,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:22:44,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 19:22:44,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:44,217 INFO L225 Difference]: With dead ends: 13687 [2019-12-07 19:22:44,217 INFO L226 Difference]: Without dead ends: 13687 [2019-12-07 19:22:44,217 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:22:44,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13687 states. [2019-12-07 19:22:44,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13687 to 12871. [2019-12-07 19:22:44,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12871 states. [2019-12-07 19:22:44,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12871 states to 12871 states and 38457 transitions. [2019-12-07 19:22:44,403 INFO L78 Accepts]: Start accepts. Automaton has 12871 states and 38457 transitions. Word has length 55 [2019-12-07 19:22:44,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:44,403 INFO L462 AbstractCegarLoop]: Abstraction has 12871 states and 38457 transitions. [2019-12-07 19:22:44,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:22:44,403 INFO L276 IsEmpty]: Start isEmpty. Operand 12871 states and 38457 transitions. [2019-12-07 19:22:44,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:22:44,415 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:44,415 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:44,415 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:44,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:44,415 INFO L82 PathProgramCache]: Analyzing trace with hash 882976399, now seen corresponding path program 11 times [2019-12-07 19:22:44,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:44,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546029780] [2019-12-07 19:22:44,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:44,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:44,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546029780] [2019-12-07 19:22:44,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:44,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 19:22:44,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210767412] [2019-12-07 19:22:44,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 19:22:44,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:44,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 19:22:44,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-12-07 19:22:44,734 INFO L87 Difference]: Start difference. First operand 12871 states and 38457 transitions. Second operand 18 states. [2019-12-07 19:22:45,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:45,786 INFO L93 Difference]: Finished difference Result 14895 states and 44065 transitions. [2019-12-07 19:22:45,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 19:22:45,787 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2019-12-07 19:22:45,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:45,802 INFO L225 Difference]: With dead ends: 14895 [2019-12-07 19:22:45,803 INFO L226 Difference]: Without dead ends: 14807 [2019-12-07 19:22:45,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=956, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 19:22:45,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14807 states. [2019-12-07 19:22:45,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14807 to 12871. [2019-12-07 19:22:45,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12871 states. [2019-12-07 19:22:46,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12871 states to 12871 states and 38457 transitions. [2019-12-07 19:22:46,004 INFO L78 Accepts]: Start accepts. Automaton has 12871 states and 38457 transitions. Word has length 55 [2019-12-07 19:22:46,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:46,004 INFO L462 AbstractCegarLoop]: Abstraction has 12871 states and 38457 transitions. [2019-12-07 19:22:46,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 19:22:46,004 INFO L276 IsEmpty]: Start isEmpty. Operand 12871 states and 38457 transitions. [2019-12-07 19:22:46,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:22:46,016 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:46,016 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:46,016 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:46,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:46,017 INFO L82 PathProgramCache]: Analyzing trace with hash -527800947, now seen corresponding path program 12 times [2019-12-07 19:22:46,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:46,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639379250] [2019-12-07 19:22:46,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:22:46,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:22:46,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639379250] [2019-12-07 19:22:46,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:22:46,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 19:22:46,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130505495] [2019-12-07 19:22:46,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 19:22:46,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:22:46,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 19:22:46,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:22:46,124 INFO L87 Difference]: Start difference. First operand 12871 states and 38457 transitions. Second operand 11 states. [2019-12-07 19:22:46,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:22:46,676 INFO L93 Difference]: Finished difference Result 19883 states and 58873 transitions. [2019-12-07 19:22:46,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 19:22:46,677 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-07 19:22:46,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:22:46,698 INFO L225 Difference]: With dead ends: 19883 [2019-12-07 19:22:46,698 INFO L226 Difference]: Without dead ends: 19507 [2019-12-07 19:22:46,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2019-12-07 19:22:46,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19507 states. [2019-12-07 19:22:46,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19507 to 12628. [2019-12-07 19:22:46,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12628 states. [2019-12-07 19:22:46,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12628 states to 12628 states and 37906 transitions. [2019-12-07 19:22:46,925 INFO L78 Accepts]: Start accepts. Automaton has 12628 states and 37906 transitions. Word has length 55 [2019-12-07 19:22:46,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:22:46,925 INFO L462 AbstractCegarLoop]: Abstraction has 12628 states and 37906 transitions. [2019-12-07 19:22:46,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 19:22:46,925 INFO L276 IsEmpty]: Start isEmpty. Operand 12628 states and 37906 transitions. [2019-12-07 19:22:46,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:22:46,937 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:22:46,937 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:22:46,937 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:22:46,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:22:46,938 INFO L82 PathProgramCache]: Analyzing trace with hash -238462213, now seen corresponding path program 13 times [2019-12-07 19:22:46,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:22:46,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005800319] [2019-12-07 19:22:46,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:22:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:22:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:22:46,997 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 19:22:46,997 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:22:47,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t424~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t424~0.base_40|) |v_ULTIMATE.start_main_~#t424~0.offset_28| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p2_EAX~0_40) (= 0 v_~__unbuffered_p0_EAX~0_50) (= 0 v_~x$w_buff0~0_407) (= 0 v_~weak$$choice0~0_14) (= v_~__unbuffered_cnt~0_133 0) (= 0 v_~x$w_buff0_used~0_981) (= 0 v_~x$r_buff1_thd2~0_264) (= v_~x$r_buff1_thd1~0_402 0) (= 0 v_~x$w_buff1~0_314) (= v_~x$flush_delayed~0_48 0) (= 0 v_~x$read_delayed_var~0.base_8) (= 0 v_~x~0_233) (= 0 v_~x$r_buff0_thd2~0_329) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x$r_buff0_thd3~0_134) (= v_~__unbuffered_p1_EAX~0_219 0) (= 0 v_~x$w_buff1_used~0_593) (= v_~z~0_23 0) (= 0 |v_#NULL.base_4|) (= v_~x$r_buff0_thd1~0_388 0) (= v_~main$tmp_guard1~0_38 0) (= 0 v_~x$read_delayed_var~0.offset_8) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_17 0) (= v_~main$tmp_guard0~0_20 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t424~0.base_40|)) (= v_~x$r_buff0_thd0~0_141 0) (= |v_#valid_71| (store .cse0 |v_ULTIMATE.start_main_~#t424~0.base_40| 1)) (= 0 |v_ULTIMATE.start_main_~#t424~0.offset_28|) (= |v_#NULL.offset_4| 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t424~0.base_40|) (= v_~weak$$choice2~0_186 0) (= v_~y~0_68 0) (= 0 v_~x$r_buff1_thd3~0_275) (= v_~__unbuffered_p2_EBX~0_40 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t424~0.base_40| 4) |v_#length_21|) (= v_~x$r_buff1_thd0~0_274 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_407, ULTIMATE.start_main_~#t425~0.offset=|v_ULTIMATE.start_main_~#t425~0.offset_23|, ~x$flush_delayed~0=v_~x$flush_delayed~0_48, ULTIMATE.start_main_~#t426~0.base=|v_ULTIMATE.start_main_~#t426~0.base_19|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_402, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_43|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_37|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_50, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_219, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_314, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_593, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_264, ULTIMATE.start_main_~#t426~0.offset=|v_ULTIMATE.start_main_~#t426~0.offset_16|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_133, ~x~0=v_~x~0_233, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_388, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_73|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_275, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~x$mem_tmp~0=v_~x$mem_tmp~0_17, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_127|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_49|, ULTIMATE.start_main_~#t424~0.offset=|v_ULTIMATE.start_main_~#t424~0.offset_28|, ULTIMATE.start_main_~#t425~0.base=|v_ULTIMATE.start_main_~#t425~0.base_32|, ~y~0=v_~y~0_68, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_274, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_329, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_981, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_77|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_10|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_186, ULTIMATE.start_main_~#t424~0.base=|v_ULTIMATE.start_main_~#t424~0.base_40|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t425~0.offset, ~x$flush_delayed~0, ULTIMATE.start_main_~#t426~0.base, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t426~0.offset, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t424~0.offset, ULTIMATE.start_main_~#t425~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t424~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 19:22:47,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L823-1-->L825: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t425~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t425~0.base_11|) |v_ULTIMATE.start_main_~#t425~0.offset_10| 1)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t425~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t425~0.offset_10|) (= (select |v_#valid_38| |v_ULTIMATE.start_main_~#t425~0.base_11|) 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t425~0.base_11| 4) |v_#length_15|) (not (= 0 |v_ULTIMATE.start_main_~#t425~0.base_11|)) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t425~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t425~0.offset=|v_ULTIMATE.start_main_~#t425~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t425~0.base=|v_ULTIMATE.start_main_~#t425~0.base_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t425~0.offset, ULTIMATE.start_main_~#t425~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 19:22:47,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P1ENTRY-->L5-3: Formula: (and (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_9)) (= v_~x$w_buff1_used~0_59 v_~x$w_buff0_used~0_123) (= (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_122 256))) (not (= 0 (mod v_~x$w_buff1_used~0_59 256))))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|) (= 1 v_~x$w_buff0~0_27) (= v_P1Thread1of1ForFork0_~arg.offset_7 |v_P1Thread1of1ForFork0_#in~arg.offset_9|) (= 1 v_~x$w_buff0_used~0_122) (= v_~x$w_buff0~0_28 v_~x$w_buff1~0_20) (= v_P1Thread1of1ForFork0_~arg.base_7 |v_P1Thread1of1ForFork0_#in~arg.base_9|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_28, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_27, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_9, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_7, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_7, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|, ~x$w_buff1~0=v_~x$w_buff1~0_20, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_122} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 19:22:47,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L825-1-->L827: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t426~0.offset_10|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t426~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t426~0.base_11|)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t426~0.base_11| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t426~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t426~0.base_11|) |v_ULTIMATE.start_main_~#t426~0.offset_10| 2))) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t426~0.base_11| 4)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t426~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t426~0.base=|v_ULTIMATE.start_main_~#t426~0.base_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t426~0.offset=|v_ULTIMATE.start_main_~#t426~0.offset_10|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t426~0.base, #length, ULTIMATE.start_main_~#t426~0.offset, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 19:22:47,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L800-2-->L800-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-413139220 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-413139220 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out-413139220| ~x$w_buff1~0_In-413139220) (not .cse1)) (and (= ~x~0_In-413139220 |P2Thread1of1ForFork1_#t~ite32_Out-413139220|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-413139220, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-413139220, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-413139220, ~x~0=~x~0_In-413139220} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-413139220|, ~x$w_buff1~0=~x$w_buff1~0_In-413139220, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-413139220, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-413139220, ~x~0=~x~0_In-413139220} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 19:22:47,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-738717623 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-738717623 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-738717623| ~x$w_buff0_used~0_In-738717623)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-738717623| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-738717623, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-738717623} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-738717623, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-738717623|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-738717623} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 19:22:47,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L779-->L779-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In183886602 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In183886602 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In183886602 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In183886602 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out183886602| ~x$w_buff1_used~0_In183886602) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite29_Out183886602| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In183886602, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In183886602, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In183886602, ~x$w_buff0_used~0=~x$w_buff0_used~0_In183886602} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In183886602, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In183886602, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In183886602, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out183886602|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In183886602} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 19:22:47,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L780-->L781: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1794862317 256) 0)) (.cse2 (= ~x$r_buff0_thd2~0_Out-1794862317 ~x$r_buff0_thd2~0_In-1794862317)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1794862317 256) 0))) (or (and (= ~x$r_buff0_thd2~0_Out-1794862317 0) (not .cse0) (not .cse1)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1794862317, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1794862317} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1794862317|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1794862317, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1794862317} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 19:22:47,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1970608595 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In1970608595 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1970608595 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1970608595 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out1970608595| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite31_Out1970608595| ~x$r_buff1_thd2~0_In1970608595) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1970608595, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1970608595, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1970608595, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1970608595} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1970608595|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1970608595, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1970608595, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1970608595, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1970608595} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 19:22:47,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L781-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_51 |v_P1Thread1of1ForFork0_#t~ite31_32|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_51, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 19:22:47,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L744-->L744-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1120524939 256) 0))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In1120524939 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In1120524939 256) 0) .cse0) (and (= 0 (mod ~x$r_buff1_thd1~0_In1120524939 256)) .cse0) (= 0 (mod ~x$w_buff0_used~0_In1120524939 256)))) (= |P0Thread1of1ForFork2_#t~ite14_Out1120524939| ~x$w_buff0_used~0_In1120524939) .cse1 (= |P0Thread1of1ForFork2_#t~ite14_Out1120524939| |P0Thread1of1ForFork2_#t~ite15_Out1120524939|)) (and (= |P0Thread1of1ForFork2_#t~ite15_Out1120524939| ~x$w_buff0_used~0_In1120524939) (not .cse1) (= |P0Thread1of1ForFork2_#t~ite14_In1120524939| |P0Thread1of1ForFork2_#t~ite14_Out1120524939|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1120524939, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1120524939, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1120524939, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1120524939|, ~weak$$choice2~0=~weak$$choice2~0_In1120524939, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1120524939} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1120524939, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1120524939, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1120524939|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1120524939, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1120524939|, ~weak$$choice2~0=~weak$$choice2~0_In1120524939, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1120524939} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 19:22:47,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L745-->L745-8: Formula: (let ((.cse4 (= 0 (mod ~x$w_buff1_used~0_In-467638876 256))) (.cse0 (= (mod ~weak$$choice2~0_In-467638876 256) 0)) (.cse1 (= |P0Thread1of1ForFork2_#t~ite17_Out-467638876| |P0Thread1of1ForFork2_#t~ite18_Out-467638876|)) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-467638876 256))) (.cse5 (= 0 (mod ~x$w_buff0_used~0_In-467638876 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-467638876 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite16_In-467638876| |P0Thread1of1ForFork2_#t~ite16_Out-467638876|) (or (and .cse0 .cse1 (= |P0Thread1of1ForFork2_#t~ite17_Out-467638876| ~x$w_buff1_used~0_In-467638876) (or (and .cse2 .cse3) (and .cse4 .cse3) .cse5)) (and (= |P0Thread1of1ForFork2_#t~ite18_Out-467638876| ~x$w_buff1_used~0_In-467638876) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_Out-467638876| |P0Thread1of1ForFork2_#t~ite17_In-467638876|)))) (let ((.cse6 (not .cse3))) (and (or .cse6 (not .cse4)) .cse0 (= 0 |P0Thread1of1ForFork2_#t~ite16_Out-467638876|) (= |P0Thread1of1ForFork2_#t~ite17_Out-467638876| |P0Thread1of1ForFork2_#t~ite16_Out-467638876|) .cse1 (or .cse6 (not .cse2)) (not .cse5))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-467638876, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-467638876|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-467638876, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_In-467638876|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-467638876, ~weak$$choice2~0=~weak$$choice2~0_In-467638876, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-467638876} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-467638876, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-467638876|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-467638876|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-467638876, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_Out-467638876|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-467638876, ~weak$$choice2~0=~weak$$choice2~0_In-467638876, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-467638876} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17, P0Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-07 19:22:47,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L745-8-->L747: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite18_53| v_~x$w_buff1_used~0_577) (not (= 0 (mod v_~weak$$choice2~0_176 256))) (= v_~x$r_buff0_thd1~0_373 v_~x$r_buff0_thd1~0_372)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_373, P0Thread1of1ForFork2_#t~ite18=|v_P0Thread1of1ForFork2_#t~ite18_53|, ~weak$$choice2~0=v_~weak$$choice2~0_176} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_37|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_372, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_25|, P0Thread1of1ForFork2_#t~ite18=|v_P0Thread1of1ForFork2_#t~ite18_52|, P0Thread1of1ForFork2_#t~ite17=|v_P0Thread1of1ForFork2_#t~ite17_46|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_577, P0Thread1of1ForFork2_#t~ite16=|v_P0Thread1of1ForFork2_#t~ite16_42|, ~weak$$choice2~0=v_~weak$$choice2~0_176, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_13|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17, ~x$w_buff1_used~0, P0Thread1of1ForFork2_#t~ite16, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 19:22:47,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L800-4-->L801: Formula: (= v_~x~0_36 |v_P2Thread1of1ForFork1_#t~ite32_12|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_12|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_11|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_19|, ~x~0=v_~x~0_36} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 19:22:47,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L749-->L757: Formula: (and (= v_~x$flush_delayed~0_13 0) (not (= (mod v_~x$flush_delayed~0_14 256) 0)) (= v_~x$mem_tmp~0_5 v_~x~0_56) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_17|, ~x$flush_delayed~0=v_~x$flush_delayed~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_56} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 19:22:47,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In2146989218 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In2146989218 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out2146989218|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In2146989218 |P2Thread1of1ForFork1_#t~ite34_Out2146989218|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2146989218, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2146989218} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out2146989218|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2146989218, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2146989218} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 19:22:47,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L802-->L802-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In2022490315 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In2022490315 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In2022490315 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In2022490315 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite35_Out2022490315| ~x$w_buff1_used~0_In2022490315) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite35_Out2022490315| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2022490315, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2022490315, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2022490315, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2022490315} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out2022490315|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2022490315, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2022490315, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2022490315, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2022490315} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 19:22:47,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In847655870 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In847655870 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out847655870| 0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out847655870| ~x$r_buff0_thd3~0_In847655870) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In847655870, ~x$w_buff0_used~0=~x$w_buff0_used~0_In847655870} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out847655870|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In847655870, ~x$w_buff0_used~0=~x$w_buff0_used~0_In847655870} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 19:22:47,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L804-->L804-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In116570076 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In116570076 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In116570076 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In116570076 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite37_Out116570076| 0)) (and (or .cse3 .cse2) (= ~x$r_buff1_thd3~0_In116570076 |P2Thread1of1ForFork1_#t~ite37_Out116570076|) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In116570076, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In116570076, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In116570076, ~x$w_buff0_used~0=~x$w_buff0_used~0_In116570076} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out116570076|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In116570076, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In116570076, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In116570076, ~x$w_buff0_used~0=~x$w_buff0_used~0_In116570076} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 19:22:47,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L804-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82) (= |v_P2Thread1of1ForFork1_#t~ite37_40| v_~x$r_buff1_thd3~0_144)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_39|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_144, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 19:22:47,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L827-1-->L833: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 19:22:47,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L833-2-->L833-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite42_Out-1534604350| |ULTIMATE.start_main_#t~ite41_Out-1534604350|)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1534604350 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-1534604350 256) 0))) (or (and (not .cse0) (= ~x$w_buff1~0_In-1534604350 |ULTIMATE.start_main_#t~ite41_Out-1534604350|) (not .cse1) .cse2) (and .cse2 (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite41_Out-1534604350| ~x~0_In-1534604350)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1534604350, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1534604350, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1534604350, ~x~0=~x~0_In-1534604350} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1534604350|, ~x$w_buff1~0=~x$w_buff1~0_In-1534604350, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1534604350, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1534604350, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1534604350|, ~x~0=~x~0_In-1534604350} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 19:22:47,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1171981060 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1171981060 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-1171981060|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-1171981060 |ULTIMATE.start_main_#t~ite43_Out-1171981060|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1171981060, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1171981060} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1171981060, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1171981060|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1171981060} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 19:22:47,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L835-->L835-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-390473511 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-390473511 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-390473511 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-390473511 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-390473511| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-390473511 |ULTIMATE.start_main_#t~ite44_Out-390473511|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-390473511, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-390473511, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-390473511, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-390473511} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-390473511, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-390473511, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-390473511, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-390473511|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-390473511} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 19:22:47,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L836-->L836-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1271721695 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1271721695 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1271721695| ~x$r_buff0_thd0~0_In1271721695)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out1271721695| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1271721695, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1271721695} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1271721695, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1271721695|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1271721695} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 19:22:47,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L837-->L837-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1253444027 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1253444027 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1253444027 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In1253444027 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out1253444027| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite46_Out1253444027| ~x$r_buff1_thd0~0_In1253444027)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1253444027, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1253444027, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1253444027, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1253444027} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1253444027, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1253444027|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1253444027, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1253444027, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1253444027} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 19:22:47,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L837-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9| (mod v_~main$tmp_guard1~0_22 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_~__unbuffered_p1_EAX~0_205 0) (= v_~__unbuffered_p2_EBX~0_21 0) (= 0 v_~__unbuffered_p0_EAX~0_34))) 1 0)) 0 1) v_~main$tmp_guard1~0_22) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~x$r_buff1_thd0~0_258 |v_ULTIMATE.start_main_#t~ite46_45|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_205, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_45|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_205, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_44|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_258, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:22:47,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:22:47 BasicIcfg [2019-12-07 19:22:47,063 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:22:47,063 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:22:47,063 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:22:47,063 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:22:47,064 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:21:57" (3/4) ... [2019-12-07 19:22:47,066 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 19:22:47,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t424~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t424~0.base_40|) |v_ULTIMATE.start_main_~#t424~0.offset_28| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p2_EAX~0_40) (= 0 v_~__unbuffered_p0_EAX~0_50) (= 0 v_~x$w_buff0~0_407) (= 0 v_~weak$$choice0~0_14) (= v_~__unbuffered_cnt~0_133 0) (= 0 v_~x$w_buff0_used~0_981) (= 0 v_~x$r_buff1_thd2~0_264) (= v_~x$r_buff1_thd1~0_402 0) (= 0 v_~x$w_buff1~0_314) (= v_~x$flush_delayed~0_48 0) (= 0 v_~x$read_delayed_var~0.base_8) (= 0 v_~x~0_233) (= 0 v_~x$r_buff0_thd2~0_329) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x$r_buff0_thd3~0_134) (= v_~__unbuffered_p1_EAX~0_219 0) (= 0 v_~x$w_buff1_used~0_593) (= v_~z~0_23 0) (= 0 |v_#NULL.base_4|) (= v_~x$r_buff0_thd1~0_388 0) (= v_~main$tmp_guard1~0_38 0) (= 0 v_~x$read_delayed_var~0.offset_8) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_17 0) (= v_~main$tmp_guard0~0_20 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t424~0.base_40|)) (= v_~x$r_buff0_thd0~0_141 0) (= |v_#valid_71| (store .cse0 |v_ULTIMATE.start_main_~#t424~0.base_40| 1)) (= 0 |v_ULTIMATE.start_main_~#t424~0.offset_28|) (= |v_#NULL.offset_4| 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t424~0.base_40|) (= v_~weak$$choice2~0_186 0) (= v_~y~0_68 0) (= 0 v_~x$r_buff1_thd3~0_275) (= v_~__unbuffered_p2_EBX~0_40 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t424~0.base_40| 4) |v_#length_21|) (= v_~x$r_buff1_thd0~0_274 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_407, ULTIMATE.start_main_~#t425~0.offset=|v_ULTIMATE.start_main_~#t425~0.offset_23|, ~x$flush_delayed~0=v_~x$flush_delayed~0_48, ULTIMATE.start_main_~#t426~0.base=|v_ULTIMATE.start_main_~#t426~0.base_19|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_402, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_43|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_37|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_50, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_219, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_314, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_593, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_264, ULTIMATE.start_main_~#t426~0.offset=|v_ULTIMATE.start_main_~#t426~0.offset_16|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_133, ~x~0=v_~x~0_233, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_388, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_73|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_275, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~x$mem_tmp~0=v_~x$mem_tmp~0_17, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_127|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_49|, ULTIMATE.start_main_~#t424~0.offset=|v_ULTIMATE.start_main_~#t424~0.offset_28|, ULTIMATE.start_main_~#t425~0.base=|v_ULTIMATE.start_main_~#t425~0.base_32|, ~y~0=v_~y~0_68, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_274, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_329, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_981, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_77|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_10|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_186, ULTIMATE.start_main_~#t424~0.base=|v_ULTIMATE.start_main_~#t424~0.base_40|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t425~0.offset, ~x$flush_delayed~0, ULTIMATE.start_main_~#t426~0.base, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t426~0.offset, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t424~0.offset, ULTIMATE.start_main_~#t425~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t424~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 19:22:47,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L823-1-->L825: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t425~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t425~0.base_11|) |v_ULTIMATE.start_main_~#t425~0.offset_10| 1)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t425~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t425~0.offset_10|) (= (select |v_#valid_38| |v_ULTIMATE.start_main_~#t425~0.base_11|) 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t425~0.base_11| 4) |v_#length_15|) (not (= 0 |v_ULTIMATE.start_main_~#t425~0.base_11|)) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t425~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t425~0.offset=|v_ULTIMATE.start_main_~#t425~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t425~0.base=|v_ULTIMATE.start_main_~#t425~0.base_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t425~0.offset, ULTIMATE.start_main_~#t425~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 19:22:47,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P1ENTRY-->L5-3: Formula: (and (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_9)) (= v_~x$w_buff1_used~0_59 v_~x$w_buff0_used~0_123) (= (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_122 256))) (not (= 0 (mod v_~x$w_buff1_used~0_59 256))))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|) (= 1 v_~x$w_buff0~0_27) (= v_P1Thread1of1ForFork0_~arg.offset_7 |v_P1Thread1of1ForFork0_#in~arg.offset_9|) (= 1 v_~x$w_buff0_used~0_122) (= v_~x$w_buff0~0_28 v_~x$w_buff1~0_20) (= v_P1Thread1of1ForFork0_~arg.base_7 |v_P1Thread1of1ForFork0_#in~arg.base_9|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_28, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_27, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_9, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_7, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_7, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|, ~x$w_buff1~0=v_~x$w_buff1~0_20, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_122} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 19:22:47,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L825-1-->L827: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t426~0.offset_10|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t426~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t426~0.base_11|)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t426~0.base_11| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t426~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t426~0.base_11|) |v_ULTIMATE.start_main_~#t426~0.offset_10| 2))) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t426~0.base_11| 4)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t426~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t426~0.base=|v_ULTIMATE.start_main_~#t426~0.base_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t426~0.offset=|v_ULTIMATE.start_main_~#t426~0.offset_10|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t426~0.base, #length, ULTIMATE.start_main_~#t426~0.offset, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 19:22:47,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L800-2-->L800-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-413139220 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-413139220 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out-413139220| ~x$w_buff1~0_In-413139220) (not .cse1)) (and (= ~x~0_In-413139220 |P2Thread1of1ForFork1_#t~ite32_Out-413139220|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-413139220, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-413139220, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-413139220, ~x~0=~x~0_In-413139220} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-413139220|, ~x$w_buff1~0=~x$w_buff1~0_In-413139220, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-413139220, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-413139220, ~x~0=~x~0_In-413139220} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 19:22:47,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-738717623 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-738717623 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-738717623| ~x$w_buff0_used~0_In-738717623)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-738717623| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-738717623, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-738717623} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-738717623, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-738717623|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-738717623} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 19:22:47,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L779-->L779-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In183886602 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In183886602 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In183886602 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In183886602 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out183886602| ~x$w_buff1_used~0_In183886602) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite29_Out183886602| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In183886602, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In183886602, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In183886602, ~x$w_buff0_used~0=~x$w_buff0_used~0_In183886602} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In183886602, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In183886602, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In183886602, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out183886602|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In183886602} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 19:22:47,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L780-->L781: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1794862317 256) 0)) (.cse2 (= ~x$r_buff0_thd2~0_Out-1794862317 ~x$r_buff0_thd2~0_In-1794862317)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1794862317 256) 0))) (or (and (= ~x$r_buff0_thd2~0_Out-1794862317 0) (not .cse0) (not .cse1)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1794862317, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1794862317} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1794862317|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1794862317, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1794862317} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 19:22:47,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1970608595 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In1970608595 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1970608595 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1970608595 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out1970608595| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite31_Out1970608595| ~x$r_buff1_thd2~0_In1970608595) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1970608595, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1970608595, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1970608595, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1970608595} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1970608595|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1970608595, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1970608595, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1970608595, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1970608595} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 19:22:47,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L781-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_51 |v_P1Thread1of1ForFork0_#t~ite31_32|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_51, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 19:22:47,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L744-->L744-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1120524939 256) 0))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In1120524939 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In1120524939 256) 0) .cse0) (and (= 0 (mod ~x$r_buff1_thd1~0_In1120524939 256)) .cse0) (= 0 (mod ~x$w_buff0_used~0_In1120524939 256)))) (= |P0Thread1of1ForFork2_#t~ite14_Out1120524939| ~x$w_buff0_used~0_In1120524939) .cse1 (= |P0Thread1of1ForFork2_#t~ite14_Out1120524939| |P0Thread1of1ForFork2_#t~ite15_Out1120524939|)) (and (= |P0Thread1of1ForFork2_#t~ite15_Out1120524939| ~x$w_buff0_used~0_In1120524939) (not .cse1) (= |P0Thread1of1ForFork2_#t~ite14_In1120524939| |P0Thread1of1ForFork2_#t~ite14_Out1120524939|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1120524939, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1120524939, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1120524939, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1120524939|, ~weak$$choice2~0=~weak$$choice2~0_In1120524939, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1120524939} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1120524939, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1120524939, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1120524939|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1120524939, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1120524939|, ~weak$$choice2~0=~weak$$choice2~0_In1120524939, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1120524939} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 19:22:47,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L745-->L745-8: Formula: (let ((.cse4 (= 0 (mod ~x$w_buff1_used~0_In-467638876 256))) (.cse0 (= (mod ~weak$$choice2~0_In-467638876 256) 0)) (.cse1 (= |P0Thread1of1ForFork2_#t~ite17_Out-467638876| |P0Thread1of1ForFork2_#t~ite18_Out-467638876|)) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-467638876 256))) (.cse5 (= 0 (mod ~x$w_buff0_used~0_In-467638876 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-467638876 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite16_In-467638876| |P0Thread1of1ForFork2_#t~ite16_Out-467638876|) (or (and .cse0 .cse1 (= |P0Thread1of1ForFork2_#t~ite17_Out-467638876| ~x$w_buff1_used~0_In-467638876) (or (and .cse2 .cse3) (and .cse4 .cse3) .cse5)) (and (= |P0Thread1of1ForFork2_#t~ite18_Out-467638876| ~x$w_buff1_used~0_In-467638876) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_Out-467638876| |P0Thread1of1ForFork2_#t~ite17_In-467638876|)))) (let ((.cse6 (not .cse3))) (and (or .cse6 (not .cse4)) .cse0 (= 0 |P0Thread1of1ForFork2_#t~ite16_Out-467638876|) (= |P0Thread1of1ForFork2_#t~ite17_Out-467638876| |P0Thread1of1ForFork2_#t~ite16_Out-467638876|) .cse1 (or .cse6 (not .cse2)) (not .cse5))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-467638876, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-467638876|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-467638876, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_In-467638876|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-467638876, ~weak$$choice2~0=~weak$$choice2~0_In-467638876, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-467638876} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-467638876, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-467638876|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-467638876|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-467638876, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_Out-467638876|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-467638876, ~weak$$choice2~0=~weak$$choice2~0_In-467638876, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-467638876} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17, P0Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-07 19:22:47,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L745-8-->L747: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite18_53| v_~x$w_buff1_used~0_577) (not (= 0 (mod v_~weak$$choice2~0_176 256))) (= v_~x$r_buff0_thd1~0_373 v_~x$r_buff0_thd1~0_372)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_373, P0Thread1of1ForFork2_#t~ite18=|v_P0Thread1of1ForFork2_#t~ite18_53|, ~weak$$choice2~0=v_~weak$$choice2~0_176} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_37|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_372, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_25|, P0Thread1of1ForFork2_#t~ite18=|v_P0Thread1of1ForFork2_#t~ite18_52|, P0Thread1of1ForFork2_#t~ite17=|v_P0Thread1of1ForFork2_#t~ite17_46|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_577, P0Thread1of1ForFork2_#t~ite16=|v_P0Thread1of1ForFork2_#t~ite16_42|, ~weak$$choice2~0=v_~weak$$choice2~0_176, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_13|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17, ~x$w_buff1_used~0, P0Thread1of1ForFork2_#t~ite16, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 19:22:47,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L800-4-->L801: Formula: (= v_~x~0_36 |v_P2Thread1of1ForFork1_#t~ite32_12|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_12|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_11|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_19|, ~x~0=v_~x~0_36} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 19:22:47,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L749-->L757: Formula: (and (= v_~x$flush_delayed~0_13 0) (not (= (mod v_~x$flush_delayed~0_14 256) 0)) (= v_~x$mem_tmp~0_5 v_~x~0_56) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_17|, ~x$flush_delayed~0=v_~x$flush_delayed~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_56} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 19:22:47,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In2146989218 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In2146989218 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out2146989218|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In2146989218 |P2Thread1of1ForFork1_#t~ite34_Out2146989218|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2146989218, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2146989218} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out2146989218|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2146989218, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2146989218} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 19:22:47,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L802-->L802-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In2022490315 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In2022490315 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In2022490315 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In2022490315 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite35_Out2022490315| ~x$w_buff1_used~0_In2022490315) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite35_Out2022490315| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2022490315, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2022490315, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2022490315, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2022490315} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out2022490315|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2022490315, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2022490315, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2022490315, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2022490315} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 19:22:47,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In847655870 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In847655870 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out847655870| 0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out847655870| ~x$r_buff0_thd3~0_In847655870) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In847655870, ~x$w_buff0_used~0=~x$w_buff0_used~0_In847655870} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out847655870|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In847655870, ~x$w_buff0_used~0=~x$w_buff0_used~0_In847655870} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 19:22:47,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L804-->L804-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In116570076 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In116570076 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In116570076 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In116570076 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite37_Out116570076| 0)) (and (or .cse3 .cse2) (= ~x$r_buff1_thd3~0_In116570076 |P2Thread1of1ForFork1_#t~ite37_Out116570076|) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In116570076, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In116570076, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In116570076, ~x$w_buff0_used~0=~x$w_buff0_used~0_In116570076} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out116570076|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In116570076, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In116570076, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In116570076, ~x$w_buff0_used~0=~x$w_buff0_used~0_In116570076} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 19:22:47,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L804-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82) (= |v_P2Thread1of1ForFork1_#t~ite37_40| v_~x$r_buff1_thd3~0_144)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_39|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_144, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 19:22:47,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L827-1-->L833: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 19:22:47,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L833-2-->L833-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite42_Out-1534604350| |ULTIMATE.start_main_#t~ite41_Out-1534604350|)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1534604350 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-1534604350 256) 0))) (or (and (not .cse0) (= ~x$w_buff1~0_In-1534604350 |ULTIMATE.start_main_#t~ite41_Out-1534604350|) (not .cse1) .cse2) (and .cse2 (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite41_Out-1534604350| ~x~0_In-1534604350)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1534604350, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1534604350, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1534604350, ~x~0=~x~0_In-1534604350} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1534604350|, ~x$w_buff1~0=~x$w_buff1~0_In-1534604350, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1534604350, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1534604350, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1534604350|, ~x~0=~x~0_In-1534604350} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 19:22:47,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1171981060 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1171981060 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-1171981060|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-1171981060 |ULTIMATE.start_main_#t~ite43_Out-1171981060|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1171981060, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1171981060} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1171981060, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1171981060|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1171981060} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 19:22:47,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L835-->L835-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-390473511 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-390473511 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-390473511 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-390473511 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-390473511| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-390473511 |ULTIMATE.start_main_#t~ite44_Out-390473511|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-390473511, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-390473511, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-390473511, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-390473511} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-390473511, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-390473511, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-390473511, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-390473511|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-390473511} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 19:22:47,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L836-->L836-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1271721695 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1271721695 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1271721695| ~x$r_buff0_thd0~0_In1271721695)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out1271721695| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1271721695, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1271721695} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1271721695, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1271721695|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1271721695} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 19:22:47,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L837-->L837-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1253444027 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1253444027 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1253444027 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In1253444027 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out1253444027| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite46_Out1253444027| ~x$r_buff1_thd0~0_In1253444027)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1253444027, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1253444027, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1253444027, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1253444027} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1253444027, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1253444027|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1253444027, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1253444027, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1253444027} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 19:22:47,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L837-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9| (mod v_~main$tmp_guard1~0_22 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_~__unbuffered_p1_EAX~0_205 0) (= v_~__unbuffered_p2_EBX~0_21 0) (= 0 v_~__unbuffered_p0_EAX~0_34))) 1 0)) 0 1) v_~main$tmp_guard1~0_22) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~x$r_buff1_thd0~0_258 |v_ULTIMATE.start_main_#t~ite46_45|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_205, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_45|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_205, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_44|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_258, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:22:47,125 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ab81682c-dd23-4b4d-b324-911df412abb5/bin/utaipan/witness.graphml [2019-12-07 19:22:47,126 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:22:47,127 INFO L168 Benchmark]: Toolchain (without parser) took 50768.56 ms. Allocated memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 938.2 MB in the beginning and 1.6 GB in the end (delta: -693.2 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2019-12-07 19:22:47,127 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:22:47,127 INFO L168 Benchmark]: CACSL2BoogieTranslator took 371.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -124.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 19:22:47,127 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:22:47,128 INFO L168 Benchmark]: Boogie Preprocessor took 25.36 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:22:47,128 INFO L168 Benchmark]: RCFGBuilder took 399.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:22:47,128 INFO L168 Benchmark]: TraceAbstraction took 49869.31 ms. Allocated memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: 3.0 GB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -645.1 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2019-12-07 19:22:47,128 INFO L168 Benchmark]: Witness Printer took 62.29 ms. Allocated memory is still 4.2 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2019-12-07 19:22:47,130 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 371.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -124.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.36 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 399.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 49869.31 ms. Allocated memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: 3.0 GB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -645.1 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 62.29 ms. Allocated memory is still 4.2 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 165 ProgramPointsBefore, 83 ProgramPointsAfterwards, 196 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 6986 VarBasedMoverChecksPositive, 284 VarBasedMoverChecksNegative, 112 SemBasedMoverChecksPositive, 261 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 75392 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t424, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L825] FCALL, FORK 0 pthread_create(&t425, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L827] FCALL, FORK 0 pthread_create(&t426, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L791] 3 y = 1 [L794] 3 __unbuffered_p2_EAX = y [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L800] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L734] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L741] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L742] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L743] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L747] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L747] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L801] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L802] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L803] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L835] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L836] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 49.7s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 17.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6507 SDtfs, 9541 SDslu, 27352 SDs, 0 SdLazy, 18340 SolverSat, 387 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 435 GetRequests, 36 SyntacticMatches, 19 SemanticMatches, 380 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1682 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86190occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.4s AutomataMinimizationTime, 29 MinimizatonAttempts, 161162 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1239 NumberOfCodeBlocks, 1239 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1155 ConstructedInterpolants, 0 QuantifiedInterpolants, 367329 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...