./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi006_tso.oepc.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_a413d967-f822-48ce-85b6-d08e30b4bfb6/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a413d967-f822-48ce-85b6-d08e30b4bfb6/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a413d967-f822-48ce-85b6-d08e30b4bfb6/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a413d967-f822-48ce-85b6-d08e30b4bfb6/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi006_tso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a413d967-f822-48ce-85b6-d08e30b4bfb6/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a413d967-f822-48ce-85b6-d08e30b4bfb6/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 9eee5a203058bfaefe746c3f75c372f6fe599ecb .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 14:38:23,888 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:38:23,890 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:38:23,897 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:38:23,897 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:38:23,898 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:38:23,899 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:38:23,900 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:38:23,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:38:23,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:38:23,903 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:38:23,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:38:23,904 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:38:23,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:38:23,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:38:23,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:38:23,906 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:38:23,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:38:23,908 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:38:23,910 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:38:23,911 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:38:23,912 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:38:23,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:38:23,913 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:38:23,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:38:23,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:38:23,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:38:23,915 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:38:23,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:38:23,916 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:38:23,916 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:38:23,917 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:38:23,917 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:38:23,917 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:38:23,918 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:38:23,918 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:38:23,919 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:38:23,919 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:38:23,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:38:23,919 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:38:23,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:38:23,920 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a413d967-f822-48ce-85b6-d08e30b4bfb6/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 14:38:23,930 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:38:23,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:38:23,931 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 14:38:23,931 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 14:38:23,931 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 14:38:23,931 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 14:38:23,931 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 14:38:23,932 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 14:38:23,932 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 14:38:23,932 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 14:38:23,932 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 14:38:23,932 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 14:38:23,932 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 14:38:23,932 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 14:38:23,932 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 14:38:23,933 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:38:23,933 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:38:23,933 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:38:23,933 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:38:23,933 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:38:23,934 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:38:23,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:38:23,934 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:38:23,934 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:38:23,934 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:38:23,934 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:38:23,934 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:38:23,934 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:38:23,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:38:23,935 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:38:23,935 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:38:23,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:38:23,935 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:38:23,935 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:38:23,935 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:38:23,935 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 14:38:23,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:38:23,936 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:38:23,936 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:38:23,936 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:38:23,936 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_a413d967-f822-48ce-85b6-d08e30b4bfb6/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 -> 9eee5a203058bfaefe746c3f75c372f6fe599ecb [2019-12-07 14:38:24,035 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:38:24,043 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:38:24,045 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:38:24,046 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:38:24,047 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:38:24,047 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a413d967-f822-48ce-85b6-d08e30b4bfb6/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi006_tso.oepc.i [2019-12-07 14:38:24,093 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a413d967-f822-48ce-85b6-d08e30b4bfb6/bin/utaipan/data/94582c652/bc5c83d4cc2349d084812d14a94c0a2f/FLAG21a830a9a [2019-12-07 14:38:24,505 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:38:24,506 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a413d967-f822-48ce-85b6-d08e30b4bfb6/sv-benchmarks/c/pthread-wmm/rfi006_tso.oepc.i [2019-12-07 14:38:24,517 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a413d967-f822-48ce-85b6-d08e30b4bfb6/bin/utaipan/data/94582c652/bc5c83d4cc2349d084812d14a94c0a2f/FLAG21a830a9a [2019-12-07 14:38:24,863 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a413d967-f822-48ce-85b6-d08e30b4bfb6/bin/utaipan/data/94582c652/bc5c83d4cc2349d084812d14a94c0a2f [2019-12-07 14:38:24,865 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:38:24,866 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:38:24,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:38:24,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:38:24,868 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:38:24,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:38:24" (1/1) ... [2019-12-07 14:38:24,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a5ede1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:38:24, skipping insertion in model container [2019-12-07 14:38:24,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:38:24" (1/1) ... [2019-12-07 14:38:24,875 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:38:24,903 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:38:25,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:38:25,152 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:38:25,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:38:25,240 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:38:25,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:38:25 WrapperNode [2019-12-07 14:38:25,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:38:25,241 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:38:25,241 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:38:25,241 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:38:25,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:38:25" (1/1) ... [2019-12-07 14:38:25,260 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:38:25" (1/1) ... [2019-12-07 14:38:25,282 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:38:25,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:38:25,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:38:25,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:38:25,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:38:25" (1/1) ... [2019-12-07 14:38:25,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:38:25" (1/1) ... [2019-12-07 14:38:25,293 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:38:25" (1/1) ... [2019-12-07 14:38:25,293 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:38:25" (1/1) ... [2019-12-07 14:38:25,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:38:25" (1/1) ... [2019-12-07 14:38:25,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:38:25" (1/1) ... [2019-12-07 14:38:25,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:38:25" (1/1) ... [2019-12-07 14:38:25,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:38:25,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:38:25,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:38:25,311 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:38:25,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:38:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a413d967-f822-48ce-85b6-d08e30b4bfb6/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 14:38:25,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:38:25,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 14:38:25,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:38:25,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:38:25,355 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 14:38:25,355 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 14:38:25,355 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 14:38:25,355 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 14:38:25,356 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 14:38:25,356 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 14:38:25,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 14:38:25,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:38:25,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:38:25,357 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 14:38:25,799 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:38:25,799 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:38:25,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:38:25 BoogieIcfgContainer [2019-12-07 14:38:25,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:38:25,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:38:25,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:38:25,803 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:38:25,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:38:24" (1/3) ... [2019-12-07 14:38:25,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b28d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:38:25, skipping insertion in model container [2019-12-07 14:38:25,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:38:25" (2/3) ... [2019-12-07 14:38:25,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b28d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:38:25, skipping insertion in model container [2019-12-07 14:38:25,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:38:25" (3/3) ... [2019-12-07 14:38:25,805 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi006_tso.oepc.i [2019-12-07 14:38:25,811 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 14:38:25,811 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:38:25,817 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 14:38:25,817 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 14:38:25,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,844 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,844 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,849 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,849 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,849 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,849 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,849 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,861 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,862 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:38:25,875 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 14:38:25,888 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:38:25,888 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:38:25,888 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:38:25,888 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:38:25,888 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:38:25,888 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:38:25,888 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:38:25,888 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:38:25,902 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 217 places, 275 transitions [2019-12-07 14:38:25,903 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 217 places, 275 transitions [2019-12-07 14:38:25,978 INFO L134 PetriNetUnfolder]: 68/272 cut-off events. [2019-12-07 14:38:25,978 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:38:25,992 INFO L76 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 272 events. 68/272 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1021 event pairs. 9/211 useless extension candidates. Maximal degree in co-relation 242. Up to 2 conditions per place. [2019-12-07 14:38:26,021 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 217 places, 275 transitions [2019-12-07 14:38:26,067 INFO L134 PetriNetUnfolder]: 68/272 cut-off events. [2019-12-07 14:38:26,068 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:38:26,079 INFO L76 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 272 events. 68/272 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1021 event pairs. 9/211 useless extension candidates. Maximal degree in co-relation 242. Up to 2 conditions per place. [2019-12-07 14:38:26,111 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 35344 [2019-12-07 14:38:26,111 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 14:38:29,686 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 14:38:29,788 INFO L206 etLargeBlockEncoding]: Checked pairs total: 191480 [2019-12-07 14:38:29,788 INFO L214 etLargeBlockEncoding]: Total number of compositions: 129 [2019-12-07 14:38:29,790 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 128 places, 150 transitions [2019-12-07 14:40:50,495 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 369840 states. [2019-12-07 14:40:50,497 INFO L276 IsEmpty]: Start isEmpty. Operand 369840 states. [2019-12-07 14:40:50,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 14:40:50,501 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:40:50,501 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 14:40:50,502 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:40:50,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:40:50,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1098940000, now seen corresponding path program 1 times [2019-12-07 14:40:50,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:40:50,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310682287] [2019-12-07 14:40:50,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:40:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:40:50,646 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 14:40:50,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310682287] [2019-12-07 14:40:50,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:40:50,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:40:50,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505608977] [2019-12-07 14:40:50,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:40:50,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:40:50,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:40:50,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:40:50,661 INFO L87 Difference]: Start difference. First operand 369840 states. Second operand 3 states. [2019-12-07 14:40:52,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:40:52,679 INFO L93 Difference]: Finished difference Result 369534 states and 1673484 transitions. [2019-12-07 14:40:52,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:40:52,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 14:40:52,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:40:57,251 INFO L225 Difference]: With dead ends: 369534 [2019-12-07 14:40:57,251 INFO L226 Difference]: Without dead ends: 361708 [2019-12-07 14:40:57,252 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 14:41:34,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361708 states. [2019-12-07 14:41:38,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361708 to 361708. [2019-12-07 14:41:38,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361708 states. [2019-12-07 14:41:44,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361708 states to 361708 states and 1639814 transitions. [2019-12-07 14:41:44,574 INFO L78 Accepts]: Start accepts. Automaton has 361708 states and 1639814 transitions. Word has length 5 [2019-12-07 14:41:44,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:44,574 INFO L462 AbstractCegarLoop]: Abstraction has 361708 states and 1639814 transitions. [2019-12-07 14:41:44,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:41:44,574 INFO L276 IsEmpty]: Start isEmpty. Operand 361708 states and 1639814 transitions. [2019-12-07 14:41:44,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:41:44,576 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:44,576 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:41:44,577 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:41:44,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:44,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1844925563, now seen corresponding path program 1 times [2019-12-07 14:41:44,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:41:44,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743501370] [2019-12-07 14:41:44,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:44,627 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 14:41:44,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743501370] [2019-12-07 14:41:44,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:44,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:41:44,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103762040] [2019-12-07 14:41:44,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:41:44,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:41:44,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:41:44,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:41:44,630 INFO L87 Difference]: Start difference. First operand 361708 states and 1639814 transitions. Second operand 4 states. [2019-12-07 14:41:48,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:48,256 INFO L93 Difference]: Finished difference Result 567682 states and 2473754 transitions. [2019-12-07 14:41:48,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:41:48,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 14:41:48,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:49,932 INFO L225 Difference]: With dead ends: 567682 [2019-12-07 14:41:49,932 INFO L226 Difference]: Without dead ends: 567633 [2019-12-07 14:41:49,933 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 14:42:36,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567633 states. [2019-12-07 14:42:44,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567633 to 549089. [2019-12-07 14:42:44,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549089 states. [2019-12-07 14:42:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549089 states to 549089 states and 2406253 transitions. [2019-12-07 14:42:47,144 INFO L78 Accepts]: Start accepts. Automaton has 549089 states and 2406253 transitions. Word has length 11 [2019-12-07 14:42:47,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:42:47,145 INFO L462 AbstractCegarLoop]: Abstraction has 549089 states and 2406253 transitions. [2019-12-07 14:42:47,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:42:47,145 INFO L276 IsEmpty]: Start isEmpty. Operand 549089 states and 2406253 transitions. [2019-12-07 14:42:47,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 14:42:47,149 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:42:47,150 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:42:47,150 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:42:47,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:42:47,150 INFO L82 PathProgramCache]: Analyzing trace with hash -558740404, now seen corresponding path program 1 times [2019-12-07 14:42:47,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:42:47,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127673138] [2019-12-07 14:42:47,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:42:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:42:47,193 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 14:42:47,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127673138] [2019-12-07 14:42:47,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:42:47,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:42:47,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180026203] [2019-12-07 14:42:47,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:42:47,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:42:47,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:42:47,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:42:47,195 INFO L87 Difference]: Start difference. First operand 549089 states and 2406253 transitions. Second operand 4 states. [2019-12-07 14:42:58,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:42:58,454 INFO L93 Difference]: Finished difference Result 796624 states and 3413018 transitions. [2019-12-07 14:42:58,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:42:58,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 14:42:58,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:43:01,150 INFO L225 Difference]: With dead ends: 796624 [2019-12-07 14:43:01,150 INFO L226 Difference]: Without dead ends: 796561 [2019-12-07 14:43:01,150 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 14:43:49,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796561 states. [2019-12-07 14:43:59,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796561 to 689899. [2019-12-07 14:43:59,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689899 states. [2019-12-07 14:44:15,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689899 states to 689899 states and 2996600 transitions. [2019-12-07 14:44:15,688 INFO L78 Accepts]: Start accepts. Automaton has 689899 states and 2996600 transitions. Word has length 13 [2019-12-07 14:44:15,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:15,688 INFO L462 AbstractCegarLoop]: Abstraction has 689899 states and 2996600 transitions. [2019-12-07 14:44:15,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:44:15,689 INFO L276 IsEmpty]: Start isEmpty. Operand 689899 states and 2996600 transitions. [2019-12-07 14:44:15,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 14:44:15,691 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:15,691 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:44:15,691 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:15,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:15,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1948687637, now seen corresponding path program 1 times [2019-12-07 14:44:15,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:44:15,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818699065] [2019-12-07 14:44:15,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:15,740 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 14:44:15,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818699065] [2019-12-07 14:44:15,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:15,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:44:15,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623452490] [2019-12-07 14:44:15,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:44:15,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:44:15,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:44:15,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:44:15,741 INFO L87 Difference]: Start difference. First operand 689899 states and 2996600 transitions. Second operand 4 states. [2019-12-07 14:44:16,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:16,219 INFO L93 Difference]: Finished difference Result 124439 states and 432912 transitions. [2019-12-07 14:44:16,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:44:16,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 14:44:16,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:16,424 INFO L225 Difference]: With dead ends: 124439 [2019-12-07 14:44:16,425 INFO L226 Difference]: Without dead ends: 108723 [2019-12-07 14:44:16,425 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 14:44:17,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108723 states. [2019-12-07 14:44:21,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108723 to 108723. [2019-12-07 14:44:21,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108723 states. [2019-12-07 14:44:22,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108723 states to 108723 states and 370582 transitions. [2019-12-07 14:44:22,069 INFO L78 Accepts]: Start accepts. Automaton has 108723 states and 370582 transitions. Word has length 13 [2019-12-07 14:44:22,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:22,070 INFO L462 AbstractCegarLoop]: Abstraction has 108723 states and 370582 transitions. [2019-12-07 14:44:22,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:44:22,070 INFO L276 IsEmpty]: Start isEmpty. Operand 108723 states and 370582 transitions. [2019-12-07 14:44:22,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 14:44:22,075 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:22,075 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:44:22,075 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:22,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:22,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1752068085, now seen corresponding path program 1 times [2019-12-07 14:44:22,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:44:22,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932710125] [2019-12-07 14:44:22,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:22,126 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 14:44:22,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932710125] [2019-12-07 14:44:22,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:22,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:44:22,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742055774] [2019-12-07 14:44:22,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:44:22,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:44:22,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:44:22,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:44:22,128 INFO L87 Difference]: Start difference. First operand 108723 states and 370582 transitions. Second operand 5 states. [2019-12-07 14:44:23,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:23,294 INFO L93 Difference]: Finished difference Result 145582 states and 487208 transitions. [2019-12-07 14:44:23,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:44:23,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 14:44:23,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:23,535 INFO L225 Difference]: With dead ends: 145582 [2019-12-07 14:44:23,535 INFO L226 Difference]: Without dead ends: 145401 [2019-12-07 14:44:23,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:44:24,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145401 states. [2019-12-07 14:44:26,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145401 to 108884. [2019-12-07 14:44:26,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108884 states. [2019-12-07 14:44:26,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108884 states to 108884 states and 371040 transitions. [2019-12-07 14:44:26,318 INFO L78 Accepts]: Start accepts. Automaton has 108884 states and 371040 transitions. Word has length 19 [2019-12-07 14:44:26,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:26,318 INFO L462 AbstractCegarLoop]: Abstraction has 108884 states and 371040 transitions. [2019-12-07 14:44:26,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:44:26,318 INFO L276 IsEmpty]: Start isEmpty. Operand 108884 states and 371040 transitions. [2019-12-07 14:44:26,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 14:44:26,331 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:26,331 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 14:44:26,332 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:26,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:26,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1897263464, now seen corresponding path program 1 times [2019-12-07 14:44:26,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:44:26,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154891088] [2019-12-07 14:44:26,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:26,393 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 14:44:26,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154891088] [2019-12-07 14:44:26,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:26,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:44:26,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235985754] [2019-12-07 14:44:26,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:44:26,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:44:26,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:44:26,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:44:26,394 INFO L87 Difference]: Start difference. First operand 108884 states and 371040 transitions. Second operand 5 states. [2019-12-07 14:44:27,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:27,190 INFO L93 Difference]: Finished difference Result 149460 states and 499353 transitions. [2019-12-07 14:44:27,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:44:27,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 14:44:27,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:27,453 INFO L225 Difference]: With dead ends: 149460 [2019-12-07 14:44:27,454 INFO L226 Difference]: Without dead ends: 149460 [2019-12-07 14:44:27,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 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 14:44:28,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149460 states. [2019-12-07 14:44:30,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149460 to 121395. [2019-12-07 14:44:30,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121395 states. [2019-12-07 14:44:30,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121395 states to 121395 states and 411058 transitions. [2019-12-07 14:44:30,441 INFO L78 Accepts]: Start accepts. Automaton has 121395 states and 411058 transitions. Word has length 25 [2019-12-07 14:44:30,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:30,442 INFO L462 AbstractCegarLoop]: Abstraction has 121395 states and 411058 transitions. [2019-12-07 14:44:30,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:44:30,442 INFO L276 IsEmpty]: Start isEmpty. Operand 121395 states and 411058 transitions. [2019-12-07 14:44:30,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 14:44:30,453 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:30,453 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 14:44:30,453 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:30,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:30,453 INFO L82 PathProgramCache]: Analyzing trace with hash -566309864, now seen corresponding path program 1 times [2019-12-07 14:44:30,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:44:30,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51732437] [2019-12-07 14:44:30,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:30,576 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 14:44:30,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51732437] [2019-12-07 14:44:30,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:30,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:44:30,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822320324] [2019-12-07 14:44:30,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:44:30,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:44:30,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:44:30,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:44:30,577 INFO L87 Difference]: Start difference. First operand 121395 states and 411058 transitions. Second operand 7 states. [2019-12-07 14:44:31,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:31,719 INFO L93 Difference]: Finished difference Result 163957 states and 545968 transitions. [2019-12-07 14:44:31,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 14:44:31,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-12-07 14:44:31,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:32,001 INFO L225 Difference]: With dead ends: 163957 [2019-12-07 14:44:32,001 INFO L226 Difference]: Without dead ends: 163957 [2019-12-07 14:44:32,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:44:33,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163957 states. [2019-12-07 14:44:34,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163957 to 129279. [2019-12-07 14:44:34,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129279 states. [2019-12-07 14:44:35,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129279 states to 129279 states and 436984 transitions. [2019-12-07 14:44:35,083 INFO L78 Accepts]: Start accepts. Automaton has 129279 states and 436984 transitions. Word has length 25 [2019-12-07 14:44:35,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:35,084 INFO L462 AbstractCegarLoop]: Abstraction has 129279 states and 436984 transitions. [2019-12-07 14:44:35,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:44:35,084 INFO L276 IsEmpty]: Start isEmpty. Operand 129279 states and 436984 transitions. [2019-12-07 14:44:35,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 14:44:35,109 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:35,109 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:44:35,109 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:35,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:35,110 INFO L82 PathProgramCache]: Analyzing trace with hash -341911644, now seen corresponding path program 1 times [2019-12-07 14:44:35,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:44:35,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084986144] [2019-12-07 14:44:35,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:35,167 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 14:44:35,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084986144] [2019-12-07 14:44:35,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:35,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:44:35,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217607200] [2019-12-07 14:44:35,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:44:35,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:44:35,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:44:35,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:44:35,168 INFO L87 Difference]: Start difference. First operand 129279 states and 436984 transitions. Second operand 6 states. [2019-12-07 14:44:36,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:36,571 INFO L93 Difference]: Finished difference Result 160543 states and 536520 transitions. [2019-12-07 14:44:36,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 14:44:36,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-07 14:44:36,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:37,142 INFO L225 Difference]: With dead ends: 160543 [2019-12-07 14:44:37,142 INFO L226 Difference]: Without dead ends: 160530 [2019-12-07 14:44:37,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-12-07 14:44:38,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160530 states. [2019-12-07 14:44:39,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160530 to 121422. [2019-12-07 14:44:39,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121422 states. [2019-12-07 14:44:40,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121422 states to 121422 states and 412335 transitions. [2019-12-07 14:44:40,121 INFO L78 Accepts]: Start accepts. Automaton has 121422 states and 412335 transitions. Word has length 31 [2019-12-07 14:44:40,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:40,121 INFO L462 AbstractCegarLoop]: Abstraction has 121422 states and 412335 transitions. [2019-12-07 14:44:40,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:44:40,121 INFO L276 IsEmpty]: Start isEmpty. Operand 121422 states and 412335 transitions. [2019-12-07 14:44:40,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 14:44:40,167 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:40,167 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 14:44:40,167 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:40,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:40,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1753706925, now seen corresponding path program 1 times [2019-12-07 14:44:40,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:44:40,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842087344] [2019-12-07 14:44:40,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:40,230 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 14:44:40,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842087344] [2019-12-07 14:44:40,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:40,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:44:40,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948755830] [2019-12-07 14:44:40,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:44:40,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:44:40,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:44:40,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:44:40,232 INFO L87 Difference]: Start difference. First operand 121422 states and 412335 transitions. Second operand 5 states. [2019-12-07 14:44:40,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:40,334 INFO L93 Difference]: Finished difference Result 25283 states and 75711 transitions. [2019-12-07 14:44:40,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:44:40,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-07 14:44:40,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:40,362 INFO L225 Difference]: With dead ends: 25283 [2019-12-07 14:44:40,362 INFO L226 Difference]: Without dead ends: 22542 [2019-12-07 14:44:40,362 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 14:44:40,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22542 states. [2019-12-07 14:44:40,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22542 to 22346. [2019-12-07 14:44:40,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22346 states. [2019-12-07 14:44:40,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22346 states to 22346 states and 66567 transitions. [2019-12-07 14:44:40,682 INFO L78 Accepts]: Start accepts. Automaton has 22346 states and 66567 transitions. Word has length 39 [2019-12-07 14:44:40,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:40,682 INFO L462 AbstractCegarLoop]: Abstraction has 22346 states and 66567 transitions. [2019-12-07 14:44:40,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:44:40,682 INFO L276 IsEmpty]: Start isEmpty. Operand 22346 states and 66567 transitions. [2019-12-07 14:44:40,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 14:44:40,700 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:40,700 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] [2019-12-07 14:44:40,701 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:40,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:40,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1301524176, now seen corresponding path program 1 times [2019-12-07 14:44:40,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:44:40,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503590565] [2019-12-07 14:44:40,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:40,766 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 14:44:40,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503590565] [2019-12-07 14:44:40,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:40,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:44:40,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545256705] [2019-12-07 14:44:40,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:44:40,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:44:40,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:44:40,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:44:40,767 INFO L87 Difference]: Start difference. First operand 22346 states and 66567 transitions. Second operand 6 states. [2019-12-07 14:44:40,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:40,855 INFO L93 Difference]: Finished difference Result 17777 states and 55449 transitions. [2019-12-07 14:44:40,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:44:40,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-07 14:44:40,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:40,875 INFO L225 Difference]: With dead ends: 17777 [2019-12-07 14:44:40,875 INFO L226 Difference]: Without dead ends: 17636 [2019-12-07 14:44:40,876 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:44:40,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17636 states. [2019-12-07 14:44:41,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17636 to 17125. [2019-12-07 14:44:41,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17125 states. [2019-12-07 14:44:41,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17125 states to 17125 states and 53767 transitions. [2019-12-07 14:44:41,133 INFO L78 Accepts]: Start accepts. Automaton has 17125 states and 53767 transitions. Word has length 51 [2019-12-07 14:44:41,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:41,133 INFO L462 AbstractCegarLoop]: Abstraction has 17125 states and 53767 transitions. [2019-12-07 14:44:41,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:44:41,134 INFO L276 IsEmpty]: Start isEmpty. Operand 17125 states and 53767 transitions. [2019-12-07 14:44:41,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 14:44:41,150 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:44:41,150 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:41,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:41,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1843300501, now seen corresponding path program 1 times [2019-12-07 14:44:41,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:44:41,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984715981] [2019-12-07 14:44:41,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:41,230 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 14:44:41,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984715981] [2019-12-07 14:44:41,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:41,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:44:41,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125478833] [2019-12-07 14:44:41,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:44:41,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:44:41,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:44:41,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:44:41,231 INFO L87 Difference]: Start difference. First operand 17125 states and 53767 transitions. Second operand 3 states. [2019-12-07 14:44:41,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:41,276 INFO L93 Difference]: Finished difference Result 16136 states and 49928 transitions. [2019-12-07 14:44:41,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:44:41,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-12-07 14:44:41,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:41,295 INFO L225 Difference]: With dead ends: 16136 [2019-12-07 14:44:41,295 INFO L226 Difference]: Without dead ends: 16136 [2019-12-07 14:44:41,295 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 14:44:41,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16136 states. [2019-12-07 14:44:41,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16136 to 16136. [2019-12-07 14:44:41,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16136 states. [2019-12-07 14:44:41,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16136 states to 16136 states and 49928 transitions. [2019-12-07 14:44:41,523 INFO L78 Accepts]: Start accepts. Automaton has 16136 states and 49928 transitions. Word has length 81 [2019-12-07 14:44:41,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:41,523 INFO L462 AbstractCegarLoop]: Abstraction has 16136 states and 49928 transitions. [2019-12-07 14:44:41,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:44:41,524 INFO L276 IsEmpty]: Start isEmpty. Operand 16136 states and 49928 transitions. [2019-12-07 14:44:41,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-07 14:44:41,539 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:41,539 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:44:41,539 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:41,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:41,539 INFO L82 PathProgramCache]: Analyzing trace with hash -2142857781, now seen corresponding path program 1 times [2019-12-07 14:44:41,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:44:41,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963811093] [2019-12-07 14:44:41,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:41,604 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 14:44:41,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963811093] [2019-12-07 14:44:41,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:41,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:44:41,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959377181] [2019-12-07 14:44:41,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:44:41,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:44:41,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:44:41,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:44:41,605 INFO L87 Difference]: Start difference. First operand 16136 states and 49928 transitions. Second operand 3 states. [2019-12-07 14:44:41,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:41,653 INFO L93 Difference]: Finished difference Result 16136 states and 49326 transitions. [2019-12-07 14:44:41,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:44:41,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-12-07 14:44:41,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:41,671 INFO L225 Difference]: With dead ends: 16136 [2019-12-07 14:44:41,672 INFO L226 Difference]: Without dead ends: 16136 [2019-12-07 14:44:41,672 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 14:44:41,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16136 states. [2019-12-07 14:44:41,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16136 to 16136. [2019-12-07 14:44:41,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16136 states. [2019-12-07 14:44:41,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16136 states to 16136 states and 49326 transitions. [2019-12-07 14:44:41,947 INFO L78 Accepts]: Start accepts. Automaton has 16136 states and 49326 transitions. Word has length 82 [2019-12-07 14:44:41,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:41,947 INFO L462 AbstractCegarLoop]: Abstraction has 16136 states and 49326 transitions. [2019-12-07 14:44:41,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:44:41,947 INFO L276 IsEmpty]: Start isEmpty. Operand 16136 states and 49326 transitions. [2019-12-07 14:44:41,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 14:44:41,962 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:41,962 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:44:41,962 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:41,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:41,962 INFO L82 PathProgramCache]: Analyzing trace with hash -2037369059, now seen corresponding path program 1 times [2019-12-07 14:44:41,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:44:41,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083394426] [2019-12-07 14:44:41,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:42,038 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 14:44:42,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083394426] [2019-12-07 14:44:42,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:42,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:44:42,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792136946] [2019-12-07 14:44:42,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:44:42,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:44:42,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:44:42,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:44:42,039 INFO L87 Difference]: Start difference. First operand 16136 states and 49326 transitions. Second operand 3 states. [2019-12-07 14:44:42,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:42,101 INFO L93 Difference]: Finished difference Result 16136 states and 49325 transitions. [2019-12-07 14:44:42,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:44:42,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-07 14:44:42,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:42,118 INFO L225 Difference]: With dead ends: 16136 [2019-12-07 14:44:42,118 INFO L226 Difference]: Without dead ends: 16136 [2019-12-07 14:44:42,119 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 14:44:42,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16136 states. [2019-12-07 14:44:42,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16136 to 16136. [2019-12-07 14:44:42,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16136 states. [2019-12-07 14:44:42,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16136 states to 16136 states and 49325 transitions. [2019-12-07 14:44:42,348 INFO L78 Accepts]: Start accepts. Automaton has 16136 states and 49325 transitions. Word has length 83 [2019-12-07 14:44:42,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:42,349 INFO L462 AbstractCegarLoop]: Abstraction has 16136 states and 49325 transitions. [2019-12-07 14:44:42,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:44:42,349 INFO L276 IsEmpty]: Start isEmpty. Operand 16136 states and 49325 transitions. [2019-12-07 14:44:42,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 14:44:42,362 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:42,363 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:44:42,363 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:42,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:42,363 INFO L82 PathProgramCache]: Analyzing trace with hash -826485961, now seen corresponding path program 1 times [2019-12-07 14:44:42,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:44:42,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417626071] [2019-12-07 14:44:42,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:42,446 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 14:44:42,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417626071] [2019-12-07 14:44:42,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:42,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:44:42,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034608236] [2019-12-07 14:44:42,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:44:42,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:44:42,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:44:42,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:44:42,447 INFO L87 Difference]: Start difference. First operand 16136 states and 49325 transitions. Second operand 6 states. [2019-12-07 14:44:42,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:42,585 INFO L93 Difference]: Finished difference Result 31185 states and 95274 transitions. [2019-12-07 14:44:42,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:44:42,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-12-07 14:44:42,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:42,602 INFO L225 Difference]: With dead ends: 31185 [2019-12-07 14:44:42,602 INFO L226 Difference]: Without dead ends: 16058 [2019-12-07 14:44:42,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:44:42,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16058 states. [2019-12-07 14:44:42,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16058 to 13496. [2019-12-07 14:44:42,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13496 states. [2019-12-07 14:44:42,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13496 states to 13496 states and 40985 transitions. [2019-12-07 14:44:42,814 INFO L78 Accepts]: Start accepts. Automaton has 13496 states and 40985 transitions. Word has length 84 [2019-12-07 14:44:42,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:42,814 INFO L462 AbstractCegarLoop]: Abstraction has 13496 states and 40985 transitions. [2019-12-07 14:44:42,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:44:42,814 INFO L276 IsEmpty]: Start isEmpty. Operand 13496 states and 40985 transitions. [2019-12-07 14:44:42,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 14:44:42,826 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:42,826 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:44:42,826 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:42,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:42,826 INFO L82 PathProgramCache]: Analyzing trace with hash -23031457, now seen corresponding path program 2 times [2019-12-07 14:44:42,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:44:42,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210569147] [2019-12-07 14:44:42,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:42,885 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 14:44:42,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210569147] [2019-12-07 14:44:42,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:42,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:44:42,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220092513] [2019-12-07 14:44:42,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:44:42,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:44:42,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:44:42,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:44:42,886 INFO L87 Difference]: Start difference. First operand 13496 states and 40985 transitions. Second operand 5 states. [2019-12-07 14:44:42,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:42,962 INFO L93 Difference]: Finished difference Result 15410 states and 46355 transitions. [2019-12-07 14:44:42,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:44:42,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-12-07 14:44:42,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:42,964 INFO L225 Difference]: With dead ends: 15410 [2019-12-07 14:44:42,964 INFO L226 Difference]: Without dead ends: 2051 [2019-12-07 14:44:42,964 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:44:42,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2019-12-07 14:44:42,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 2051. [2019-12-07 14:44:42,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2051 states. [2019-12-07 14:44:42,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 2051 states and 5643 transitions. [2019-12-07 14:44:42,990 INFO L78 Accepts]: Start accepts. Automaton has 2051 states and 5643 transitions. Word has length 84 [2019-12-07 14:44:42,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:42,990 INFO L462 AbstractCegarLoop]: Abstraction has 2051 states and 5643 transitions. [2019-12-07 14:44:42,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:44:42,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 5643 transitions. [2019-12-07 14:44:42,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 14:44:42,991 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:42,991 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:44:42,992 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:42,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:42,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1320321601, now seen corresponding path program 3 times [2019-12-07 14:44:42,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:44:42,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971012539] [2019-12-07 14:44:42,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:43,066 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 14:44:43,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971012539] [2019-12-07 14:44:43,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:43,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:44:43,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17648342] [2019-12-07 14:44:43,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:44:43,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:44:43,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:44:43,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:44:43,067 INFO L87 Difference]: Start difference. First operand 2051 states and 5643 transitions. Second operand 4 states. [2019-12-07 14:44:43,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:43,141 INFO L93 Difference]: Finished difference Result 2048 states and 5626 transitions. [2019-12-07 14:44:43,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:44:43,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-12-07 14:44:43,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:43,143 INFO L225 Difference]: With dead ends: 2048 [2019-12-07 14:44:43,143 INFO L226 Difference]: Without dead ends: 2048 [2019-12-07 14:44:43,143 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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 14:44:43,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2019-12-07 14:44:43,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 2048. [2019-12-07 14:44:43,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2048 states. [2019-12-07 14:44:43,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 5626 transitions. [2019-12-07 14:44:43,169 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 5626 transitions. Word has length 84 [2019-12-07 14:44:43,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:43,170 INFO L462 AbstractCegarLoop]: Abstraction has 2048 states and 5626 transitions. [2019-12-07 14:44:43,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:44:43,170 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 5626 transitions. [2019-12-07 14:44:43,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 14:44:43,171 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:43,171 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:44:43,171 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:43,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:43,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1888396880, now seen corresponding path program 1 times [2019-12-07 14:44:43,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:44:43,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769905877] [2019-12-07 14:44:43,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:43,553 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 14:44:43,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769905877] [2019-12-07 14:44:43,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:43,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-07 14:44:43,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027954843] [2019-12-07 14:44:43,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 14:44:43,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:44:43,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 14:44:43,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2019-12-07 14:44:43,554 INFO L87 Difference]: Start difference. First operand 2048 states and 5626 transitions. Second operand 19 states. [2019-12-07 14:44:45,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:45,568 INFO L93 Difference]: Finished difference Result 4390 states and 12239 transitions. [2019-12-07 14:44:45,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 14:44:45,568 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 85 [2019-12-07 14:44:45,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:45,574 INFO L225 Difference]: With dead ends: 4390 [2019-12-07 14:44:45,575 INFO L226 Difference]: Without dead ends: 4361 [2019-12-07 14:44:45,575 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=825, Unknown=0, NotChecked=0, Total=930 [2019-12-07 14:44:45,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4361 states. [2019-12-07 14:44:45,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4361 to 3268. [2019-12-07 14:44:45,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3268 states. [2019-12-07 14:44:45,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3268 states to 3268 states and 8942 transitions. [2019-12-07 14:44:45,625 INFO L78 Accepts]: Start accepts. Automaton has 3268 states and 8942 transitions. Word has length 85 [2019-12-07 14:44:45,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:45,625 INFO L462 AbstractCegarLoop]: Abstraction has 3268 states and 8942 transitions. [2019-12-07 14:44:45,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 14:44:45,625 INFO L276 IsEmpty]: Start isEmpty. Operand 3268 states and 8942 transitions. [2019-12-07 14:44:45,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 14:44:45,627 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:45,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:44:45,627 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:45,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:45,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1618361698, now seen corresponding path program 2 times [2019-12-07 14:44:45,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:44:45,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617127379] [2019-12-07 14:44:45,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:45,906 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 14:44:45,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617127379] [2019-12-07 14:44:45,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:45,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 14:44:45,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50021923] [2019-12-07 14:44:45,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 14:44:45,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:44:45,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 14:44:45,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:44:45,907 INFO L87 Difference]: Start difference. First operand 3268 states and 8942 transitions. Second operand 13 states. [2019-12-07 14:44:46,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:46,436 INFO L93 Difference]: Finished difference Result 5802 states and 16167 transitions. [2019-12-07 14:44:46,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 14:44:46,436 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 85 [2019-12-07 14:44:46,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:46,440 INFO L225 Difference]: With dead ends: 5802 [2019-12-07 14:44:46,440 INFO L226 Difference]: Without dead ends: 5773 [2019-12-07 14:44:46,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-07 14:44:46,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5773 states. [2019-12-07 14:44:46,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5773 to 3471. [2019-12-07 14:44:46,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3471 states. [2019-12-07 14:44:46,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3471 states to 3471 states and 9521 transitions. [2019-12-07 14:44:46,491 INFO L78 Accepts]: Start accepts. Automaton has 3471 states and 9521 transitions. Word has length 85 [2019-12-07 14:44:46,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:46,491 INFO L462 AbstractCegarLoop]: Abstraction has 3471 states and 9521 transitions. [2019-12-07 14:44:46,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 14:44:46,491 INFO L276 IsEmpty]: Start isEmpty. Operand 3471 states and 9521 transitions. [2019-12-07 14:44:46,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 14:44:46,493 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:46,493 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:44:46,494 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:46,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:46,494 INFO L82 PathProgramCache]: Analyzing trace with hash -338876956, now seen corresponding path program 3 times [2019-12-07 14:44:46,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:44:46,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996801498] [2019-12-07 14:44:46,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:46,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 14:44:46,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996801498] [2019-12-07 14:44:46,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:46,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 14:44:46,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086576689] [2019-12-07 14:44:46,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 14:44:46,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:44:46,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 14:44:46,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-07 14:44:46,675 INFO L87 Difference]: Start difference. First operand 3471 states and 9521 transitions. Second operand 15 states. [2019-12-07 14:44:47,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:47,481 INFO L93 Difference]: Finished difference Result 8384 states and 23080 transitions. [2019-12-07 14:44:47,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 14:44:47,481 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 85 [2019-12-07 14:44:47,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:47,488 INFO L225 Difference]: With dead ends: 8384 [2019-12-07 14:44:47,488 INFO L226 Difference]: Without dead ends: 8355 [2019-12-07 14:44:47,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2019-12-07 14:44:47,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8355 states. [2019-12-07 14:44:47,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8355 to 3562. [2019-12-07 14:44:47,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3562 states. [2019-12-07 14:44:47,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3562 states to 3562 states and 9770 transitions. [2019-12-07 14:44:47,550 INFO L78 Accepts]: Start accepts. Automaton has 3562 states and 9770 transitions. Word has length 85 [2019-12-07 14:44:47,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:47,551 INFO L462 AbstractCegarLoop]: Abstraction has 3562 states and 9770 transitions. [2019-12-07 14:44:47,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 14:44:47,551 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states and 9770 transitions. [2019-12-07 14:44:47,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 14:44:47,554 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:47,554 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:44:47,554 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:47,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:47,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1619362932, now seen corresponding path program 4 times [2019-12-07 14:44:47,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:44:47,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13957572] [2019-12-07 14:44:47,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:47,744 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 14:44:47,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13957572] [2019-12-07 14:44:47,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:47,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 14:44:47,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583797454] [2019-12-07 14:44:47,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 14:44:47,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:44:47,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 14:44:47,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-07 14:44:47,745 INFO L87 Difference]: Start difference. First operand 3562 states and 9770 transitions. Second operand 15 states. [2019-12-07 14:44:48,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:48,264 INFO L93 Difference]: Finished difference Result 6597 states and 18253 transitions. [2019-12-07 14:44:48,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 14:44:48,265 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 85 [2019-12-07 14:44:48,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:48,274 INFO L225 Difference]: With dead ends: 6597 [2019-12-07 14:44:48,274 INFO L226 Difference]: Without dead ends: 6568 [2019-12-07 14:44:48,275 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2019-12-07 14:44:48,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6568 states. [2019-12-07 14:44:48,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6568 to 3671. [2019-12-07 14:44:48,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3671 states. [2019-12-07 14:44:48,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 3671 states and 10091 transitions. [2019-12-07 14:44:48,336 INFO L78 Accepts]: Start accepts. Automaton has 3671 states and 10091 transitions. Word has length 85 [2019-12-07 14:44:48,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:48,337 INFO L462 AbstractCegarLoop]: Abstraction has 3671 states and 10091 transitions. [2019-12-07 14:44:48,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 14:44:48,337 INFO L276 IsEmpty]: Start isEmpty. Operand 3671 states and 10091 transitions. [2019-12-07 14:44:48,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 14:44:48,339 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:48,339 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:44:48,339 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:48,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:48,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1687390482, now seen corresponding path program 5 times [2019-12-07 14:44:48,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:44:48,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346205570] [2019-12-07 14:44:48,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:48,721 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 14:44:48,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346205570] [2019-12-07 14:44:48,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:48,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-07 14:44:48,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853708068] [2019-12-07 14:44:48,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 14:44:48,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:44:48,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 14:44:48,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2019-12-07 14:44:48,722 INFO L87 Difference]: Start difference. First operand 3671 states and 10091 transitions. Second operand 19 states. [2019-12-07 14:44:50,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:50,333 INFO L93 Difference]: Finished difference Result 6589 states and 18230 transitions. [2019-12-07 14:44:50,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 14:44:50,334 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 85 [2019-12-07 14:44:50,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:50,341 INFO L225 Difference]: With dead ends: 6589 [2019-12-07 14:44:50,341 INFO L226 Difference]: Without dead ends: 6560 [2019-12-07 14:44:50,342 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=992, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 14:44:50,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6560 states. [2019-12-07 14:44:50,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6560 to 3859. [2019-12-07 14:44:50,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3859 states. [2019-12-07 14:44:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3859 states to 3859 states and 10679 transitions. [2019-12-07 14:44:50,399 INFO L78 Accepts]: Start accepts. Automaton has 3859 states and 10679 transitions. Word has length 85 [2019-12-07 14:44:50,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:50,399 INFO L462 AbstractCegarLoop]: Abstraction has 3859 states and 10679 transitions. [2019-12-07 14:44:50,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 14:44:50,399 INFO L276 IsEmpty]: Start isEmpty. Operand 3859 states and 10679 transitions. [2019-12-07 14:44:50,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 14:44:50,402 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:50,402 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:44:50,402 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:50,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:50,402 INFO L82 PathProgramCache]: Analyzing trace with hash 650338160, now seen corresponding path program 6 times [2019-12-07 14:44:50,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:44:50,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828922807] [2019-12-07 14:44:50,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:50,705 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 14:44:50,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828922807] [2019-12-07 14:44:50,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:50,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 14:44:50,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609290360] [2019-12-07 14:44:50,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 14:44:50,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:44:50,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 14:44:50,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-12-07 14:44:50,706 INFO L87 Difference]: Start difference. First operand 3859 states and 10679 transitions. Second operand 16 states. [2019-12-07 14:44:51,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:51,528 INFO L93 Difference]: Finished difference Result 7395 states and 20606 transitions. [2019-12-07 14:44:51,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 14:44:51,529 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 85 [2019-12-07 14:44:51,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:51,535 INFO L225 Difference]: With dead ends: 7395 [2019-12-07 14:44:51,536 INFO L226 Difference]: Without dead ends: 7366 [2019-12-07 14:44:51,536 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=764, Unknown=0, NotChecked=0, Total=930 [2019-12-07 14:44:51,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7366 states. [2019-12-07 14:44:51,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7366 to 3815. [2019-12-07 14:44:51,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3815 states. [2019-12-07 14:44:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3815 states to 3815 states and 10559 transitions. [2019-12-07 14:44:51,597 INFO L78 Accepts]: Start accepts. Automaton has 3815 states and 10559 transitions. Word has length 85 [2019-12-07 14:44:51,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:51,597 INFO L462 AbstractCegarLoop]: Abstraction has 3815 states and 10559 transitions. [2019-12-07 14:44:51,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 14:44:51,597 INFO L276 IsEmpty]: Start isEmpty. Operand 3815 states and 10559 transitions. [2019-12-07 14:44:51,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 14:44:51,599 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:51,599 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:44:51,599 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:51,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:51,600 INFO L82 PathProgramCache]: Analyzing trace with hash 2132843120, now seen corresponding path program 7 times [2019-12-07 14:44:51,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:44:51,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357351394] [2019-12-07 14:44:51,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:44:51,982 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 14:44:51,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357351394] [2019-12-07 14:44:51,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:44:51,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-07 14:44:51,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308499009] [2019-12-07 14:44:51,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 14:44:51,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:44:51,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 14:44:51,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-12-07 14:44:51,984 INFO L87 Difference]: Start difference. First operand 3815 states and 10559 transitions. Second operand 19 states. [2019-12-07 14:44:52,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:44:52,755 INFO L93 Difference]: Finished difference Result 9551 states and 26594 transitions. [2019-12-07 14:44:52,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 14:44:52,755 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 85 [2019-12-07 14:44:52,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:44:52,762 INFO L225 Difference]: With dead ends: 9551 [2019-12-07 14:44:52,762 INFO L226 Difference]: Without dead ends: 9522 [2019-12-07 14:44:52,763 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=924, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 14:44:52,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9522 states. [2019-12-07 14:44:52,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9522 to 4158. [2019-12-07 14:44:52,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4158 states. [2019-12-07 14:44:52,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4158 states to 4158 states and 11522 transitions. [2019-12-07 14:44:52,833 INFO L78 Accepts]: Start accepts. Automaton has 4158 states and 11522 transitions. Word has length 85 [2019-12-07 14:44:52,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:44:52,833 INFO L462 AbstractCegarLoop]: Abstraction has 4158 states and 11522 transitions. [2019-12-07 14:44:52,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 14:44:52,833 INFO L276 IsEmpty]: Start isEmpty. Operand 4158 states and 11522 transitions. [2019-12-07 14:44:52,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 14:44:52,836 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:44:52,836 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:44:52,836 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:44:52,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:44:52,836 INFO L82 PathProgramCache]: Analyzing trace with hash -342909322, now seen corresponding path program 8 times [2019-12-07 14:44:52,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:44:52,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887216281] [2019-12-07 14:44:52,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:44:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:44:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:44:52,959 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 14:44:52,959 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:44:52,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1127] [1127] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= |v_ULTIMATE.start_main_~#t1699~0.offset_23| 0) (= v_~main$tmp_guard1~0_33 0) (= v_~y$r_buff1_thd0~0_369 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_p1_EAX~0_33) (= |v_#NULL.offset_6| 0) (= v_~y$w_buff1_used~0_637 0) (= 0 v_~y$r_buff1_thd3~0_142) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1699~0.base_31| 1)) (= 0 v_~y$w_buff0~0_254) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$w_buff1~0_230 0) (= 0 v_~y$r_buff0_thd2~0_463) (= v_~__unbuffered_p1_EBX~0_23 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1699~0.base_31|)) (= v_~__unbuffered_cnt~0_103 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_127) (= v_~y$read_delayed~0_5 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$w_buff0_used~0_1068 0) (= v_~y$flush_delayed~0_165 0) (= 0 v_~y$r_buff1_thd2~0_262) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1699~0.base_31| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1699~0.base_31|) |v_ULTIMATE.start_main_~#t1699~0.offset_23| 0)) |v_#memory_int_21|) (= v_~y$r_buff0_thd1~0_167 0) (= v_~y$r_buff1_thd1~0_152 0) (= v_~y$r_buff0_thd0~0_459 0) (= 0 v_~y$r_buff0_thd3~0_161) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1699~0.base_31| 4)) (= v_~main$tmp_guard0~0_32 0) (= v_~x~0_32 0) (= v_~y$mem_tmp~0_135 0) (= 0 v_~__unbuffered_p0_EAX~0_35) (= v_~y~0_339 0) (= v_~weak$$choice2~0_196 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1699~0.base_31|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet53=|v_ULTIMATE.start_main_#t~nondet53_89|, ULTIMATE.start_main_~#t1700~0.base=|v_ULTIMATE.start_main_~#t1700~0.base_29|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_39|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_173|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_236|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_143|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_110|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_35|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_48|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_103|, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_66|, ~y$mem_tmp~0=v_~y$mem_tmp~0_135, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_142, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_167, ~y$flush_delayed~0=v_~y$flush_delayed~0_165, #length=|v_#length_23|, ULTIMATE.start_main_~#t1701~0.offset=|v_ULTIMATE.start_main_~#t1701~0.offset_15|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_53|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_79|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_55|, ULTIMATE.start_main_~#t1700~0.offset=|v_ULTIMATE.start_main_~#t1700~0.offset_22|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_109|, ~weak$$choice0~0=v_~weak$$choice0~0_127, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_49|, ~y$w_buff1~0=v_~y$w_buff1~0_230, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_463, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_369, ~x~0=v_~x~0_32, ULTIMATE.start_main_#t~nondet54=|v_ULTIMATE.start_main_#t~nondet54_89|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_1068, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_33, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_42|, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_32|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_149|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_192|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_33|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_152, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_35|, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_51|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_70|, ~y$w_buff0~0=v_~y$w_buff0~0_254, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_161, ~y~0=v_~y~0_339, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_22|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_44|, ULTIMATE.start_main_~#t1699~0.offset=|v_ULTIMATE.start_main_~#t1699~0.offset_23|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_65|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_49|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_39|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_262, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_46|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_459, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t1699~0.base=|v_ULTIMATE.start_main_~#t1699~0.base_31|, ~weak$$choice2~0=v_~weak$$choice2~0_196, ULTIMATE.start_main_~#t1701~0.base=|v_ULTIMATE.start_main_~#t1701~0.base_23|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_637} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet53, ULTIMATE.start_main_~#t1700~0.base, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite73, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_#t~ite71, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1701~0.offset, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_~#t1700~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~nondet54, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite69, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite74, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite70, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_~#t1699~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite55, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t1699~0.base, ~weak$$choice2~0, ULTIMATE.start_main_~#t1701~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:44:52,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1094] [1094] L820-1-->L822: Formula: (and (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1700~0.base_10|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1700~0.base_10|) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1700~0.base_10| 1) |v_#valid_35|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1700~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1700~0.base_10|) |v_ULTIMATE.start_main_~#t1700~0.offset_10| 1)) |v_#memory_int_13|) (= |v_ULTIMATE.start_main_~#t1700~0.offset_10| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1700~0.base_10| 4) |v_#length_15|) (not (= 0 |v_ULTIMATE.start_main_~#t1700~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1700~0.offset=|v_ULTIMATE.start_main_~#t1700~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1700~0.base=|v_ULTIMATE.start_main_~#t1700~0.base_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1700~0.offset, ULTIMATE.start_main_~#t1700~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 14:44:52,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1106] [1106] L4-->L765: Formula: (and (= ~y$r_buff1_thd2~0_Out-179083736 ~y$r_buff0_thd2~0_In-179083736) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-179083736 0)) (= ~y$mem_tmp~0_Out-179083736 ~y~0_In-179083736) (= ~y$r_buff1_thd0~0_Out-179083736 ~y$r_buff0_thd0~0_In-179083736) (= |P1Thread1of1ForFork1_#t~nondet10_In-179083736| ~weak$$choice2~0_Out-179083736) (= ~y$r_buff0_thd1~0_In-179083736 ~y$r_buff1_thd1~0_Out-179083736) (= ~y$r_buff0_thd2~0_Out-179083736 1) (= ~weak$$choice2~0_Out-179083736 ~y$flush_delayed~0_Out-179083736) (= ~y$r_buff0_thd3~0_In-179083736 ~y$r_buff1_thd3~0_Out-179083736) (= ~weak$$choice0~0_Out-179083736 |P1Thread1of1ForFork1_#t~nondet9_In-179083736|)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-179083736, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-179083736, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-179083736, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-179083736, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-179083736, P1Thread1of1ForFork1_#t~nondet9=|P1Thread1of1ForFork1_#t~nondet9_In-179083736|, ~y~0=~y~0_In-179083736, P1Thread1of1ForFork1_#t~nondet10=|P1Thread1of1ForFork1_#t~nondet10_In-179083736|} OutVars{P1Thread1of1ForFork1_#t~nondet9=|P1Thread1of1ForFork1_#t~nondet9_Out-179083736|, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-179083736, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-179083736, ~weak$$choice0~0=~weak$$choice0~0_Out-179083736, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-179083736, ~y$mem_tmp~0=~y$mem_tmp~0_Out-179083736, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out-179083736, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-179083736, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-179083736, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-179083736, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-179083736, ~y$flush_delayed~0=~y$flush_delayed~0_Out-179083736, ~y~0=~y~0_In-179083736, ~weak$$choice2~0=~weak$$choice2~0_Out-179083736, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-179083736, P1Thread1of1ForFork1_#t~nondet10=|P1Thread1of1ForFork1_#t~nondet10_Out-179083736|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, P1Thread1of1ForFork1_#t~nondet9, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork1_#t~nondet10] because there is no mapped edge [2019-12-07 14:44:52,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1059] [1059] L765-2-->L765-4: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-882004342 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-882004342 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-882004342| ~y$w_buff1~0_In-882004342) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-882004342| ~y$w_buff0~0_In-882004342) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-882004342, ~y$w_buff1~0=~y$w_buff1~0_In-882004342, ~y$w_buff0~0=~y$w_buff0~0_In-882004342, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-882004342} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-882004342, ~y$w_buff1~0=~y$w_buff1~0_In-882004342, ~y$w_buff0~0=~y$w_buff0~0_In-882004342, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-882004342, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-882004342|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 14:44:52,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L765-4-->L766: Formula: (= v_~y~0_116 |v_P1Thread1of1ForFork1_#t~ite11_8|) InVars {P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_8|} OutVars{P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_7|, P1Thread1of1ForFork1_#t~ite12=|v_P1Thread1of1ForFork1_#t~ite12_11|, ~y~0=v_~y~0_116} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12, ~y~0] because there is no mapped edge [2019-12-07 14:44:52,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1086] [1086] L822-1-->L824: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1701~0.base_10| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1701~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1701~0.base_10|) |v_ULTIMATE.start_main_~#t1701~0.offset_9| 2)) |v_#memory_int_11|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1701~0.base_10| 1)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1701~0.base_10|)) (= |v_ULTIMATE.start_main_~#t1701~0.offset_9| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1701~0.base_10|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1701~0.base_10| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1701~0.base=|v_ULTIMATE.start_main_~#t1701~0.base_10|, ULTIMATE.start_main_~#t1701~0.offset=|v_ULTIMATE.start_main_~#t1701~0.offset_9|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1701~0.base, ULTIMATE.start_main_~#t1701~0.offset] because there is no mapped edge [2019-12-07 14:44:52,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] L770-->L771: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_75 256))) (= v_~y$r_buff0_thd2~0_137 v_~y$r_buff0_thd2~0_136)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_75} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_75, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_10|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 14:44:52,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-585236757 256)))) (or (and (not .cse0) (= ~y$mem_tmp~0_In-585236757 |P1Thread1of1ForFork1_#t~ite31_Out-585236757|)) (and (= ~y~0_In-585236757 |P1Thread1of1ForFork1_#t~ite31_Out-585236757|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-585236757, ~y$flush_delayed~0=~y$flush_delayed~0_In-585236757, ~y~0=~y~0_In-585236757} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-585236757, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-585236757|, ~y$flush_delayed~0=~y$flush_delayed~0_In-585236757, ~y~0=~y~0_In-585236757} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 14:44:52,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L797-2-->L797-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1867692654 256))) (.cse0 (= |P2Thread1of1ForFork2_#t~ite38_Out1867692654| |P2Thread1of1ForFork2_#t~ite39_Out1867692654|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1867692654 256)))) (or (and .cse0 (or .cse1 .cse2) (= |P2Thread1of1ForFork2_#t~ite38_Out1867692654| ~y~0_In1867692654)) (and (not .cse1) .cse0 (not .cse2) (= |P2Thread1of1ForFork2_#t~ite38_Out1867692654| ~y$w_buff1~0_In1867692654)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1867692654, ~y$w_buff1~0=~y$w_buff1~0_In1867692654, ~y~0=~y~0_In1867692654, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1867692654} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1867692654, ~y$w_buff1~0=~y$w_buff1~0_In1867692654, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out1867692654|, ~y~0=~y~0_In1867692654, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out1867692654|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1867692654} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 14:44:52,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1060] [1060] L735-2-->L735-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-640640514 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-640640514 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out-640640514| ~y~0_In-640640514) (or .cse0 .cse1)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite3_Out-640640514| ~y$w_buff1~0_In-640640514) (not .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-640640514, ~y$w_buff1~0=~y$w_buff1~0_In-640640514, ~y~0=~y~0_In-640640514, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-640640514} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-640640514, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-640640514|, ~y$w_buff1~0=~y$w_buff1~0_In-640640514, ~y~0=~y~0_In-640640514, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-640640514} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3] because there is no mapped edge [2019-12-07 14:44:52,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1065] [1065] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1774734398 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1774734398 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite40_Out-1774734398| ~y$w_buff0_used~0_In-1774734398)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite40_Out-1774734398| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1774734398, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1774734398} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1774734398, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1774734398, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-1774734398|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-07 14:44:52,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1042] [1042] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-2099376772 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-2099376772 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-2099376772 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-2099376772 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite41_Out-2099376772|)) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite41_Out-2099376772| ~y$w_buff1_used~0_In-2099376772) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2099376772, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2099376772, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2099376772, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2099376772} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2099376772, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2099376772, P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-2099376772|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2099376772, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2099376772} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-07 14:44:52,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1046] [1046] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-522113188 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-522113188 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-522113188 |P2Thread1of1ForFork2_#t~ite42_Out-522113188|)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out-522113188|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-522113188, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-522113188} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-522113188, P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-522113188|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-522113188} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-07 14:44:52,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1047] [1047] L801-->L801-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In1766413752 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1766413752 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1766413752 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1766413752 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite43_Out1766413752|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In1766413752 |P2Thread1of1ForFork2_#t~ite43_Out1766413752|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1766413752, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1766413752, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1766413752, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1766413752} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1766413752, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1766413752, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1766413752, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out1766413752|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1766413752} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-07 14:44:52,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1093] [1093] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite43_20| v_~y$r_buff1_thd3~0_69)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_69, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_19|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 14:44:52,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1069] [1069] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1383651367 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1383651367 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out1383651367| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1383651367| ~y$w_buff0_used~0_In1383651367)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1383651367, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1383651367} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1383651367, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1383651367, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1383651367|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 14:44:52,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1022] [1022] L735-4-->L736: Formula: (= v_~y~0_103 |v_P0Thread1of1ForFork0_#t~ite3_18|) InVars {P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_18|} OutVars{P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_17|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_15|, ~y~0=v_~y~0_103} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, ~y~0] because there is no mapped edge [2019-12-07 14:44:52,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1068] [1068] L736-->L736-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2072741703 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-2072741703 256) 0))) (or (and (= ~y$w_buff0_used~0_In-2072741703 |P0Thread1of1ForFork0_#t~ite5_Out-2072741703|) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-2072741703| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2072741703, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2072741703} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-2072741703|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2072741703, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2072741703} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 14:44:52,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1038] [1038] L782-->L782-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In126889705 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In126889705 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In126889705 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In126889705 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out126889705|)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out126889705| ~y$w_buff1_used~0_In126889705) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In126889705, ~y$w_buff0_used~0=~y$w_buff0_used~0_In126889705, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In126889705, ~y$w_buff1_used~0=~y$w_buff1_used~0_In126889705} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In126889705, ~y$w_buff0_used~0=~y$w_buff0_used~0_In126889705, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In126889705, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out126889705|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In126889705} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 14:44:52,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1054] [1054] L783-->L784: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1030756860 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1030756860 256) 0)) (.cse1 (= ~y$r_buff0_thd2~0_In1030756860 ~y$r_buff0_thd2~0_Out1030756860))) (or (and .cse0 .cse1) (and (not .cse2) (= ~y$r_buff0_thd2~0_Out1030756860 0) (not .cse0)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1030756860, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1030756860} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1030756860, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1030756860, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1030756860|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 14:44:52,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1048] [1048] L784-->L784-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In679178646 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In679178646 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In679178646 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In679178646 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out679178646|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In679178646 |P1Thread1of1ForFork1_#t~ite37_Out679178646|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In679178646, ~y$w_buff0_used~0=~y$w_buff0_used~0_In679178646, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In679178646, ~y$w_buff1_used~0=~y$w_buff1_used~0_In679178646} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In679178646, ~y$w_buff0_used~0=~y$w_buff0_used~0_In679178646, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In679178646, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out679178646|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In679178646} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 14:44:52,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1081] [1081] L784-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_130 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_130, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 14:44:52,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1066] [1066] L737-->L737-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-823068591 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-823068591 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-823068591 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-823068591 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-823068591| 0)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-823068591| ~y$w_buff1_used~0_In-823068591) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-823068591, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-823068591, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-823068591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-823068591} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-823068591|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-823068591, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-823068591, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-823068591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-823068591} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 14:44:52,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1039] [1039] L738-->L738-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In1899613903 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1899613903 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In1899613903 |P0Thread1of1ForFork0_#t~ite7_Out1899613903|)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out1899613903| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1899613903, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1899613903} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1899613903, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1899613903|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1899613903} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 14:44:52,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1051] [1051] L739-->L739-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In940986538 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In940986538 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In940986538 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In940986538 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out940986538| ~y$r_buff1_thd1~0_In940986538)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out940986538| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In940986538, ~y$w_buff0_used~0=~y$w_buff0_used~0_In940986538, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In940986538, ~y$w_buff1_used~0=~y$w_buff1_used~0_In940986538} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In940986538, ~y$w_buff0_used~0=~y$w_buff0_used~0_In940986538, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out940986538|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In940986538, ~y$w_buff1_used~0=~y$w_buff1_used~0_In940986538} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 14:44:52,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1091] [1091] L739-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y$r_buff1_thd1~0_81 |v_P0Thread1of1ForFork0_#t~ite8_28|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_81, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 14:44:52,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L828-->L830-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~y$w_buff0_used~0_173 256)) (= 0 (mod v_~y$r_buff0_thd0~0_73 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_173, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_73, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_173, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_73, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 14:44:52,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] L830-2-->L830-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1407505665 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1407505665 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite47_Out1407505665| |ULTIMATE.start_main_#t~ite48_Out1407505665|))) (or (and .cse0 (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out1407505665| ~y$w_buff1~0_In1407505665) (not .cse2)) (and (or .cse1 .cse2) .cse0 (= ~y~0_In1407505665 |ULTIMATE.start_main_#t~ite47_Out1407505665|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1407505665, ~y~0=~y~0_In1407505665, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1407505665, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1407505665} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1407505665, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1407505665|, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1407505665|, ~y~0=~y~0_In1407505665, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1407505665, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1407505665} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 14:44:52,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1040] [1040] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-400510908 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-400510908 256)))) (or (and (= ~y$w_buff0_used~0_In-400510908 |ULTIMATE.start_main_#t~ite49_Out-400510908|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out-400510908|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-400510908, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-400510908} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-400510908, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-400510908, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-400510908|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 14:44:52,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] L832-->L832-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-2143135022 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-2143135022 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-2143135022 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-2143135022 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-2143135022| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-2143135022 |ULTIMATE.start_main_#t~ite50_Out-2143135022|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2143135022, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2143135022, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2143135022, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2143135022} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-2143135022|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2143135022, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2143135022, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2143135022, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2143135022} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 14:44:52,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1058] [1058] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1304946117 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1304946117 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In1304946117 |ULTIMATE.start_main_#t~ite51_Out1304946117|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out1304946117|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1304946117, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1304946117} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1304946117|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1304946117, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1304946117} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 14:44:52,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1070] [1070] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1912899118 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1912899118 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1912899118 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1912899118 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out1912899118|)) (and (= ~y$r_buff1_thd0~0_In1912899118 |ULTIMATE.start_main_#t~ite52_Out1912899118|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1912899118, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1912899118, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1912899118, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1912899118} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1912899118|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1912899118, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1912899118, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1912899118, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1912899118} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 14:44:52,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1050] [1050] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1620953697 256) 0))) (or (and (= ~y$mem_tmp~0_In1620953697 |ULTIMATE.start_main_#t~ite75_Out1620953697|) (not .cse0)) (and .cse0 (= ~y~0_In1620953697 |ULTIMATE.start_main_#t~ite75_Out1620953697|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1620953697, ~y$flush_delayed~0=~y$flush_delayed~0_In1620953697, ~y~0=~y~0_In1620953697} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1620953697, ~y$flush_delayed~0=~y$flush_delayed~0_In1620953697, ~y~0=~y~0_In1620953697, ULTIMATE.start_main_#t~ite75=|ULTIMATE.start_main_#t~ite75_Out1620953697|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite75] because there is no mapped edge [2019-12-07 14:44:52,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1110] [1110] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_21 256)) (= v_~y~0_280 |v_ULTIMATE.start_main_#t~ite75_33|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$flush_delayed~0_111 0)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_33|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~y$flush_delayed~0=v_~y$flush_delayed~0_111, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~y~0=v_~y~0_280, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_32|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite75, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:44:53,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:44:53 BasicIcfg [2019-12-07 14:44:53,066 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:44:53,067 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:44:53,067 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:44:53,067 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:44:53,067 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:38:25" (3/4) ... [2019-12-07 14:44:53,069 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:44:53,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1127] [1127] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= |v_ULTIMATE.start_main_~#t1699~0.offset_23| 0) (= v_~main$tmp_guard1~0_33 0) (= v_~y$r_buff1_thd0~0_369 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_p1_EAX~0_33) (= |v_#NULL.offset_6| 0) (= v_~y$w_buff1_used~0_637 0) (= 0 v_~y$r_buff1_thd3~0_142) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1699~0.base_31| 1)) (= 0 v_~y$w_buff0~0_254) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$w_buff1~0_230 0) (= 0 v_~y$r_buff0_thd2~0_463) (= v_~__unbuffered_p1_EBX~0_23 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1699~0.base_31|)) (= v_~__unbuffered_cnt~0_103 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_127) (= v_~y$read_delayed~0_5 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$w_buff0_used~0_1068 0) (= v_~y$flush_delayed~0_165 0) (= 0 v_~y$r_buff1_thd2~0_262) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1699~0.base_31| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1699~0.base_31|) |v_ULTIMATE.start_main_~#t1699~0.offset_23| 0)) |v_#memory_int_21|) (= v_~y$r_buff0_thd1~0_167 0) (= v_~y$r_buff1_thd1~0_152 0) (= v_~y$r_buff0_thd0~0_459 0) (= 0 v_~y$r_buff0_thd3~0_161) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1699~0.base_31| 4)) (= v_~main$tmp_guard0~0_32 0) (= v_~x~0_32 0) (= v_~y$mem_tmp~0_135 0) (= 0 v_~__unbuffered_p0_EAX~0_35) (= v_~y~0_339 0) (= v_~weak$$choice2~0_196 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1699~0.base_31|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet53=|v_ULTIMATE.start_main_#t~nondet53_89|, ULTIMATE.start_main_~#t1700~0.base=|v_ULTIMATE.start_main_~#t1700~0.base_29|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_39|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_173|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_236|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_143|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_110|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_35|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_48|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_103|, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_66|, ~y$mem_tmp~0=v_~y$mem_tmp~0_135, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_142, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_167, ~y$flush_delayed~0=v_~y$flush_delayed~0_165, #length=|v_#length_23|, ULTIMATE.start_main_~#t1701~0.offset=|v_ULTIMATE.start_main_~#t1701~0.offset_15|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_53|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_79|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_55|, ULTIMATE.start_main_~#t1700~0.offset=|v_ULTIMATE.start_main_~#t1700~0.offset_22|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_109|, ~weak$$choice0~0=v_~weak$$choice0~0_127, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_49|, ~y$w_buff1~0=v_~y$w_buff1~0_230, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_463, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_369, ~x~0=v_~x~0_32, ULTIMATE.start_main_#t~nondet54=|v_ULTIMATE.start_main_#t~nondet54_89|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_1068, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_33, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_42|, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_32|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_149|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_192|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_33|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_152, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_35|, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_51|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_70|, ~y$w_buff0~0=v_~y$w_buff0~0_254, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_161, ~y~0=v_~y~0_339, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_22|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_44|, ULTIMATE.start_main_~#t1699~0.offset=|v_ULTIMATE.start_main_~#t1699~0.offset_23|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_65|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_49|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_39|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_262, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_46|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_459, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t1699~0.base=|v_ULTIMATE.start_main_~#t1699~0.base_31|, ~weak$$choice2~0=v_~weak$$choice2~0_196, ULTIMATE.start_main_~#t1701~0.base=|v_ULTIMATE.start_main_~#t1701~0.base_23|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_637} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet53, ULTIMATE.start_main_~#t1700~0.base, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite73, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_#t~ite71, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1701~0.offset, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_~#t1700~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~nondet54, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite69, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite74, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite70, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_~#t1699~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite55, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t1699~0.base, ~weak$$choice2~0, ULTIMATE.start_main_~#t1701~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:44:53,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1094] [1094] L820-1-->L822: Formula: (and (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1700~0.base_10|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1700~0.base_10|) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1700~0.base_10| 1) |v_#valid_35|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1700~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1700~0.base_10|) |v_ULTIMATE.start_main_~#t1700~0.offset_10| 1)) |v_#memory_int_13|) (= |v_ULTIMATE.start_main_~#t1700~0.offset_10| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1700~0.base_10| 4) |v_#length_15|) (not (= 0 |v_ULTIMATE.start_main_~#t1700~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1700~0.offset=|v_ULTIMATE.start_main_~#t1700~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1700~0.base=|v_ULTIMATE.start_main_~#t1700~0.base_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1700~0.offset, ULTIMATE.start_main_~#t1700~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 14:44:53,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1106] [1106] L4-->L765: Formula: (and (= ~y$r_buff1_thd2~0_Out-179083736 ~y$r_buff0_thd2~0_In-179083736) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-179083736 0)) (= ~y$mem_tmp~0_Out-179083736 ~y~0_In-179083736) (= ~y$r_buff1_thd0~0_Out-179083736 ~y$r_buff0_thd0~0_In-179083736) (= |P1Thread1of1ForFork1_#t~nondet10_In-179083736| ~weak$$choice2~0_Out-179083736) (= ~y$r_buff0_thd1~0_In-179083736 ~y$r_buff1_thd1~0_Out-179083736) (= ~y$r_buff0_thd2~0_Out-179083736 1) (= ~weak$$choice2~0_Out-179083736 ~y$flush_delayed~0_Out-179083736) (= ~y$r_buff0_thd3~0_In-179083736 ~y$r_buff1_thd3~0_Out-179083736) (= ~weak$$choice0~0_Out-179083736 |P1Thread1of1ForFork1_#t~nondet9_In-179083736|)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-179083736, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-179083736, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-179083736, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-179083736, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-179083736, P1Thread1of1ForFork1_#t~nondet9=|P1Thread1of1ForFork1_#t~nondet9_In-179083736|, ~y~0=~y~0_In-179083736, P1Thread1of1ForFork1_#t~nondet10=|P1Thread1of1ForFork1_#t~nondet10_In-179083736|} OutVars{P1Thread1of1ForFork1_#t~nondet9=|P1Thread1of1ForFork1_#t~nondet9_Out-179083736|, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-179083736, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-179083736, ~weak$$choice0~0=~weak$$choice0~0_Out-179083736, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-179083736, ~y$mem_tmp~0=~y$mem_tmp~0_Out-179083736, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out-179083736, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-179083736, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-179083736, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-179083736, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-179083736, ~y$flush_delayed~0=~y$flush_delayed~0_Out-179083736, ~y~0=~y~0_In-179083736, ~weak$$choice2~0=~weak$$choice2~0_Out-179083736, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-179083736, P1Thread1of1ForFork1_#t~nondet10=|P1Thread1of1ForFork1_#t~nondet10_Out-179083736|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, P1Thread1of1ForFork1_#t~nondet9, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork1_#t~nondet10] because there is no mapped edge [2019-12-07 14:44:53,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1059] [1059] L765-2-->L765-4: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-882004342 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-882004342 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-882004342| ~y$w_buff1~0_In-882004342) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-882004342| ~y$w_buff0~0_In-882004342) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-882004342, ~y$w_buff1~0=~y$w_buff1~0_In-882004342, ~y$w_buff0~0=~y$w_buff0~0_In-882004342, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-882004342} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-882004342, ~y$w_buff1~0=~y$w_buff1~0_In-882004342, ~y$w_buff0~0=~y$w_buff0~0_In-882004342, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-882004342, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-882004342|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 14:44:53,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L765-4-->L766: Formula: (= v_~y~0_116 |v_P1Thread1of1ForFork1_#t~ite11_8|) InVars {P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_8|} OutVars{P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_7|, P1Thread1of1ForFork1_#t~ite12=|v_P1Thread1of1ForFork1_#t~ite12_11|, ~y~0=v_~y~0_116} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12, ~y~0] because there is no mapped edge [2019-12-07 14:44:53,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1086] [1086] L822-1-->L824: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1701~0.base_10| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1701~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1701~0.base_10|) |v_ULTIMATE.start_main_~#t1701~0.offset_9| 2)) |v_#memory_int_11|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1701~0.base_10| 1)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1701~0.base_10|)) (= |v_ULTIMATE.start_main_~#t1701~0.offset_9| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1701~0.base_10|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1701~0.base_10| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1701~0.base=|v_ULTIMATE.start_main_~#t1701~0.base_10|, ULTIMATE.start_main_~#t1701~0.offset=|v_ULTIMATE.start_main_~#t1701~0.offset_9|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1701~0.base, ULTIMATE.start_main_~#t1701~0.offset] because there is no mapped edge [2019-12-07 14:44:53,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] L770-->L771: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_75 256))) (= v_~y$r_buff0_thd2~0_137 v_~y$r_buff0_thd2~0_136)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_75} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_75, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_10|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 14:44:53,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-585236757 256)))) (or (and (not .cse0) (= ~y$mem_tmp~0_In-585236757 |P1Thread1of1ForFork1_#t~ite31_Out-585236757|)) (and (= ~y~0_In-585236757 |P1Thread1of1ForFork1_#t~ite31_Out-585236757|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-585236757, ~y$flush_delayed~0=~y$flush_delayed~0_In-585236757, ~y~0=~y~0_In-585236757} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-585236757, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-585236757|, ~y$flush_delayed~0=~y$flush_delayed~0_In-585236757, ~y~0=~y~0_In-585236757} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 14:44:53,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L797-2-->L797-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1867692654 256))) (.cse0 (= |P2Thread1of1ForFork2_#t~ite38_Out1867692654| |P2Thread1of1ForFork2_#t~ite39_Out1867692654|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1867692654 256)))) (or (and .cse0 (or .cse1 .cse2) (= |P2Thread1of1ForFork2_#t~ite38_Out1867692654| ~y~0_In1867692654)) (and (not .cse1) .cse0 (not .cse2) (= |P2Thread1of1ForFork2_#t~ite38_Out1867692654| ~y$w_buff1~0_In1867692654)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1867692654, ~y$w_buff1~0=~y$w_buff1~0_In1867692654, ~y~0=~y~0_In1867692654, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1867692654} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1867692654, ~y$w_buff1~0=~y$w_buff1~0_In1867692654, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out1867692654|, ~y~0=~y~0_In1867692654, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out1867692654|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1867692654} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 14:44:53,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1060] [1060] L735-2-->L735-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-640640514 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-640640514 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out-640640514| ~y~0_In-640640514) (or .cse0 .cse1)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite3_Out-640640514| ~y$w_buff1~0_In-640640514) (not .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-640640514, ~y$w_buff1~0=~y$w_buff1~0_In-640640514, ~y~0=~y~0_In-640640514, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-640640514} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-640640514, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-640640514|, ~y$w_buff1~0=~y$w_buff1~0_In-640640514, ~y~0=~y~0_In-640640514, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-640640514} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3] because there is no mapped edge [2019-12-07 14:44:53,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1065] [1065] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1774734398 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1774734398 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite40_Out-1774734398| ~y$w_buff0_used~0_In-1774734398)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite40_Out-1774734398| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1774734398, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1774734398} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1774734398, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1774734398, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-1774734398|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-07 14:44:53,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1042] [1042] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-2099376772 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-2099376772 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-2099376772 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-2099376772 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite41_Out-2099376772|)) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite41_Out-2099376772| ~y$w_buff1_used~0_In-2099376772) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2099376772, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2099376772, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2099376772, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2099376772} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2099376772, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2099376772, P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-2099376772|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2099376772, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2099376772} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-07 14:44:53,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1046] [1046] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-522113188 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-522113188 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-522113188 |P2Thread1of1ForFork2_#t~ite42_Out-522113188|)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out-522113188|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-522113188, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-522113188} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-522113188, P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-522113188|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-522113188} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-07 14:44:53,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1047] [1047] L801-->L801-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In1766413752 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1766413752 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1766413752 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1766413752 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite43_Out1766413752|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In1766413752 |P2Thread1of1ForFork2_#t~ite43_Out1766413752|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1766413752, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1766413752, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1766413752, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1766413752} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1766413752, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1766413752, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1766413752, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out1766413752|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1766413752} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-07 14:44:53,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1093] [1093] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite43_20| v_~y$r_buff1_thd3~0_69)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_69, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_19|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 14:44:53,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1069] [1069] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1383651367 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1383651367 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out1383651367| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1383651367| ~y$w_buff0_used~0_In1383651367)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1383651367, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1383651367} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1383651367, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1383651367, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1383651367|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 14:44:53,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1022] [1022] L735-4-->L736: Formula: (= v_~y~0_103 |v_P0Thread1of1ForFork0_#t~ite3_18|) InVars {P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_18|} OutVars{P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_17|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_15|, ~y~0=v_~y~0_103} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, ~y~0] because there is no mapped edge [2019-12-07 14:44:53,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1068] [1068] L736-->L736-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2072741703 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-2072741703 256) 0))) (or (and (= ~y$w_buff0_used~0_In-2072741703 |P0Thread1of1ForFork0_#t~ite5_Out-2072741703|) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-2072741703| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2072741703, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2072741703} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-2072741703|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2072741703, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2072741703} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 14:44:53,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1038] [1038] L782-->L782-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In126889705 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In126889705 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In126889705 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In126889705 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out126889705|)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out126889705| ~y$w_buff1_used~0_In126889705) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In126889705, ~y$w_buff0_used~0=~y$w_buff0_used~0_In126889705, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In126889705, ~y$w_buff1_used~0=~y$w_buff1_used~0_In126889705} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In126889705, ~y$w_buff0_used~0=~y$w_buff0_used~0_In126889705, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In126889705, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out126889705|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In126889705} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 14:44:53,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1054] [1054] L783-->L784: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1030756860 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1030756860 256) 0)) (.cse1 (= ~y$r_buff0_thd2~0_In1030756860 ~y$r_buff0_thd2~0_Out1030756860))) (or (and .cse0 .cse1) (and (not .cse2) (= ~y$r_buff0_thd2~0_Out1030756860 0) (not .cse0)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1030756860, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1030756860} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1030756860, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1030756860, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1030756860|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 14:44:53,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1048] [1048] L784-->L784-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In679178646 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In679178646 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In679178646 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In679178646 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out679178646|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In679178646 |P1Thread1of1ForFork1_#t~ite37_Out679178646|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In679178646, ~y$w_buff0_used~0=~y$w_buff0_used~0_In679178646, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In679178646, ~y$w_buff1_used~0=~y$w_buff1_used~0_In679178646} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In679178646, ~y$w_buff0_used~0=~y$w_buff0_used~0_In679178646, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In679178646, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out679178646|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In679178646} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 14:44:53,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1081] [1081] L784-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_130 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_130, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 14:44:53,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1066] [1066] L737-->L737-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-823068591 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-823068591 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-823068591 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-823068591 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-823068591| 0)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-823068591| ~y$w_buff1_used~0_In-823068591) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-823068591, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-823068591, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-823068591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-823068591} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-823068591|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-823068591, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-823068591, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-823068591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-823068591} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 14:44:53,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1039] [1039] L738-->L738-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In1899613903 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1899613903 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In1899613903 |P0Thread1of1ForFork0_#t~ite7_Out1899613903|)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out1899613903| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1899613903, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1899613903} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1899613903, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1899613903|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1899613903} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 14:44:53,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1051] [1051] L739-->L739-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In940986538 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In940986538 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In940986538 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In940986538 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out940986538| ~y$r_buff1_thd1~0_In940986538)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out940986538| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In940986538, ~y$w_buff0_used~0=~y$w_buff0_used~0_In940986538, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In940986538, ~y$w_buff1_used~0=~y$w_buff1_used~0_In940986538} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In940986538, ~y$w_buff0_used~0=~y$w_buff0_used~0_In940986538, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out940986538|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In940986538, ~y$w_buff1_used~0=~y$w_buff1_used~0_In940986538} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 14:44:53,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1091] [1091] L739-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y$r_buff1_thd1~0_81 |v_P0Thread1of1ForFork0_#t~ite8_28|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_81, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 14:44:53,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L828-->L830-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~y$w_buff0_used~0_173 256)) (= 0 (mod v_~y$r_buff0_thd0~0_73 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_173, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_73, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_173, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_73, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 14:44:53,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] L830-2-->L830-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1407505665 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1407505665 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite47_Out1407505665| |ULTIMATE.start_main_#t~ite48_Out1407505665|))) (or (and .cse0 (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out1407505665| ~y$w_buff1~0_In1407505665) (not .cse2)) (and (or .cse1 .cse2) .cse0 (= ~y~0_In1407505665 |ULTIMATE.start_main_#t~ite47_Out1407505665|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1407505665, ~y~0=~y~0_In1407505665, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1407505665, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1407505665} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1407505665, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1407505665|, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1407505665|, ~y~0=~y~0_In1407505665, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1407505665, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1407505665} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 14:44:53,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1040] [1040] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-400510908 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-400510908 256)))) (or (and (= ~y$w_buff0_used~0_In-400510908 |ULTIMATE.start_main_#t~ite49_Out-400510908|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out-400510908|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-400510908, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-400510908} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-400510908, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-400510908, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-400510908|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 14:44:53,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] L832-->L832-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-2143135022 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-2143135022 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-2143135022 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-2143135022 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-2143135022| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-2143135022 |ULTIMATE.start_main_#t~ite50_Out-2143135022|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2143135022, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2143135022, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2143135022, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2143135022} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-2143135022|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2143135022, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2143135022, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2143135022, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2143135022} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 14:44:53,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1058] [1058] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1304946117 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1304946117 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In1304946117 |ULTIMATE.start_main_#t~ite51_Out1304946117|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out1304946117|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1304946117, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1304946117} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1304946117|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1304946117, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1304946117} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 14:44:53,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1070] [1070] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1912899118 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1912899118 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1912899118 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1912899118 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out1912899118|)) (and (= ~y$r_buff1_thd0~0_In1912899118 |ULTIMATE.start_main_#t~ite52_Out1912899118|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1912899118, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1912899118, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1912899118, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1912899118} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1912899118|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1912899118, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1912899118, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1912899118, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1912899118} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 14:44:53,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1050] [1050] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1620953697 256) 0))) (or (and (= ~y$mem_tmp~0_In1620953697 |ULTIMATE.start_main_#t~ite75_Out1620953697|) (not .cse0)) (and .cse0 (= ~y~0_In1620953697 |ULTIMATE.start_main_#t~ite75_Out1620953697|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1620953697, ~y$flush_delayed~0=~y$flush_delayed~0_In1620953697, ~y~0=~y~0_In1620953697} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1620953697, ~y$flush_delayed~0=~y$flush_delayed~0_In1620953697, ~y~0=~y~0_In1620953697, ULTIMATE.start_main_#t~ite75=|ULTIMATE.start_main_#t~ite75_Out1620953697|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite75] because there is no mapped edge [2019-12-07 14:44:53,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1110] [1110] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_21 256)) (= v_~y~0_280 |v_ULTIMATE.start_main_#t~ite75_33|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$flush_delayed~0_111 0)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_33|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~y$flush_delayed~0=v_~y$flush_delayed~0_111, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~y~0=v_~y~0_280, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_32|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite75, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:44:53,159 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a413d967-f822-48ce-85b6-d08e30b4bfb6/bin/utaipan/witness.graphml [2019-12-07 14:44:53,160 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:44:53,161 INFO L168 Benchmark]: Toolchain (without parser) took 388295.37 ms. Allocated memory was 1.0 GB in the beginning and 11.0 GB in the end (delta: 10.0 GB). Free memory was 942.5 MB in the beginning and 4.5 GB in the end (delta: -3.6 GB). Peak memory consumption was 6.4 GB. Max. memory is 11.5 GB. [2019-12-07 14:44:53,161 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:44:53,162 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -111.1 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:44:53,162 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.88 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 14:44:53,162 INFO L168 Benchmark]: Boogie Preprocessor took 28.12 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:44:53,163 INFO L168 Benchmark]: RCFGBuilder took 489.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 982.2 MB in the end (delta: 65.9 MB). Peak memory consumption was 65.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:44:53,163 INFO L168 Benchmark]: TraceAbstraction took 387265.67 ms. Allocated memory was 1.1 GB in the beginning and 11.0 GB in the end (delta: 9.9 GB). Free memory was 982.2 MB in the beginning and 4.6 GB in the end (delta: -3.6 GB). Peak memory consumption was 6.3 GB. Max. memory is 11.5 GB. [2019-12-07 14:44:53,163 INFO L168 Benchmark]: Witness Printer took 92.98 ms. Allocated memory is still 11.0 GB. Free memory was 4.6 GB in the beginning and 4.5 GB in the end (delta: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. [2019-12-07 14:44:53,165 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 374.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -111.1 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.88 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. * Boogie Preprocessor took 28.12 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 489.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 982.2 MB in the end (delta: 65.9 MB). Peak memory consumption was 65.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 387265.67 ms. Allocated memory was 1.1 GB in the beginning and 11.0 GB in the end (delta: 9.9 GB). Free memory was 982.2 MB in the beginning and 4.6 GB in the end (delta: -3.6 GB). Peak memory consumption was 6.3 GB. Max. memory is 11.5 GB. * Witness Printer took 92.98 ms. Allocated memory is still 11.0 GB. Free memory was 4.6 GB in the beginning and 4.5 GB in the end (delta: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 217 ProgramPointsBefore, 128 ProgramPointsAfterwards, 275 TransitionsBefore, 150 TransitionsAfterwards, 35344 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 55 ConcurrentYvCompositions, 40 ChoiceCompositions, 12325 VarBasedMoverChecksPositive, 332 VarBasedMoverChecksNegative, 52 SemBasedMoverChecksPositive, 411 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 191480 CheckedPairsTotal, 129 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t1699, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t1700, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L749] 2 y$w_buff1 = y$w_buff0 [L750] 2 y$w_buff0 = 2 [L751] 2 y$w_buff1_used = y$w_buff0_used [L752] 2 y$w_buff0_used = (_Bool)1 [L765] 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L767] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L768] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L824] FCALL, FORK 0 pthread_create(&t1701, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y = y$flush_delayed ? y$mem_tmp : y [L774] 2 y$flush_delayed = (_Bool)0 [L777] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L794] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 __unbuffered_p0_EAX = x [L732] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y=2] [L797] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L735] 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L798] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L799] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L800] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L781] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L782] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L736] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L737] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L738] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L826] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L830] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L831] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L832] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L833] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L834] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L837] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L838] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L839] 0 y$flush_delayed = weak$$choice2 [L840] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L841] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L842] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L842] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L843] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L843] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L844] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L844] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L845] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L845] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L846] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L847] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L847] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 2 error locations. Result: UNSAFE, OverallTime: 387.0s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 40.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5680 SDtfs, 6283 SDslu, 19950 SDs, 0 SdLazy, 10467 SolverSat, 296 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 41 SyntacticMatches, 17 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=689899occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 198.5s AutomataMinimizationTime, 23 MinimizatonAttempts, 289544 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1410 NumberOfCodeBlocks, 1410 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1302 ConstructedInterpolants, 0 QuantifiedInterpolants, 720959 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...