./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix026_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8c045482-0608-44cf-94a2-b4e1f5670904/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8c045482-0608-44cf-94a2-b4e1f5670904/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8c045482-0608-44cf-94a2-b4e1f5670904/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8c045482-0608-44cf-94a2-b4e1f5670904/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8c045482-0608-44cf-94a2-b4e1f5670904/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8c045482-0608-44cf-94a2-b4e1f5670904/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 88cbd88e52045a32aec6d1e1cb8aa16865bc8ffd ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 11:22:58,712 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:22:58,714 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:22:58,721 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:22:58,721 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:22:58,722 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:22:58,723 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:22:58,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:22:58,725 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:22:58,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:22:58,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:22:58,727 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:22:58,728 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:22:58,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:22:58,729 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:22:58,730 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:22:58,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:22:58,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:22:58,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:22:58,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:22:58,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:22:58,735 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:22:58,736 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:22:58,736 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:22:58,738 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:22:58,738 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:22:58,739 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:22:58,739 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:22:58,739 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:22:58,740 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:22:58,740 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:22:58,741 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:22:58,741 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:22:58,742 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:22:58,743 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:22:58,743 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:22:58,744 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:22:58,744 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:22:58,744 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:22:58,745 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:22:58,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:22:58,746 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8c045482-0608-44cf-94a2-b4e1f5670904/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 11:22:58,758 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:22:58,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:22:58,759 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:22:58,759 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:22:58,759 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:22:58,759 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:22:58,759 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:22:58,759 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:22:58,760 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:22:58,760 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:22:58,760 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:22:58,760 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:22:58,760 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:22:58,760 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:22:58,761 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:22:58,761 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:22:58,761 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:22:58,761 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:22:58,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:22:58,762 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:22:58,762 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:22:58,762 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:22:58,762 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:22:58,762 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:22:58,762 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:22:58,763 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:22:58,763 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:22:58,763 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:22:58,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:22:58,763 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:22:58,764 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:22:58,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:22:58,764 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:22:58,764 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:22:58,764 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:22:58,764 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:22:58,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:22:58,765 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:22:58,765 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:22:58,765 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:22:58,765 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_8c045482-0608-44cf-94a2-b4e1f5670904/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 -> 88cbd88e52045a32aec6d1e1cb8aa16865bc8ffd [2019-12-07 11:22:58,866 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:22:58,874 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:22:58,876 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:22:58,877 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:22:58,877 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:22:58,878 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8c045482-0608-44cf-94a2-b4e1f5670904/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix026_rmo.opt.i [2019-12-07 11:22:58,914 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8c045482-0608-44cf-94a2-b4e1f5670904/bin/utaipan/data/12daa0fe9/265b522142fc485ea7339a3d672ae521/FLAG24af9e62c [2019-12-07 11:22:59,380 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:22:59,380 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8c045482-0608-44cf-94a2-b4e1f5670904/sv-benchmarks/c/pthread-wmm/mix026_rmo.opt.i [2019-12-07 11:22:59,391 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8c045482-0608-44cf-94a2-b4e1f5670904/bin/utaipan/data/12daa0fe9/265b522142fc485ea7339a3d672ae521/FLAG24af9e62c [2019-12-07 11:22:59,898 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8c045482-0608-44cf-94a2-b4e1f5670904/bin/utaipan/data/12daa0fe9/265b522142fc485ea7339a3d672ae521 [2019-12-07 11:22:59,900 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:22:59,901 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:22:59,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:22:59,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:22:59,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:22:59,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:22:59" (1/1) ... [2019-12-07 11:22:59,908 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a7eda1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:22:59, skipping insertion in model container [2019-12-07 11:22:59,908 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:22:59" (1/1) ... [2019-12-07 11:22:59,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:22:59,944 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:23:00,189 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:23:00,197 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:23:00,242 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:23:00,287 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:23:00,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:23:00 WrapperNode [2019-12-07 11:23:00,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:23:00,288 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:23:00,288 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:23:00,288 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:23:00,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:23:00" (1/1) ... [2019-12-07 11:23:00,307 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:23:00" (1/1) ... [2019-12-07 11:23:00,326 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:23:00,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:23:00,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:23:00,326 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:23:00,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:23:00" (1/1) ... [2019-12-07 11:23:00,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:23:00" (1/1) ... [2019-12-07 11:23:00,336 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:23:00" (1/1) ... [2019-12-07 11:23:00,336 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:23:00" (1/1) ... [2019-12-07 11:23:00,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:23:00" (1/1) ... [2019-12-07 11:23:00,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:23:00" (1/1) ... [2019-12-07 11:23:00,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:23:00" (1/1) ... [2019-12-07 11:23:00,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:23:00,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:23:00,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:23:00,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:23:00,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:23:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c045482-0608-44cf-94a2-b4e1f5670904/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 11:23:00,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:23:00,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 11:23:00,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:23:00,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:23:00,391 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 11:23:00,391 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 11:23:00,391 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 11:23:00,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 11:23:00,392 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 11:23:00,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 11:23:00,392 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 11:23:00,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 11:23:00,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 11:23:00,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:23:00,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:23:00,393 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 11:23:00,772 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:23:00,772 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 11:23:00,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:23:00 BoogieIcfgContainer [2019-12-07 11:23:00,773 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:23:00,774 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:23:00,774 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:23:00,776 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:23:00,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:22:59" (1/3) ... [2019-12-07 11:23:00,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5cdb61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:23:00, skipping insertion in model container [2019-12-07 11:23:00,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:23:00" (2/3) ... [2019-12-07 11:23:00,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5cdb61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:23:00, skipping insertion in model container [2019-12-07 11:23:00,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:23:00" (3/3) ... [2019-12-07 11:23:00,779 INFO L109 eAbstractionObserver]: Analyzing ICFG mix026_rmo.opt.i [2019-12-07 11:23:00,786 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 11:23:00,786 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:23:00,792 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:23:00,793 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 11:23:00,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,822 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,822 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,823 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,824 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,834 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,834 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,834 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,835 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,835 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,838 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,838 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,838 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,838 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,838 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,838 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,838 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,838 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,839 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,839 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,839 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,839 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,839 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,839 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,839 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,839 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,839 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,839 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,840 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,840 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,840 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,840 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,840 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,840 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,840 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,840 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,840 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,841 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,841 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,841 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:23:00,853 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 11:23:00,865 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:23:00,865 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:23:00,866 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:23:00,866 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:23:00,866 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:23:00,866 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:23:00,866 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:23:00,866 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:23:00,878 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-07 11:23:00,879 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-07 11:23:00,940 INFO L134 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-07 11:23:00,940 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:23:00,950 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 719 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-07 11:23:00,967 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-07 11:23:00,998 INFO L134 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-07 11:23:00,998 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:23:01,003 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 719 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-07 11:23:01,018 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-07 11:23:01,019 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 11:23:04,292 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 11:23:04,455 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 11:23:04,555 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66604 [2019-12-07 11:23:04,555 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-07 11:23:04,557 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 87 places, 92 transitions [2019-12-07 11:23:30,243 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 154566 states. [2019-12-07 11:23:30,245 INFO L276 IsEmpty]: Start isEmpty. Operand 154566 states. [2019-12-07 11:23:30,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 11:23:30,249 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:30,250 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:23:30,250 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:30,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:30,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1218656403, now seen corresponding path program 1 times [2019-12-07 11:23:30,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:23:30,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384176659] [2019-12-07 11:23:30,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:30,412 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 11:23:30,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384176659] [2019-12-07 11:23:30,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:30,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:23:30,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593443041] [2019-12-07 11:23:30,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:23:30,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:23:30,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:23:30,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:23:30,427 INFO L87 Difference]: Start difference. First operand 154566 states. Second operand 3 states. [2019-12-07 11:23:31,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:31,452 INFO L93 Difference]: Finished difference Result 152486 states and 727020 transitions. [2019-12-07 11:23:31,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:23:31,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 11:23:31,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:32,078 INFO L225 Difference]: With dead ends: 152486 [2019-12-07 11:23:32,078 INFO L226 Difference]: Without dead ends: 143750 [2019-12-07 11:23:32,079 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 11:23:38,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143750 states. [2019-12-07 11:23:40,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143750 to 143750. [2019-12-07 11:23:40,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143750 states. [2019-12-07 11:23:41,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143750 states to 143750 states and 684484 transitions. [2019-12-07 11:23:41,395 INFO L78 Accepts]: Start accepts. Automaton has 143750 states and 684484 transitions. Word has length 7 [2019-12-07 11:23:41,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:41,396 INFO L462 AbstractCegarLoop]: Abstraction has 143750 states and 684484 transitions. [2019-12-07 11:23:41,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:23:41,396 INFO L276 IsEmpty]: Start isEmpty. Operand 143750 states and 684484 transitions. [2019-12-07 11:23:41,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 11:23:41,405 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:41,405 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:23:41,405 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:41,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:41,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1478379087, now seen corresponding path program 1 times [2019-12-07 11:23:41,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:23:41,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210363757] [2019-12-07 11:23:41,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:41,471 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 11:23:41,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210363757] [2019-12-07 11:23:41,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:41,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:23:41,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612069681] [2019-12-07 11:23:41,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:41,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:23:41,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:41,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:41,473 INFO L87 Difference]: Start difference. First operand 143750 states and 684484 transitions. Second operand 4 states. [2019-12-07 11:23:42,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:42,790 INFO L93 Difference]: Finished difference Result 226574 states and 1038112 transitions. [2019-12-07 11:23:42,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:23:42,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 11:23:42,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:43,479 INFO L225 Difference]: With dead ends: 226574 [2019-12-07 11:23:43,479 INFO L226 Difference]: Without dead ends: 226406 [2019-12-07 11:23:43,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:23:51,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226406 states. [2019-12-07 11:23:54,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226406 to 210054. [2019-12-07 11:23:54,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210054 states. [2019-12-07 11:23:55,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210054 states to 210054 states and 970358 transitions. [2019-12-07 11:23:55,577 INFO L78 Accepts]: Start accepts. Automaton has 210054 states and 970358 transitions. Word has length 15 [2019-12-07 11:23:55,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:55,577 INFO L462 AbstractCegarLoop]: Abstraction has 210054 states and 970358 transitions. [2019-12-07 11:23:55,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:55,577 INFO L276 IsEmpty]: Start isEmpty. Operand 210054 states and 970358 transitions. [2019-12-07 11:23:55,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 11:23:55,582 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:55,582 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:23:55,582 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:55,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:55,582 INFO L82 PathProgramCache]: Analyzing trace with hash -731927730, now seen corresponding path program 1 times [2019-12-07 11:23:55,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:23:55,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137317406] [2019-12-07 11:23:55,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:55,632 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 11:23:55,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137317406] [2019-12-07 11:23:55,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:55,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:23:55,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882862962] [2019-12-07 11:23:55,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:55,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:23:55,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:55,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:55,634 INFO L87 Difference]: Start difference. First operand 210054 states and 970358 transitions. Second operand 4 states. [2019-12-07 11:23:57,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:57,944 INFO L93 Difference]: Finished difference Result 290690 states and 1317990 transitions. [2019-12-07 11:23:57,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:23:57,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 11:23:57,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:58,806 INFO L225 Difference]: With dead ends: 290690 [2019-12-07 11:23:58,807 INFO L226 Difference]: Without dead ends: 290498 [2019-12-07 11:23:58,807 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 11:24:08,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290498 states. [2019-12-07 11:24:12,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290498 to 247334. [2019-12-07 11:24:12,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247334 states. [2019-12-07 11:24:13,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247334 states to 247334 states and 1137054 transitions. [2019-12-07 11:24:13,394 INFO L78 Accepts]: Start accepts. Automaton has 247334 states and 1137054 transitions. Word has length 15 [2019-12-07 11:24:13,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:13,395 INFO L462 AbstractCegarLoop]: Abstraction has 247334 states and 1137054 transitions. [2019-12-07 11:24:13,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:24:13,395 INFO L276 IsEmpty]: Start isEmpty. Operand 247334 states and 1137054 transitions. [2019-12-07 11:24:13,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:24:13,400 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:13,400 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:13,400 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:13,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:13,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1917193142, now seen corresponding path program 1 times [2019-12-07 11:24:13,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:24:13,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536727410] [2019-12-07 11:24:13,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:13,448 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 11:24:13,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536727410] [2019-12-07 11:24:13,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:13,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:24:13,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007066588] [2019-12-07 11:24:13,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:24:13,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:24:13,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:24:13,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:24:13,450 INFO L87 Difference]: Start difference. First operand 247334 states and 1137054 transitions. Second operand 5 states. [2019-12-07 11:24:15,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:15,841 INFO L93 Difference]: Finished difference Result 335030 states and 1515532 transitions. [2019-12-07 11:24:15,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:24:15,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 11:24:15,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:16,817 INFO L225 Difference]: With dead ends: 335030 [2019-12-07 11:24:16,817 INFO L226 Difference]: Without dead ends: 334758 [2019-12-07 11:24:16,817 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 11:24:26,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334758 states. [2019-12-07 11:24:31,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334758 to 261640. [2019-12-07 11:24:31,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261640 states. [2019-12-07 11:24:32,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261640 states to 261640 states and 1201383 transitions. [2019-12-07 11:24:32,171 INFO L78 Accepts]: Start accepts. Automaton has 261640 states and 1201383 transitions. Word has length 16 [2019-12-07 11:24:32,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:32,171 INFO L462 AbstractCegarLoop]: Abstraction has 261640 states and 1201383 transitions. [2019-12-07 11:24:32,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:24:32,171 INFO L276 IsEmpty]: Start isEmpty. Operand 261640 states and 1201383 transitions. [2019-12-07 11:24:32,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 11:24:32,195 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:32,195 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] [2019-12-07 11:24:32,196 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:32,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:32,196 INFO L82 PathProgramCache]: Analyzing trace with hash -590847212, now seen corresponding path program 1 times [2019-12-07 11:24:32,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:24:32,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654022084] [2019-12-07 11:24:32,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:32,251 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 11:24:32,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654022084] [2019-12-07 11:24:32,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:32,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:24:32,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834845138] [2019-12-07 11:24:32,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:24:32,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:24:32,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:24:32,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:24:32,252 INFO L87 Difference]: Start difference. First operand 261640 states and 1201383 transitions. Second operand 3 states. [2019-12-07 11:24:33,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:33,938 INFO L93 Difference]: Finished difference Result 246888 states and 1122565 transitions. [2019-12-07 11:24:33,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:24:33,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 11:24:33,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:34,641 INFO L225 Difference]: With dead ends: 246888 [2019-12-07 11:24:34,642 INFO L226 Difference]: Without dead ends: 246888 [2019-12-07 11:24:34,642 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 11:24:43,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246888 states. [2019-12-07 11:24:46,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246888 to 243128. [2019-12-07 11:24:46,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243128 states. [2019-12-07 11:24:47,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243128 states to 243128 states and 1106381 transitions. [2019-12-07 11:24:47,457 INFO L78 Accepts]: Start accepts. Automaton has 243128 states and 1106381 transitions. Word has length 20 [2019-12-07 11:24:47,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:47,457 INFO L462 AbstractCegarLoop]: Abstraction has 243128 states and 1106381 transitions. [2019-12-07 11:24:47,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:24:47,457 INFO L276 IsEmpty]: Start isEmpty. Operand 243128 states and 1106381 transitions. [2019-12-07 11:24:47,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 11:24:47,475 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:47,475 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] [2019-12-07 11:24:47,475 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:47,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:47,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1133597908, now seen corresponding path program 1 times [2019-12-07 11:24:47,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:24:47,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273325001] [2019-12-07 11:24:47,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:47,503 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 11:24:47,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273325001] [2019-12-07 11:24:47,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:47,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:24:47,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469530900] [2019-12-07 11:24:47,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:24:47,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:24:47,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:24:47,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:24:47,504 INFO L87 Difference]: Start difference. First operand 243128 states and 1106381 transitions. Second operand 3 states. [2019-12-07 11:24:48,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:48,540 INFO L93 Difference]: Finished difference Result 148148 states and 606205 transitions. [2019-12-07 11:24:48,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:24:48,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 11:24:48,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:48,904 INFO L225 Difference]: With dead ends: 148148 [2019-12-07 11:24:48,904 INFO L226 Difference]: Without dead ends: 148148 [2019-12-07 11:24:48,904 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:24:52,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148148 states. [2019-12-07 11:24:54,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148148 to 148148. [2019-12-07 11:24:54,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148148 states. [2019-12-07 11:24:54,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148148 states to 148148 states and 606205 transitions. [2019-12-07 11:24:54,552 INFO L78 Accepts]: Start accepts. Automaton has 148148 states and 606205 transitions. Word has length 20 [2019-12-07 11:24:54,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:54,552 INFO L462 AbstractCegarLoop]: Abstraction has 148148 states and 606205 transitions. [2019-12-07 11:24:54,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:24:54,552 INFO L276 IsEmpty]: Start isEmpty. Operand 148148 states and 606205 transitions. [2019-12-07 11:24:54,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 11:24:54,565 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:54,565 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:54,565 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:54,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:54,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1169391876, now seen corresponding path program 1 times [2019-12-07 11:24:54,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:24:54,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86734691] [2019-12-07 11:24:54,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:54,622 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 11:24:54,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86734691] [2019-12-07 11:24:54,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:54,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:24:54,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579739312] [2019-12-07 11:24:54,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:24:54,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:24:54,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:24:54,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:24:54,624 INFO L87 Difference]: Start difference. First operand 148148 states and 606205 transitions. Second operand 4 states. [2019-12-07 11:24:55,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:55,619 INFO L93 Difference]: Finished difference Result 252801 states and 1028764 transitions. [2019-12-07 11:24:55,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:24:55,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 11:24:55,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:56,665 INFO L225 Difference]: With dead ends: 252801 [2019-12-07 11:24:56,665 INFO L226 Difference]: Without dead ends: 245297 [2019-12-07 11:24:56,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:25:00,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245297 states. [2019-12-07 11:25:06,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245297 to 237117. [2019-12-07 11:25:06,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237117 states. [2019-12-07 11:25:07,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237117 states to 237117 states and 972501 transitions. [2019-12-07 11:25:07,123 INFO L78 Accepts]: Start accepts. Automaton has 237117 states and 972501 transitions. Word has length 21 [2019-12-07 11:25:07,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:07,123 INFO L462 AbstractCegarLoop]: Abstraction has 237117 states and 972501 transitions. [2019-12-07 11:25:07,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:25:07,123 INFO L276 IsEmpty]: Start isEmpty. Operand 237117 states and 972501 transitions. [2019-12-07 11:25:07,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 11:25:07,147 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:07,147 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:25:07,147 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:07,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:07,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1182526653, now seen corresponding path program 1 times [2019-12-07 11:25:07,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:25:07,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019342362] [2019-12-07 11:25:07,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:25:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:07,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 11:25:07,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019342362] [2019-12-07 11:25:07,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:07,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:25:07,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153373233] [2019-12-07 11:25:07,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:25:07,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:25:07,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:25:07,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:25:07,194 INFO L87 Difference]: Start difference. First operand 237117 states and 972501 transitions. Second operand 5 states. [2019-12-07 11:25:09,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:09,388 INFO L93 Difference]: Finished difference Result 325902 states and 1312839 transitions. [2019-12-07 11:25:09,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:25:09,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 11:25:09,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:10,180 INFO L225 Difference]: With dead ends: 325902 [2019-12-07 11:25:10,180 INFO L226 Difference]: Without dead ends: 325715 [2019-12-07 11:25:10,181 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 11:25:14,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325715 states. [2019-12-07 11:25:18,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325715 to 252695. [2019-12-07 11:25:18,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252695 states. [2019-12-07 11:25:19,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252695 states to 252695 states and 1033374 transitions. [2019-12-07 11:25:19,499 INFO L78 Accepts]: Start accepts. Automaton has 252695 states and 1033374 transitions. Word has length 22 [2019-12-07 11:25:19,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:19,499 INFO L462 AbstractCegarLoop]: Abstraction has 252695 states and 1033374 transitions. [2019-12-07 11:25:19,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:25:19,500 INFO L276 IsEmpty]: Start isEmpty. Operand 252695 states and 1033374 transitions. [2019-12-07 11:25:19,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 11:25:19,523 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:19,523 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:25:19,523 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:19,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:19,524 INFO L82 PathProgramCache]: Analyzing trace with hash -2129291057, now seen corresponding path program 1 times [2019-12-07 11:25:19,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:25:19,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436289052] [2019-12-07 11:25:19,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:25:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:19,557 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 11:25:19,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436289052] [2019-12-07 11:25:19,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:19,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:25:19,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085463304] [2019-12-07 11:25:19,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:25:19,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:25:19,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:25:19,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:25:19,559 INFO L87 Difference]: Start difference. First operand 252695 states and 1033374 transitions. Second operand 4 states. [2019-12-07 11:25:21,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:21,783 INFO L93 Difference]: Finished difference Result 417224 states and 1701185 transitions. [2019-12-07 11:25:21,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:25:21,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 11:25:21,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:22,417 INFO L225 Difference]: With dead ends: 417224 [2019-12-07 11:25:22,417 INFO L226 Difference]: Without dead ends: 239431 [2019-12-07 11:25:22,418 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 11:25:29,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239431 states. [2019-12-07 11:25:32,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239431 to 238906. [2019-12-07 11:25:32,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238906 states. [2019-12-07 11:25:33,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238906 states to 238906 states and 971586 transitions. [2019-12-07 11:25:33,604 INFO L78 Accepts]: Start accepts. Automaton has 238906 states and 971586 transitions. Word has length 22 [2019-12-07 11:25:33,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:33,604 INFO L462 AbstractCegarLoop]: Abstraction has 238906 states and 971586 transitions. [2019-12-07 11:25:33,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:25:33,604 INFO L276 IsEmpty]: Start isEmpty. Operand 238906 states and 971586 transitions. [2019-12-07 11:25:33,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 11:25:33,627 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:33,628 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:25:33,628 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:33,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:33,628 INFO L82 PathProgramCache]: Analyzing trace with hash -150132667, now seen corresponding path program 2 times [2019-12-07 11:25:33,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:25:33,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967469678] [2019-12-07 11:25:33,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:25:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:33,659 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 11:25:33,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967469678] [2019-12-07 11:25:33,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:33,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:25:33,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564432386] [2019-12-07 11:25:33,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:25:33,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:25:33,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:25:33,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:25:33,660 INFO L87 Difference]: Start difference. First operand 238906 states and 971586 transitions. Second operand 4 states. [2019-12-07 11:25:33,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:33,874 INFO L93 Difference]: Finished difference Result 62621 states and 213209 transitions. [2019-12-07 11:25:33,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:25:33,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 11:25:33,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:33,983 INFO L225 Difference]: With dead ends: 62621 [2019-12-07 11:25:33,984 INFO L226 Difference]: Without dead ends: 62621 [2019-12-07 11:25:33,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:25:34,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62621 states. [2019-12-07 11:25:35,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62621 to 62621. [2019-12-07 11:25:35,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62621 states. [2019-12-07 11:25:35,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62621 states to 62621 states and 213209 transitions. [2019-12-07 11:25:35,360 INFO L78 Accepts]: Start accepts. Automaton has 62621 states and 213209 transitions. Word has length 22 [2019-12-07 11:25:35,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:35,361 INFO L462 AbstractCegarLoop]: Abstraction has 62621 states and 213209 transitions. [2019-12-07 11:25:35,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:25:35,361 INFO L276 IsEmpty]: Start isEmpty. Operand 62621 states and 213209 transitions. [2019-12-07 11:25:35,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 11:25:35,371 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:35,371 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] [2019-12-07 11:25:35,371 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:35,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:35,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1134773804, now seen corresponding path program 1 times [2019-12-07 11:25:35,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:25:35,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016162725] [2019-12-07 11:25:35,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:25:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:35,419 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 11:25:35,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016162725] [2019-12-07 11:25:35,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:35,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:25:35,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867195117] [2019-12-07 11:25:35,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:25:35,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:25:35,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:25:35,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:25:35,420 INFO L87 Difference]: Start difference. First operand 62621 states and 213209 transitions. Second operand 6 states. [2019-12-07 11:25:36,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:36,057 INFO L93 Difference]: Finished difference Result 95809 states and 318254 transitions. [2019-12-07 11:25:36,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 11:25:36,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 11:25:36,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:36,216 INFO L225 Difference]: With dead ends: 95809 [2019-12-07 11:25:36,216 INFO L226 Difference]: Without dead ends: 95585 [2019-12-07 11:25:36,217 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:25:36,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95585 states. [2019-12-07 11:25:37,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95585 to 68007. [2019-12-07 11:25:37,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68007 states. [2019-12-07 11:25:37,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68007 states to 68007 states and 229538 transitions. [2019-12-07 11:25:37,822 INFO L78 Accepts]: Start accepts. Automaton has 68007 states and 229538 transitions. Word has length 24 [2019-12-07 11:25:37,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:37,822 INFO L462 AbstractCegarLoop]: Abstraction has 68007 states and 229538 transitions. [2019-12-07 11:25:37,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:25:37,822 INFO L276 IsEmpty]: Start isEmpty. Operand 68007 states and 229538 transitions. [2019-12-07 11:25:37,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 11:25:37,848 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:37,848 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] [2019-12-07 11:25:37,848 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:37,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:37,848 INFO L82 PathProgramCache]: Analyzing trace with hash 790027274, now seen corresponding path program 1 times [2019-12-07 11:25:37,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:25:37,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828570192] [2019-12-07 11:25:37,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:25:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:37,900 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 11:25:37,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828570192] [2019-12-07 11:25:37,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:37,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:25:37,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739442079] [2019-12-07 11:25:37,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:25:37,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:25:37,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:25:37,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:25:37,901 INFO L87 Difference]: Start difference. First operand 68007 states and 229538 transitions. Second operand 6 states. [2019-12-07 11:25:38,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:38,430 INFO L93 Difference]: Finished difference Result 94344 states and 313595 transitions. [2019-12-07 11:25:38,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:25:38,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-12-07 11:25:38,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:38,583 INFO L225 Difference]: With dead ends: 94344 [2019-12-07 11:25:38,583 INFO L226 Difference]: Without dead ends: 93619 [2019-12-07 11:25:38,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:25:38,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93619 states. [2019-12-07 11:25:39,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93619 to 69791. [2019-12-07 11:25:39,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69791 states. [2019-12-07 11:25:40,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69791 states to 69791 states and 235369 transitions. [2019-12-07 11:25:40,024 INFO L78 Accepts]: Start accepts. Automaton has 69791 states and 235369 transitions. Word has length 30 [2019-12-07 11:25:40,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:40,024 INFO L462 AbstractCegarLoop]: Abstraction has 69791 states and 235369 transitions. [2019-12-07 11:25:40,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:25:40,024 INFO L276 IsEmpty]: Start isEmpty. Operand 69791 states and 235369 transitions. [2019-12-07 11:25:40,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 11:25:40,066 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:40,067 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] [2019-12-07 11:25:40,067 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:40,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:40,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1968017113, now seen corresponding path program 1 times [2019-12-07 11:25:40,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:25:40,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632798029] [2019-12-07 11:25:40,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:25:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:40,107 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 11:25:40,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632798029] [2019-12-07 11:25:40,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:40,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:25:40,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676455335] [2019-12-07 11:25:40,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:25:40,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:25:40,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:25:40,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:25:40,108 INFO L87 Difference]: Start difference. First operand 69791 states and 235369 transitions. Second operand 5 states. [2019-12-07 11:25:40,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:40,234 INFO L93 Difference]: Finished difference Result 33873 states and 117568 transitions. [2019-12-07 11:25:40,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:25:40,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 11:25:40,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:40,289 INFO L225 Difference]: With dead ends: 33873 [2019-12-07 11:25:40,289 INFO L226 Difference]: Without dead ends: 33873 [2019-12-07 11:25:40,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:25:40,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33873 states. [2019-12-07 11:25:40,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33873 to 28581. [2019-12-07 11:25:40,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28581 states. [2019-12-07 11:25:40,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28581 states to 28581 states and 95922 transitions. [2019-12-07 11:25:40,771 INFO L78 Accepts]: Start accepts. Automaton has 28581 states and 95922 transitions. Word has length 33 [2019-12-07 11:25:40,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:40,771 INFO L462 AbstractCegarLoop]: Abstraction has 28581 states and 95922 transitions. [2019-12-07 11:25:40,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:25:40,771 INFO L276 IsEmpty]: Start isEmpty. Operand 28581 states and 95922 transitions. [2019-12-07 11:25:40,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 11:25:40,803 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:40,803 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] [2019-12-07 11:25:40,803 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:40,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:40,803 INFO L82 PathProgramCache]: Analyzing trace with hash 261118904, now seen corresponding path program 1 times [2019-12-07 11:25:40,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:25:40,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669621586] [2019-12-07 11:25:40,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:25:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:40,865 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 11:25:40,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669621586] [2019-12-07 11:25:40,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:40,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:25:40,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064131602] [2019-12-07 11:25:40,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:25:40,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:25:40,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:25:40,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:25:40,866 INFO L87 Difference]: Start difference. First operand 28581 states and 95922 transitions. Second operand 7 states. [2019-12-07 11:25:41,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:41,594 INFO L93 Difference]: Finished difference Result 38265 states and 125377 transitions. [2019-12-07 11:25:41,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 11:25:41,594 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-07 11:25:41,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:41,647 INFO L225 Difference]: With dead ends: 38265 [2019-12-07 11:25:41,647 INFO L226 Difference]: Without dead ends: 37596 [2019-12-07 11:25:41,648 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2019-12-07 11:25:41,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37596 states. [2019-12-07 11:25:42,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37596 to 27895. [2019-12-07 11:25:42,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27895 states. [2019-12-07 11:25:42,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27895 states to 27895 states and 93544 transitions. [2019-12-07 11:25:42,245 INFO L78 Accepts]: Start accepts. Automaton has 27895 states and 93544 transitions. Word has length 42 [2019-12-07 11:25:42,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:42,246 INFO L462 AbstractCegarLoop]: Abstraction has 27895 states and 93544 transitions. [2019-12-07 11:25:42,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:25:42,246 INFO L276 IsEmpty]: Start isEmpty. Operand 27895 states and 93544 transitions. [2019-12-07 11:25:42,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 11:25:42,278 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:42,278 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] [2019-12-07 11:25:42,278 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:42,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:42,278 INFO L82 PathProgramCache]: Analyzing trace with hash 799718125, now seen corresponding path program 1 times [2019-12-07 11:25:42,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:25:42,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834755620] [2019-12-07 11:25:42,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:25:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:42,337 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 11:25:42,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834755620] [2019-12-07 11:25:42,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:42,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:25:42,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454035413] [2019-12-07 11:25:42,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:25:42,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:25:42,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:25:42,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:25:42,339 INFO L87 Difference]: Start difference. First operand 27895 states and 93544 transitions. Second operand 5 states. [2019-12-07 11:25:42,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:42,734 INFO L93 Difference]: Finished difference Result 42035 states and 140475 transitions. [2019-12-07 11:25:42,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:25:42,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-07 11:25:42,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:42,798 INFO L225 Difference]: With dead ends: 42035 [2019-12-07 11:25:42,798 INFO L226 Difference]: Without dead ends: 42035 [2019-12-07 11:25:42,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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 11:25:42,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42035 states. [2019-12-07 11:25:43,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42035 to 35397. [2019-12-07 11:25:43,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35397 states. [2019-12-07 11:25:43,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35397 states to 35397 states and 118744 transitions. [2019-12-07 11:25:43,392 INFO L78 Accepts]: Start accepts. Automaton has 35397 states and 118744 transitions. Word has length 43 [2019-12-07 11:25:43,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:43,392 INFO L462 AbstractCegarLoop]: Abstraction has 35397 states and 118744 transitions. [2019-12-07 11:25:43,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:25:43,392 INFO L276 IsEmpty]: Start isEmpty. Operand 35397 states and 118744 transitions. [2019-12-07 11:25:43,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 11:25:43,430 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:43,430 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] [2019-12-07 11:25:43,430 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:43,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:43,431 INFO L82 PathProgramCache]: Analyzing trace with hash 585685071, now seen corresponding path program 2 times [2019-12-07 11:25:43,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:25:43,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560545423] [2019-12-07 11:25:43,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:25:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:43,476 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 11:25:43,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560545423] [2019-12-07 11:25:43,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:43,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:25:43,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036516569] [2019-12-07 11:25:43,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:25:43,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:25:43,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:25:43,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:25:43,477 INFO L87 Difference]: Start difference. First operand 35397 states and 118744 transitions. Second operand 3 states. [2019-12-07 11:25:43,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:43,558 INFO L93 Difference]: Finished difference Result 27895 states and 92505 transitions. [2019-12-07 11:25:43,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:25:43,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-12-07 11:25:43,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:43,603 INFO L225 Difference]: With dead ends: 27895 [2019-12-07 11:25:43,603 INFO L226 Difference]: Without dead ends: 27895 [2019-12-07 11:25:43,603 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 11:25:43,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27895 states. [2019-12-07 11:25:43,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27895 to 27595. [2019-12-07 11:25:43,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27595 states. [2019-12-07 11:25:44,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27595 states to 27595 states and 91577 transitions. [2019-12-07 11:25:44,027 INFO L78 Accepts]: Start accepts. Automaton has 27595 states and 91577 transitions. Word has length 43 [2019-12-07 11:25:44,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:44,027 INFO L462 AbstractCegarLoop]: Abstraction has 27595 states and 91577 transitions. [2019-12-07 11:25:44,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:25:44,028 INFO L276 IsEmpty]: Start isEmpty. Operand 27595 states and 91577 transitions. [2019-12-07 11:25:44,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 11:25:44,058 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:44,058 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] [2019-12-07 11:25:44,058 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:44,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:44,058 INFO L82 PathProgramCache]: Analyzing trace with hash -626667720, now seen corresponding path program 1 times [2019-12-07 11:25:44,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:25:44,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121245310] [2019-12-07 11:25:44,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:25:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:44,098 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 11:25:44,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121245310] [2019-12-07 11:25:44,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:44,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:25:44,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513856708] [2019-12-07 11:25:44,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:25:44,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:25:44,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:25:44,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:25:44,100 INFO L87 Difference]: Start difference. First operand 27595 states and 91577 transitions. Second operand 6 states. [2019-12-07 11:25:44,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:44,201 INFO L93 Difference]: Finished difference Result 25582 states and 86980 transitions. [2019-12-07 11:25:44,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:25:44,201 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-12-07 11:25:44,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:44,239 INFO L225 Difference]: With dead ends: 25582 [2019-12-07 11:25:44,239 INFO L226 Difference]: Without dead ends: 25354 [2019-12-07 11:25:44,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:25:44,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25354 states. [2019-12-07 11:25:44,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25354 to 17869. [2019-12-07 11:25:44,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17869 states. [2019-12-07 11:25:44,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17869 states to 17869 states and 62755 transitions. [2019-12-07 11:25:44,636 INFO L78 Accepts]: Start accepts. Automaton has 17869 states and 62755 transitions. Word has length 44 [2019-12-07 11:25:44,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:44,636 INFO L462 AbstractCegarLoop]: Abstraction has 17869 states and 62755 transitions. [2019-12-07 11:25:44,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:25:44,636 INFO L276 IsEmpty]: Start isEmpty. Operand 17869 states and 62755 transitions. [2019-12-07 11:25:44,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 11:25:44,652 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:44,653 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] [2019-12-07 11:25:44,653 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:44,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:44,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1045390656, now seen corresponding path program 1 times [2019-12-07 11:25:44,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:25:44,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755229188] [2019-12-07 11:25:44,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:25:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:44,676 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 11:25:44,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755229188] [2019-12-07 11:25:44,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:44,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:25:44,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236947353] [2019-12-07 11:25:44,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:25:44,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:25:44,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:25:44,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:25:44,677 INFO L87 Difference]: Start difference. First operand 17869 states and 62755 transitions. Second operand 3 states. [2019-12-07 11:25:44,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:44,762 INFO L93 Difference]: Finished difference Result 24929 states and 87649 transitions. [2019-12-07 11:25:44,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:25:44,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-07 11:25:44,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:44,804 INFO L225 Difference]: With dead ends: 24929 [2019-12-07 11:25:44,804 INFO L226 Difference]: Without dead ends: 24929 [2019-12-07 11:25:44,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:25:44,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24929 states. [2019-12-07 11:25:45,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24929 to 20385. [2019-12-07 11:25:45,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20385 states. [2019-12-07 11:25:45,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20385 states to 20385 states and 71965 transitions. [2019-12-07 11:25:45,169 INFO L78 Accepts]: Start accepts. Automaton has 20385 states and 71965 transitions. Word has length 58 [2019-12-07 11:25:45,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:45,169 INFO L462 AbstractCegarLoop]: Abstraction has 20385 states and 71965 transitions. [2019-12-07 11:25:45,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:25:45,169 INFO L276 IsEmpty]: Start isEmpty. Operand 20385 states and 71965 transitions. [2019-12-07 11:25:45,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 11:25:45,190 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:45,191 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] [2019-12-07 11:25:45,191 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:45,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:45,191 INFO L82 PathProgramCache]: Analyzing trace with hash 723016660, now seen corresponding path program 1 times [2019-12-07 11:25:45,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:25:45,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835250588] [2019-12-07 11:25:45,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:25:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:45,406 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 11:25:45,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835250588] [2019-12-07 11:25:45,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:45,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 11:25:45,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159932331] [2019-12-07 11:25:45,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:25:45,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:25:45,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:25:45,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:25:45,407 INFO L87 Difference]: Start difference. First operand 20385 states and 71965 transitions. Second operand 9 states. [2019-12-07 11:25:46,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:46,563 INFO L93 Difference]: Finished difference Result 80589 states and 284715 transitions. [2019-12-07 11:25:46,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 11:25:46,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-12-07 11:25:46,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:46,693 INFO L225 Difference]: With dead ends: 80589 [2019-12-07 11:25:46,694 INFO L226 Difference]: Without dead ends: 75465 [2019-12-07 11:25:46,694 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-12-07 11:25:46,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75465 states. [2019-12-07 11:25:47,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75465 to 33547. [2019-12-07 11:25:47,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33547 states. [2019-12-07 11:25:47,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33547 states to 33547 states and 121526 transitions. [2019-12-07 11:25:47,761 INFO L78 Accepts]: Start accepts. Automaton has 33547 states and 121526 transitions. Word has length 58 [2019-12-07 11:25:47,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:47,761 INFO L462 AbstractCegarLoop]: Abstraction has 33547 states and 121526 transitions. [2019-12-07 11:25:47,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:25:47,761 INFO L276 IsEmpty]: Start isEmpty. Operand 33547 states and 121526 transitions. [2019-12-07 11:25:47,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 11:25:47,800 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:47,800 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] [2019-12-07 11:25:47,800 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:47,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:47,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1921484756, now seen corresponding path program 2 times [2019-12-07 11:25:47,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:25:47,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269421224] [2019-12-07 11:25:47,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:25:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:48,040 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 11:25:48,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269421224] [2019-12-07 11:25:48,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:48,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 11:25:48,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71436966] [2019-12-07 11:25:48,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 11:25:48,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:25:48,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:25:48,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:25:48,042 INFO L87 Difference]: Start difference. First operand 33547 states and 121526 transitions. Second operand 10 states. [2019-12-07 11:25:49,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:49,646 INFO L93 Difference]: Finished difference Result 90681 states and 311771 transitions. [2019-12-07 11:25:49,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 11:25:49,646 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-07 11:25:49,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:49,778 INFO L225 Difference]: With dead ends: 90681 [2019-12-07 11:25:49,778 INFO L226 Difference]: Without dead ends: 78516 [2019-12-07 11:25:49,779 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=517, Unknown=0, NotChecked=0, Total=702 [2019-12-07 11:25:49,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78516 states. [2019-12-07 11:25:50,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78516 to 47704. [2019-12-07 11:25:50,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47704 states. [2019-12-07 11:25:50,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47704 states to 47704 states and 169599 transitions. [2019-12-07 11:25:50,856 INFO L78 Accepts]: Start accepts. Automaton has 47704 states and 169599 transitions. Word has length 58 [2019-12-07 11:25:50,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:50,856 INFO L462 AbstractCegarLoop]: Abstraction has 47704 states and 169599 transitions. [2019-12-07 11:25:50,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 11:25:50,856 INFO L276 IsEmpty]: Start isEmpty. Operand 47704 states and 169599 transitions. [2019-12-07 11:25:50,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 11:25:50,912 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:50,912 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] [2019-12-07 11:25:50,912 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:50,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:50,912 INFO L82 PathProgramCache]: Analyzing trace with hash -2067742346, now seen corresponding path program 3 times [2019-12-07 11:25:50,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:25:50,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019913610] [2019-12-07 11:25:50,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:25:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:50,960 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 11:25:50,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019913610] [2019-12-07 11:25:50,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:50,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:25:50,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083849863] [2019-12-07 11:25:50,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:25:50,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:25:50,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:25:50,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:25:50,961 INFO L87 Difference]: Start difference. First operand 47704 states and 169599 transitions. Second operand 6 states. [2019-12-07 11:25:51,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:51,528 INFO L93 Difference]: Finished difference Result 115283 states and 399754 transitions. [2019-12-07 11:25:51,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 11:25:51,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-07 11:25:51,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:51,654 INFO L225 Difference]: With dead ends: 115283 [2019-12-07 11:25:51,654 INFO L226 Difference]: Without dead ends: 83229 [2019-12-07 11:25:51,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:25:51,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83229 states. [2019-12-07 11:25:52,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83229 to 57309. [2019-12-07 11:25:52,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57309 states. [2019-12-07 11:25:52,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57309 states to 57309 states and 202153 transitions. [2019-12-07 11:25:52,882 INFO L78 Accepts]: Start accepts. Automaton has 57309 states and 202153 transitions. Word has length 58 [2019-12-07 11:25:52,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:52,882 INFO L462 AbstractCegarLoop]: Abstraction has 57309 states and 202153 transitions. [2019-12-07 11:25:52,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:25:52,882 INFO L276 IsEmpty]: Start isEmpty. Operand 57309 states and 202153 transitions. [2019-12-07 11:25:52,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 11:25:52,958 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:52,959 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] [2019-12-07 11:25:52,959 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:52,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:52,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1842938934, now seen corresponding path program 4 times [2019-12-07 11:25:52,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:25:52,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844722456] [2019-12-07 11:25:52,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:25:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:53,011 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 11:25:53,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844722456] [2019-12-07 11:25:53,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:53,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:25:53,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343693932] [2019-12-07 11:25:53,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:25:53,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:25:53,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:25:53,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:25:53,013 INFO L87 Difference]: Start difference. First operand 57309 states and 202153 transitions. Second operand 4 states. [2019-12-07 11:25:53,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:53,247 INFO L93 Difference]: Finished difference Result 74452 states and 255443 transitions. [2019-12-07 11:25:53,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:25:53,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 11:25:53,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:53,275 INFO L225 Difference]: With dead ends: 74452 [2019-12-07 11:25:53,275 INFO L226 Difference]: Without dead ends: 18401 [2019-12-07 11:25:53,275 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 11:25:53,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18401 states. [2019-12-07 11:25:53,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18401 to 18242. [2019-12-07 11:25:53,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18242 states. [2019-12-07 11:25:53,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18242 states to 18242 states and 56904 transitions. [2019-12-07 11:25:53,525 INFO L78 Accepts]: Start accepts. Automaton has 18242 states and 56904 transitions. Word has length 58 [2019-12-07 11:25:53,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:53,525 INFO L462 AbstractCegarLoop]: Abstraction has 18242 states and 56904 transitions. [2019-12-07 11:25:53,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:25:53,525 INFO L276 IsEmpty]: Start isEmpty. Operand 18242 states and 56904 transitions. [2019-12-07 11:25:53,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 11:25:53,543 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:53,543 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] [2019-12-07 11:25:53,544 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:53,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:53,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1491599706, now seen corresponding path program 1 times [2019-12-07 11:25:53,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:25:53,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946462665] [2019-12-07 11:25:53,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:25:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:53,569 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 11:25:53,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946462665] [2019-12-07 11:25:53,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:53,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:25:53,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162726726] [2019-12-07 11:25:53,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:25:53,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:25:53,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:25:53,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:25:53,570 INFO L87 Difference]: Start difference. First operand 18242 states and 56904 transitions. Second operand 3 states. [2019-12-07 11:25:53,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:53,637 INFO L93 Difference]: Finished difference Result 20245 states and 61280 transitions. [2019-12-07 11:25:53,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:25:53,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-07 11:25:53,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:53,658 INFO L225 Difference]: With dead ends: 20245 [2019-12-07 11:25:53,658 INFO L226 Difference]: Without dead ends: 19588 [2019-12-07 11:25:53,658 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:25:53,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19588 states. [2019-12-07 11:25:53,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19588 to 15166. [2019-12-07 11:25:53,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15166 states. [2019-12-07 11:25:53,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15166 states to 15166 states and 46744 transitions. [2019-12-07 11:25:53,907 INFO L78 Accepts]: Start accepts. Automaton has 15166 states and 46744 transitions. Word has length 58 [2019-12-07 11:25:53,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:53,908 INFO L462 AbstractCegarLoop]: Abstraction has 15166 states and 46744 transitions. [2019-12-07 11:25:53,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:25:53,908 INFO L276 IsEmpty]: Start isEmpty. Operand 15166 states and 46744 transitions. [2019-12-07 11:25:53,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 11:25:53,920 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:53,920 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] [2019-12-07 11:25:53,920 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:53,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:53,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1370986964, now seen corresponding path program 5 times [2019-12-07 11:25:53,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:25:53,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502518759] [2019-12-07 11:25:53,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:25:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:25:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:25:54,003 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 11:25:54,004 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:25:54,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= v_~__unbuffered_cnt~0_191 0) (= 0 v_~y$r_buff0_thd2~0_398) (= 0 v_~y$read_delayed_var~0.base_4) (= v_~y$w_buff1_used~0_631 0) (= v_~y$r_buff1_thd0~0_221 0) (= 0 v_~y$read_delayed_var~0.offset_4) (= 0 v_~y$r_buff1_thd2~0_382) (= 0 v_~__unbuffered_p0_EAX~0_56) (< 0 |v_#StackHeapBarrier_22|) (= |v_#NULL.offset_6| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t701~0.base_32|) 0) (= v_~y$r_buff0_thd1~0_46 0) (= 0 v_~y$r_buff0_thd4~0_132) (= 0 v_~__unbuffered_p3_EAX~0_43) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~y$r_buff1_thd4~0_217) (= v_~main$tmp_guard1~0_34 0) (= v_~y$read_delayed~0_6 0) (= |v_#valid_83| (store .cse0 |v_ULTIMATE.start_main_~#t701~0.base_32| 1)) (= 0 v_~__unbuffered_p1_EAX~0_52) (= 0 v_~y$w_buff0~0_506) (= v_~z~0_169 0) (= 0 v_~weak$$choice0~0_18) (= v_~y$w_buff0_used~0_913 0) (= v_~weak$$choice2~0_212 0) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t701~0.base_32| 4) |v_#length_31|) (= 0 v_~y$r_buff0_thd3~0_241) (= 0 |v_#NULL.base_6|) (= 0 v_~y$r_buff1_thd3~0_210) (= v_~y~0_184 0) (= 0 v_~y$flush_delayed~0_45) (= v_~y$mem_tmp~0_20 0) (= |v_ULTIMATE.start_main_~#t701~0.offset_23| 0) (= v_~y$w_buff1~0_341 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t701~0.base_32| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t701~0.base_32|) |v_ULTIMATE.start_main_~#t701~0.offset_23| 0)) |v_#memory_int_25|) (= v_~y$r_buff0_thd0~0_136 0) (= v_~x~0_40 0) (= v_~y$r_buff1_thd1~0_134 0) (= v_~a~0_41 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t701~0.base_32|) (= 0 v_~__unbuffered_p3_EBX~0_43))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_26|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t702~0.base=|v_ULTIMATE.start_main_~#t702~0.base_34|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_75|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_77|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_45|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~a~0=v_~a~0_41, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_56, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_210, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, #length=|v_#length_31|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_27|, ULTIMATE.start_main_~#t701~0.base=|v_ULTIMATE.start_main_~#t701~0.base_32|, ULTIMATE.start_main_~#t701~0.offset=|v_ULTIMATE.start_main_~#t701~0.offset_23|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_217, ~y$w_buff1~0=v_~y$w_buff1~0_341, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_4, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_398, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_191, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_221, ~x~0=v_~x~0_40, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_4, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_913, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_45|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_77|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_134, ~y$w_buff0~0=v_~y$w_buff0~0_506, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_241, ULTIMATE.start_main_~#t704~0.base=|v_ULTIMATE.start_main_~#t704~0.base_19|, ~y~0=v_~y~0_184, ULTIMATE.start_main_~#t702~0.offset=|v_ULTIMATE.start_main_~#t702~0.offset_24|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_43, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t703~0.offset=|v_ULTIMATE.start_main_~#t703~0.offset_16|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_382, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_132, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~#t704~0.offset=|v_ULTIMATE.start_main_~#t704~0.offset_16|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_10|, ~z~0=v_~z~0_169, ~weak$$choice2~0=v_~weak$$choice2~0_212, ULTIMATE.start_main_~#t703~0.base=|v_ULTIMATE.start_main_~#t703~0.base_26|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_631} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t702~0.base, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~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, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t701~0.base, ULTIMATE.start_main_~#t701~0.offset, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t704~0.base, ~y~0, ULTIMATE.start_main_~#t702~0.offset, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_~#t703~0.offset, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t704~0.offset, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t703~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 11:25:54,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L843-1-->L845: Formula: (and (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t702~0.base_13| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t702~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t702~0.base_13|) |v_ULTIMATE.start_main_~#t702~0.offset_11| 1)) |v_#memory_int_17|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t702~0.base_13| 1)) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t702~0.base_13|)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t702~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t702~0.base_13|)) (= |v_ULTIMATE.start_main_~#t702~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t702~0.base=|v_ULTIMATE.start_main_~#t702~0.base_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t702~0.offset=|v_ULTIMATE.start_main_~#t702~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t702~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t702~0.offset] because there is no mapped edge [2019-12-07 11:25:54,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L845-1-->L847: Formula: (and (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t703~0.base_11|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t703~0.base_11|)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t703~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t703~0.offset_9|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t703~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t703~0.base_11|) |v_ULTIMATE.start_main_~#t703~0.offset_9| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t703~0.base_11|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t703~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t703~0.base=|v_ULTIMATE.start_main_~#t703~0.base_11|, ULTIMATE.start_main_~#t703~0.offset=|v_ULTIMATE.start_main_~#t703~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t703~0.base, ULTIMATE.start_main_~#t703~0.offset] because there is no mapped edge [2019-12-07 11:25:54,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L797: Formula: (and (= v_~y$r_buff0_thd3~0_37 v_~y$r_buff1_thd3~0_33) (= v_~y$r_buff0_thd1~0_10 v_~y$r_buff1_thd1~0_10) (= v_~y$r_buff0_thd3~0_36 1) (= v_~y$r_buff0_thd4~0_29 v_~y$r_buff1_thd4~0_26) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_54) (= v_~y$r_buff0_thd0~0_35 v_~y$r_buff1_thd0~0_25) (= v_~z~0_14 1) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_37, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_36, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40, ~z~0=v_~z~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 11:25:54,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L847-1-->L849: Formula: (and (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t704~0.base_9|)) (not (= 0 |v_ULTIMATE.start_main_~#t704~0.base_9|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t704~0.base_9| 4) |v_#length_17|) (= 0 |v_ULTIMATE.start_main_~#t704~0.offset_8|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t704~0.base_9| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t704~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t704~0.base_9|) |v_ULTIMATE.start_main_~#t704~0.offset_8| 3)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t704~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t704~0.base=|v_ULTIMATE.start_main_~#t704~0.base_9|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t704~0.offset=|v_ULTIMATE.start_main_~#t704~0.offset_8|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t704~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t704~0.offset, #length] because there is no mapped edge [2019-12-07 11:25:54,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_27 v_~__unbuffered_p0_EAX~0_27) (= v_~a~0_26 1) (= v_~__unbuffered_cnt~0_118 (+ v_~__unbuffered_cnt~0_119 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_17 |v_P0Thread1of1ForFork1_#in~arg.offset_19|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_17)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_27} OutVars{~a~0=v_~a~0_26, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_27, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_27, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_17} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 11:25:54,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L762-->L762-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1851830422 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out1851830422| |P1Thread1of1ForFork2_#t~ite12_Out1851830422|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1851830422 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In1851830422 256)) (and .cse0 (= (mod ~y$w_buff1_used~0_In1851830422 256) 0)) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1851830422 256))))) .cse1 (= ~y$w_buff1~0_In1851830422 |P1Thread1of1ForFork2_#t~ite11_Out1851830422|)) (and (= |P1Thread1of1ForFork2_#t~ite11_In1851830422| |P1Thread1of1ForFork2_#t~ite11_Out1851830422|) (not .cse1) (= ~y$w_buff1~0_In1851830422 |P1Thread1of1ForFork2_#t~ite12_Out1851830422|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1851830422, ~y$w_buff1~0=~y$w_buff1~0_In1851830422, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1851830422, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1851830422, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In1851830422|, ~weak$$choice2~0=~weak$$choice2~0_In1851830422, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1851830422} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1851830422, ~y$w_buff1~0=~y$w_buff1~0_In1851830422, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1851830422, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1851830422, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1851830422|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1851830422|, ~weak$$choice2~0=~weak$$choice2~0_In1851830422, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1851830422} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 11:25:54,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L763-->L763-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-658878640 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out-658878640| |P1Thread1of1ForFork2_#t~ite15_Out-658878640|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-658878640 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-658878640 256)) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-658878640 256))) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In-658878640 256) 0)))) (= |P1Thread1of1ForFork2_#t~ite14_Out-658878640| ~y$w_buff0_used~0_In-658878640) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite15_Out-658878640| ~y$w_buff0_used~0_In-658878640) (= |P1Thread1of1ForFork2_#t~ite14_In-658878640| |P1Thread1of1ForFork2_#t~ite14_Out-658878640|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-658878640, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-658878640, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-658878640, ~weak$$choice2~0=~weak$$choice2~0_In-658878640, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In-658878640|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-658878640} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-658878640, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-658878640, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-658878640, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-658878640|, ~weak$$choice2~0=~weak$$choice2~0_In-658878640, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out-658878640|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-658878640} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-07 11:25:54,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In1492105421 256) 0)) (.cse4 (= (mod ~weak$$choice2~0_In1492105421 256) 0)) (.cse5 (= |P1Thread1of1ForFork2_#t~ite17_Out1492105421| |P1Thread1of1ForFork2_#t~ite18_Out1492105421|)) (.cse3 (= (mod ~y$w_buff1_used~0_In1492105421 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1492105421 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1492105421 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite16_In1492105421| |P1Thread1of1ForFork2_#t~ite16_Out1492105421|) (or (and (or (and .cse0 .cse1) .cse2 (and .cse1 .cse3)) .cse4 .cse5 (= ~y$w_buff1_used~0_In1492105421 |P1Thread1of1ForFork2_#t~ite17_Out1492105421|)) (and (not .cse4) (= ~y$w_buff1_used~0_In1492105421 |P1Thread1of1ForFork2_#t~ite18_Out1492105421|) (= |P1Thread1of1ForFork2_#t~ite17_Out1492105421| |P1Thread1of1ForFork2_#t~ite17_In1492105421|)))) (let ((.cse6 (not .cse1))) (and (= 0 |P1Thread1of1ForFork2_#t~ite16_Out1492105421|) (or .cse6 (not .cse0)) .cse4 .cse5 (= |P1Thread1of1ForFork2_#t~ite17_Out1492105421| |P1Thread1of1ForFork2_#t~ite16_Out1492105421|) (or .cse6 (not .cse3)) (not .cse2))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1492105421, P1Thread1of1ForFork2_#t~ite17=|P1Thread1of1ForFork2_#t~ite17_In1492105421|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1492105421, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1492105421, ~weak$$choice2~0=~weak$$choice2~0_In1492105421, P1Thread1of1ForFork2_#t~ite16=|P1Thread1of1ForFork2_#t~ite16_In1492105421|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1492105421} OutVars{P1Thread1of1ForFork2_#t~ite18=|P1Thread1of1ForFork2_#t~ite18_Out1492105421|, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1492105421, P1Thread1of1ForFork2_#t~ite17=|P1Thread1of1ForFork2_#t~ite17_Out1492105421|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1492105421, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1492105421, ~weak$$choice2~0=~weak$$choice2~0_In1492105421, P1Thread1of1ForFork2_#t~ite16=|P1Thread1of1ForFork2_#t~ite16_Out1492105421|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1492105421} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite18, P1Thread1of1ForFork2_#t~ite17, P1Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-07 11:25:54,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L764-8-->L766: Formula: (and (= v_~y$r_buff0_thd2~0_378 v_~y$r_buff0_thd2~0_377) (= v_~y$w_buff1_used~0_614 |v_P1Thread1of1ForFork2_#t~ite18_31|) (not (= 0 (mod v_~weak$$choice2~0_200 256)))) InVars {P1Thread1of1ForFork2_#t~ite18=|v_P1Thread1of1ForFork2_#t~ite18_31|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_378, ~weak$$choice2~0=v_~weak$$choice2~0_200} OutVars{P1Thread1of1ForFork2_#t~ite18=|v_P1Thread1of1ForFork2_#t~ite18_30|, P1Thread1of1ForFork2_#t~ite17=|v_P1Thread1of1ForFork2_#t~ite17_28|, P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_23|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_377, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_35|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_13|, ~weak$$choice2~0=v_~weak$$choice2~0_200, P1Thread1of1ForFork2_#t~ite16=|v_P1Thread1of1ForFork2_#t~ite16_28|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_614} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite18, P1Thread1of1ForFork2_#t~ite17, P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21, P1Thread1of1ForFork2_#t~ite16, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 11:25:54,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L766-->L766-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In333048851 256) 0))) (or (and .cse0 (= ~y$r_buff1_thd2~0_In333048851 |P1Thread1of1ForFork2_#t~ite23_Out333048851|) (= |P1Thread1of1ForFork2_#t~ite24_Out333048851| |P1Thread1of1ForFork2_#t~ite23_Out333048851|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In333048851 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In333048851 256))) (= 0 (mod ~y$w_buff0_used~0_In333048851 256)) (and (= 0 (mod ~y$r_buff1_thd2~0_In333048851 256)) .cse1)))) (and (= ~y$r_buff1_thd2~0_In333048851 |P1Thread1of1ForFork2_#t~ite24_Out333048851|) (= |P1Thread1of1ForFork2_#t~ite23_In333048851| |P1Thread1of1ForFork2_#t~ite23_Out333048851|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In333048851, ~y$w_buff0_used~0=~y$w_buff0_used~0_In333048851, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In333048851, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In333048851|, ~weak$$choice2~0=~weak$$choice2~0_In333048851, ~y$w_buff1_used~0=~y$w_buff1_used~0_In333048851} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In333048851, ~y$w_buff0_used~0=~y$w_buff0_used~0_In333048851, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In333048851, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out333048851|, ~weak$$choice2~0=~weak$$choice2~0_In333048851, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out333048851|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In333048851} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 11:25:54,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L768-->L776: Formula: (and (= v_~y~0_60 v_~y$mem_tmp~0_11) (= 0 v_~y$flush_delayed~0_15) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (not (= 0 (mod v_~y$flush_delayed~0_16 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~y~0=v_~y~0_60, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_9|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 11:25:54,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L820-2-->L820-5: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In1484602651 256))) (.cse0 (= |P3Thread1of1ForFork0_#t~ite32_Out1484602651| |P3Thread1of1ForFork0_#t~ite33_Out1484602651|)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1484602651 256)))) (or (and .cse0 (or .cse1 .cse2) (= |P3Thread1of1ForFork0_#t~ite32_Out1484602651| ~y~0_In1484602651)) (and (not .cse2) .cse0 (not .cse1) (= |P3Thread1of1ForFork0_#t~ite32_Out1484602651| ~y$w_buff1~0_In1484602651)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1484602651, ~y$w_buff1~0=~y$w_buff1~0_In1484602651, ~y~0=~y~0_In1484602651, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1484602651} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1484602651, ~y$w_buff1~0=~y$w_buff1~0_In1484602651, ~y~0=~y~0_In1484602651, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out1484602651|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out1484602651|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1484602651} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-07 11:25:54,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In22202349 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In22202349 256)))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork0_#t~ite34_Out22202349|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In22202349 |P3Thread1of1ForFork0_#t~ite34_Out22202349|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In22202349, ~y$w_buff0_used~0=~y$w_buff0_used~0_In22202349} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In22202349, ~y$w_buff0_used~0=~y$w_buff0_used~0_In22202349, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out22202349|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-07 11:25:54,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L822-->L822-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In398745964 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd4~0_In398745964 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In398745964 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd4~0_In398745964 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In398745964 |P3Thread1of1ForFork0_#t~ite35_Out398745964|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P3Thread1of1ForFork0_#t~ite35_Out398745964|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In398745964, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In398745964, ~y$w_buff0_used~0=~y$w_buff0_used~0_In398745964, ~y$w_buff1_used~0=~y$w_buff1_used~0_In398745964} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In398745964, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In398745964, ~y$w_buff0_used~0=~y$w_buff0_used~0_In398745964, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out398745964|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In398745964} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-07 11:25:54,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In-645351022 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-645351022 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite36_Out-645351022| ~y$r_buff0_thd4~0_In-645351022)) (and (not .cse1) (not .cse0) (= 0 |P3Thread1of1ForFork0_#t~ite36_Out-645351022|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-645351022, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-645351022} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-645351022, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-645351022, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-645351022|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-07 11:25:54,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In908748135 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In908748135 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In908748135 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In908748135 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork0_#t~ite37_Out908748135| 0)) (and (or .cse0 .cse1) (= ~y$r_buff1_thd4~0_In908748135 |P3Thread1of1ForFork0_#t~ite37_Out908748135|) (or .cse3 .cse2)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In908748135, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In908748135, ~y$w_buff0_used~0=~y$w_buff0_used~0_In908748135, ~y$w_buff1_used~0=~y$w_buff1_used~0_In908748135} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In908748135, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In908748135, ~y$w_buff0_used~0=~y$w_buff0_used~0_In908748135, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out908748135|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In908748135} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-07 11:25:54,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L824-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_130 (+ v_~__unbuffered_cnt~0_131 1)) (= |v_P3Thread1of1ForFork0_#t~ite37_52| v_~y$r_buff1_thd4~0_148) (= |v_P3Thread1of1ForFork0_#res.base_3| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_3|)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_148, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_3|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_51|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_130} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 11:25:54,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-405469233 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-405469233 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork3_#t~ite28_Out-405469233|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-405469233 |P2Thread1of1ForFork3_#t~ite28_Out-405469233|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-405469233, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-405469233} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-405469233, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-405469233, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-405469233|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-07 11:25:54,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L799-->L799-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd3~0_In1885753882 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1885753882 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd3~0_In1885753882 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1885753882 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork3_#t~ite29_Out1885753882| 0)) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork3_#t~ite29_Out1885753882| ~y$w_buff1_used~0_In1885753882) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1885753882, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1885753882, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1885753882, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1885753882} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1885753882, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1885753882, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1885753882, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out1885753882|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1885753882} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-07 11:25:54,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L800-->L801: Formula: (let ((.cse1 (= ~y$r_buff0_thd3~0_In218642557 ~y$r_buff0_thd3~0_Out218642557)) (.cse0 (= (mod ~y$w_buff0_used~0_In218642557 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In218642557 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= ~y$r_buff0_thd3~0_Out218642557 0) (not .cse0) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In218642557, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In218642557} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out218642557|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In218642557, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out218642557} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 11:25:54,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1500091116 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-1500091116 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-1500091116 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1500091116 256)))) (or (and (= |P2Thread1of1ForFork3_#t~ite31_Out-1500091116| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork3_#t~ite31_Out-1500091116| ~y$r_buff1_thd3~0_In-1500091116) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1500091116, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1500091116, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1500091116, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1500091116} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1500091116, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1500091116, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1500091116, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-1500091116|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1500091116} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-07 11:25:54,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork3_#res.base_3|) (= |v_P2Thread1of1ForFork3_#res.offset_3| 0) (= |v_P2Thread1of1ForFork3_#t~ite31_46| v_~y$r_buff1_thd3~0_83) (= v_~__unbuffered_cnt~0_104 (+ v_~__unbuffered_cnt~0_105 1))) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_83, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_104, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_3|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 11:25:54,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L849-1-->L855: Formula: (and (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_15) 1 0)) 0 1)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 11:25:54,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L855-2-->L855-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-1052821519 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1052821519 256) 0))) (or (and (= ~y$w_buff1~0_In-1052821519 |ULTIMATE.start_main_#t~ite42_Out-1052821519|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In-1052821519 |ULTIMATE.start_main_#t~ite42_Out-1052821519|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1052821519, ~y~0=~y~0_In-1052821519, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1052821519, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1052821519} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1052821519, ~y~0=~y~0_In-1052821519, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1052821519|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1052821519, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1052821519} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 11:25:54,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L855-4-->L856: Formula: (= v_~y~0_21 |v_ULTIMATE.start_main_#t~ite42_12|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_17|, ~y~0=v_~y~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 11:25:54,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L856-->L856-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1135078191 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1135078191 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1135078191| ~y$w_buff0_used~0_In-1135078191) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-1135078191|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1135078191, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1135078191} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1135078191, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1135078191, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1135078191|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 11:25:54,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L857-->L857-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1327560572 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1327560572 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1327560572 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1327560572 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1327560572 |ULTIMATE.start_main_#t~ite45_Out1327560572|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out1327560572|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1327560572, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1327560572, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1327560572, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1327560572} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1327560572, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1327560572, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1327560572, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1327560572|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1327560572} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 11:25:54,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L858-->L858-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1816394258 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1816394258 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite46_Out1816394258|) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In1816394258 |ULTIMATE.start_main_#t~ite46_Out1816394258|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1816394258, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1816394258} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1816394258, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1816394258, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1816394258|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 11:25:54,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L859-->L859-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1402410507 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1402410507 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1402410507 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1402410507 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-1402410507| ~y$r_buff1_thd0~0_In-1402410507) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite47_Out-1402410507| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1402410507, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1402410507, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1402410507, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1402410507} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1402410507, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1402410507, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1402410507|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1402410507, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1402410507} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 11:25:54,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= v_~z~0_155 2) (= 0 v_~__unbuffered_p0_EAX~0_46) (= 2 v_~__unbuffered_p3_EAX~0_33) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~__unbuffered_p3_EBX~0_33))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_24) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_207 |v_ULTIMATE.start_main_#t~ite47_57|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_24 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_57|, ~z~0=v_~z~0_155, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_33} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_56|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~z~0=v_~z~0_155, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_207, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:25:54,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:25:54 BasicIcfg [2019-12-07 11:25:54,072 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:25:54,072 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:25:54,073 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:25:54,073 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:25:54,073 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:23:00" (3/4) ... [2019-12-07 11:25:54,075 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:25:54,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= v_~__unbuffered_cnt~0_191 0) (= 0 v_~y$r_buff0_thd2~0_398) (= 0 v_~y$read_delayed_var~0.base_4) (= v_~y$w_buff1_used~0_631 0) (= v_~y$r_buff1_thd0~0_221 0) (= 0 v_~y$read_delayed_var~0.offset_4) (= 0 v_~y$r_buff1_thd2~0_382) (= 0 v_~__unbuffered_p0_EAX~0_56) (< 0 |v_#StackHeapBarrier_22|) (= |v_#NULL.offset_6| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t701~0.base_32|) 0) (= v_~y$r_buff0_thd1~0_46 0) (= 0 v_~y$r_buff0_thd4~0_132) (= 0 v_~__unbuffered_p3_EAX~0_43) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~y$r_buff1_thd4~0_217) (= v_~main$tmp_guard1~0_34 0) (= v_~y$read_delayed~0_6 0) (= |v_#valid_83| (store .cse0 |v_ULTIMATE.start_main_~#t701~0.base_32| 1)) (= 0 v_~__unbuffered_p1_EAX~0_52) (= 0 v_~y$w_buff0~0_506) (= v_~z~0_169 0) (= 0 v_~weak$$choice0~0_18) (= v_~y$w_buff0_used~0_913 0) (= v_~weak$$choice2~0_212 0) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t701~0.base_32| 4) |v_#length_31|) (= 0 v_~y$r_buff0_thd3~0_241) (= 0 |v_#NULL.base_6|) (= 0 v_~y$r_buff1_thd3~0_210) (= v_~y~0_184 0) (= 0 v_~y$flush_delayed~0_45) (= v_~y$mem_tmp~0_20 0) (= |v_ULTIMATE.start_main_~#t701~0.offset_23| 0) (= v_~y$w_buff1~0_341 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t701~0.base_32| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t701~0.base_32|) |v_ULTIMATE.start_main_~#t701~0.offset_23| 0)) |v_#memory_int_25|) (= v_~y$r_buff0_thd0~0_136 0) (= v_~x~0_40 0) (= v_~y$r_buff1_thd1~0_134 0) (= v_~a~0_41 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t701~0.base_32|) (= 0 v_~__unbuffered_p3_EBX~0_43))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_26|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t702~0.base=|v_ULTIMATE.start_main_~#t702~0.base_34|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_75|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_77|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_45|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~a~0=v_~a~0_41, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_56, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_210, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, #length=|v_#length_31|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_27|, ULTIMATE.start_main_~#t701~0.base=|v_ULTIMATE.start_main_~#t701~0.base_32|, ULTIMATE.start_main_~#t701~0.offset=|v_ULTIMATE.start_main_~#t701~0.offset_23|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_217, ~y$w_buff1~0=v_~y$w_buff1~0_341, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_4, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_398, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_191, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_221, ~x~0=v_~x~0_40, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_4, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_913, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_45|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_77|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_134, ~y$w_buff0~0=v_~y$w_buff0~0_506, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_241, ULTIMATE.start_main_~#t704~0.base=|v_ULTIMATE.start_main_~#t704~0.base_19|, ~y~0=v_~y~0_184, ULTIMATE.start_main_~#t702~0.offset=|v_ULTIMATE.start_main_~#t702~0.offset_24|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_43, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t703~0.offset=|v_ULTIMATE.start_main_~#t703~0.offset_16|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_382, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_132, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~#t704~0.offset=|v_ULTIMATE.start_main_~#t704~0.offset_16|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_10|, ~z~0=v_~z~0_169, ~weak$$choice2~0=v_~weak$$choice2~0_212, ULTIMATE.start_main_~#t703~0.base=|v_ULTIMATE.start_main_~#t703~0.base_26|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_631} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t702~0.base, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~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, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t701~0.base, ULTIMATE.start_main_~#t701~0.offset, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t704~0.base, ~y~0, ULTIMATE.start_main_~#t702~0.offset, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_~#t703~0.offset, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t704~0.offset, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t703~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 11:25:54,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L843-1-->L845: Formula: (and (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t702~0.base_13| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t702~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t702~0.base_13|) |v_ULTIMATE.start_main_~#t702~0.offset_11| 1)) |v_#memory_int_17|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t702~0.base_13| 1)) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t702~0.base_13|)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t702~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t702~0.base_13|)) (= |v_ULTIMATE.start_main_~#t702~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t702~0.base=|v_ULTIMATE.start_main_~#t702~0.base_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t702~0.offset=|v_ULTIMATE.start_main_~#t702~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t702~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t702~0.offset] because there is no mapped edge [2019-12-07 11:25:54,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L845-1-->L847: Formula: (and (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t703~0.base_11|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t703~0.base_11|)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t703~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t703~0.offset_9|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t703~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t703~0.base_11|) |v_ULTIMATE.start_main_~#t703~0.offset_9| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t703~0.base_11|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t703~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t703~0.base=|v_ULTIMATE.start_main_~#t703~0.base_11|, ULTIMATE.start_main_~#t703~0.offset=|v_ULTIMATE.start_main_~#t703~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t703~0.base, ULTIMATE.start_main_~#t703~0.offset] because there is no mapped edge [2019-12-07 11:25:54,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L797: Formula: (and (= v_~y$r_buff0_thd3~0_37 v_~y$r_buff1_thd3~0_33) (= v_~y$r_buff0_thd1~0_10 v_~y$r_buff1_thd1~0_10) (= v_~y$r_buff0_thd3~0_36 1) (= v_~y$r_buff0_thd4~0_29 v_~y$r_buff1_thd4~0_26) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_54) (= v_~y$r_buff0_thd0~0_35 v_~y$r_buff1_thd0~0_25) (= v_~z~0_14 1) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_37, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_36, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40, ~z~0=v_~z~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 11:25:54,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L847-1-->L849: Formula: (and (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t704~0.base_9|)) (not (= 0 |v_ULTIMATE.start_main_~#t704~0.base_9|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t704~0.base_9| 4) |v_#length_17|) (= 0 |v_ULTIMATE.start_main_~#t704~0.offset_8|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t704~0.base_9| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t704~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t704~0.base_9|) |v_ULTIMATE.start_main_~#t704~0.offset_8| 3)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t704~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t704~0.base=|v_ULTIMATE.start_main_~#t704~0.base_9|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t704~0.offset=|v_ULTIMATE.start_main_~#t704~0.offset_8|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t704~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t704~0.offset, #length] because there is no mapped edge [2019-12-07 11:25:54,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_27 v_~__unbuffered_p0_EAX~0_27) (= v_~a~0_26 1) (= v_~__unbuffered_cnt~0_118 (+ v_~__unbuffered_cnt~0_119 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_17 |v_P0Thread1of1ForFork1_#in~arg.offset_19|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_17)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_27} OutVars{~a~0=v_~a~0_26, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_27, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_27, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_17} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 11:25:54,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L762-->L762-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1851830422 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out1851830422| |P1Thread1of1ForFork2_#t~ite12_Out1851830422|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1851830422 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In1851830422 256)) (and .cse0 (= (mod ~y$w_buff1_used~0_In1851830422 256) 0)) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1851830422 256))))) .cse1 (= ~y$w_buff1~0_In1851830422 |P1Thread1of1ForFork2_#t~ite11_Out1851830422|)) (and (= |P1Thread1of1ForFork2_#t~ite11_In1851830422| |P1Thread1of1ForFork2_#t~ite11_Out1851830422|) (not .cse1) (= ~y$w_buff1~0_In1851830422 |P1Thread1of1ForFork2_#t~ite12_Out1851830422|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1851830422, ~y$w_buff1~0=~y$w_buff1~0_In1851830422, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1851830422, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1851830422, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In1851830422|, ~weak$$choice2~0=~weak$$choice2~0_In1851830422, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1851830422} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1851830422, ~y$w_buff1~0=~y$w_buff1~0_In1851830422, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1851830422, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1851830422, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1851830422|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1851830422|, ~weak$$choice2~0=~weak$$choice2~0_In1851830422, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1851830422} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 11:25:54,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L763-->L763-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-658878640 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out-658878640| |P1Thread1of1ForFork2_#t~ite15_Out-658878640|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-658878640 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-658878640 256)) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-658878640 256))) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In-658878640 256) 0)))) (= |P1Thread1of1ForFork2_#t~ite14_Out-658878640| ~y$w_buff0_used~0_In-658878640) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite15_Out-658878640| ~y$w_buff0_used~0_In-658878640) (= |P1Thread1of1ForFork2_#t~ite14_In-658878640| |P1Thread1of1ForFork2_#t~ite14_Out-658878640|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-658878640, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-658878640, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-658878640, ~weak$$choice2~0=~weak$$choice2~0_In-658878640, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In-658878640|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-658878640} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-658878640, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-658878640, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-658878640, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-658878640|, ~weak$$choice2~0=~weak$$choice2~0_In-658878640, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out-658878640|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-658878640} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-07 11:25:54,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In1492105421 256) 0)) (.cse4 (= (mod ~weak$$choice2~0_In1492105421 256) 0)) (.cse5 (= |P1Thread1of1ForFork2_#t~ite17_Out1492105421| |P1Thread1of1ForFork2_#t~ite18_Out1492105421|)) (.cse3 (= (mod ~y$w_buff1_used~0_In1492105421 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1492105421 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1492105421 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite16_In1492105421| |P1Thread1of1ForFork2_#t~ite16_Out1492105421|) (or (and (or (and .cse0 .cse1) .cse2 (and .cse1 .cse3)) .cse4 .cse5 (= ~y$w_buff1_used~0_In1492105421 |P1Thread1of1ForFork2_#t~ite17_Out1492105421|)) (and (not .cse4) (= ~y$w_buff1_used~0_In1492105421 |P1Thread1of1ForFork2_#t~ite18_Out1492105421|) (= |P1Thread1of1ForFork2_#t~ite17_Out1492105421| |P1Thread1of1ForFork2_#t~ite17_In1492105421|)))) (let ((.cse6 (not .cse1))) (and (= 0 |P1Thread1of1ForFork2_#t~ite16_Out1492105421|) (or .cse6 (not .cse0)) .cse4 .cse5 (= |P1Thread1of1ForFork2_#t~ite17_Out1492105421| |P1Thread1of1ForFork2_#t~ite16_Out1492105421|) (or .cse6 (not .cse3)) (not .cse2))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1492105421, P1Thread1of1ForFork2_#t~ite17=|P1Thread1of1ForFork2_#t~ite17_In1492105421|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1492105421, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1492105421, ~weak$$choice2~0=~weak$$choice2~0_In1492105421, P1Thread1of1ForFork2_#t~ite16=|P1Thread1of1ForFork2_#t~ite16_In1492105421|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1492105421} OutVars{P1Thread1of1ForFork2_#t~ite18=|P1Thread1of1ForFork2_#t~ite18_Out1492105421|, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1492105421, P1Thread1of1ForFork2_#t~ite17=|P1Thread1of1ForFork2_#t~ite17_Out1492105421|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1492105421, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1492105421, ~weak$$choice2~0=~weak$$choice2~0_In1492105421, P1Thread1of1ForFork2_#t~ite16=|P1Thread1of1ForFork2_#t~ite16_Out1492105421|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1492105421} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite18, P1Thread1of1ForFork2_#t~ite17, P1Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-07 11:25:54,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L764-8-->L766: Formula: (and (= v_~y$r_buff0_thd2~0_378 v_~y$r_buff0_thd2~0_377) (= v_~y$w_buff1_used~0_614 |v_P1Thread1of1ForFork2_#t~ite18_31|) (not (= 0 (mod v_~weak$$choice2~0_200 256)))) InVars {P1Thread1of1ForFork2_#t~ite18=|v_P1Thread1of1ForFork2_#t~ite18_31|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_378, ~weak$$choice2~0=v_~weak$$choice2~0_200} OutVars{P1Thread1of1ForFork2_#t~ite18=|v_P1Thread1of1ForFork2_#t~ite18_30|, P1Thread1of1ForFork2_#t~ite17=|v_P1Thread1of1ForFork2_#t~ite17_28|, P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_23|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_377, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_35|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_13|, ~weak$$choice2~0=v_~weak$$choice2~0_200, P1Thread1of1ForFork2_#t~ite16=|v_P1Thread1of1ForFork2_#t~ite16_28|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_614} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite18, P1Thread1of1ForFork2_#t~ite17, P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21, P1Thread1of1ForFork2_#t~ite16, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 11:25:54,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L766-->L766-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In333048851 256) 0))) (or (and .cse0 (= ~y$r_buff1_thd2~0_In333048851 |P1Thread1of1ForFork2_#t~ite23_Out333048851|) (= |P1Thread1of1ForFork2_#t~ite24_Out333048851| |P1Thread1of1ForFork2_#t~ite23_Out333048851|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In333048851 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In333048851 256))) (= 0 (mod ~y$w_buff0_used~0_In333048851 256)) (and (= 0 (mod ~y$r_buff1_thd2~0_In333048851 256)) .cse1)))) (and (= ~y$r_buff1_thd2~0_In333048851 |P1Thread1of1ForFork2_#t~ite24_Out333048851|) (= |P1Thread1of1ForFork2_#t~ite23_In333048851| |P1Thread1of1ForFork2_#t~ite23_Out333048851|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In333048851, ~y$w_buff0_used~0=~y$w_buff0_used~0_In333048851, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In333048851, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In333048851|, ~weak$$choice2~0=~weak$$choice2~0_In333048851, ~y$w_buff1_used~0=~y$w_buff1_used~0_In333048851} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In333048851, ~y$w_buff0_used~0=~y$w_buff0_used~0_In333048851, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In333048851, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out333048851|, ~weak$$choice2~0=~weak$$choice2~0_In333048851, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out333048851|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In333048851} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 11:25:54,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L768-->L776: Formula: (and (= v_~y~0_60 v_~y$mem_tmp~0_11) (= 0 v_~y$flush_delayed~0_15) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (not (= 0 (mod v_~y$flush_delayed~0_16 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~y~0=v_~y~0_60, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_9|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 11:25:54,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L820-2-->L820-5: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In1484602651 256))) (.cse0 (= |P3Thread1of1ForFork0_#t~ite32_Out1484602651| |P3Thread1of1ForFork0_#t~ite33_Out1484602651|)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1484602651 256)))) (or (and .cse0 (or .cse1 .cse2) (= |P3Thread1of1ForFork0_#t~ite32_Out1484602651| ~y~0_In1484602651)) (and (not .cse2) .cse0 (not .cse1) (= |P3Thread1of1ForFork0_#t~ite32_Out1484602651| ~y$w_buff1~0_In1484602651)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1484602651, ~y$w_buff1~0=~y$w_buff1~0_In1484602651, ~y~0=~y~0_In1484602651, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1484602651} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1484602651, ~y$w_buff1~0=~y$w_buff1~0_In1484602651, ~y~0=~y~0_In1484602651, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out1484602651|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out1484602651|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1484602651} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-07 11:25:54,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In22202349 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In22202349 256)))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork0_#t~ite34_Out22202349|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In22202349 |P3Thread1of1ForFork0_#t~ite34_Out22202349|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In22202349, ~y$w_buff0_used~0=~y$w_buff0_used~0_In22202349} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In22202349, ~y$w_buff0_used~0=~y$w_buff0_used~0_In22202349, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out22202349|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-07 11:25:54,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L822-->L822-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In398745964 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd4~0_In398745964 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In398745964 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd4~0_In398745964 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In398745964 |P3Thread1of1ForFork0_#t~ite35_Out398745964|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P3Thread1of1ForFork0_#t~ite35_Out398745964|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In398745964, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In398745964, ~y$w_buff0_used~0=~y$w_buff0_used~0_In398745964, ~y$w_buff1_used~0=~y$w_buff1_used~0_In398745964} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In398745964, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In398745964, ~y$w_buff0_used~0=~y$w_buff0_used~0_In398745964, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out398745964|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In398745964} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-07 11:25:54,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In-645351022 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-645351022 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite36_Out-645351022| ~y$r_buff0_thd4~0_In-645351022)) (and (not .cse1) (not .cse0) (= 0 |P3Thread1of1ForFork0_#t~ite36_Out-645351022|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-645351022, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-645351022} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-645351022, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-645351022, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-645351022|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-07 11:25:54,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In908748135 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In908748135 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In908748135 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In908748135 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork0_#t~ite37_Out908748135| 0)) (and (or .cse0 .cse1) (= ~y$r_buff1_thd4~0_In908748135 |P3Thread1of1ForFork0_#t~ite37_Out908748135|) (or .cse3 .cse2)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In908748135, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In908748135, ~y$w_buff0_used~0=~y$w_buff0_used~0_In908748135, ~y$w_buff1_used~0=~y$w_buff1_used~0_In908748135} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In908748135, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In908748135, ~y$w_buff0_used~0=~y$w_buff0_used~0_In908748135, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out908748135|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In908748135} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-07 11:25:54,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L824-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_130 (+ v_~__unbuffered_cnt~0_131 1)) (= |v_P3Thread1of1ForFork0_#t~ite37_52| v_~y$r_buff1_thd4~0_148) (= |v_P3Thread1of1ForFork0_#res.base_3| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_3|)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_148, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_3|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_51|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_130} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 11:25:54,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-405469233 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-405469233 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork3_#t~ite28_Out-405469233|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-405469233 |P2Thread1of1ForFork3_#t~ite28_Out-405469233|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-405469233, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-405469233} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-405469233, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-405469233, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-405469233|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-07 11:25:54,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L799-->L799-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd3~0_In1885753882 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1885753882 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd3~0_In1885753882 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1885753882 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork3_#t~ite29_Out1885753882| 0)) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork3_#t~ite29_Out1885753882| ~y$w_buff1_used~0_In1885753882) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1885753882, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1885753882, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1885753882, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1885753882} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1885753882, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1885753882, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1885753882, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out1885753882|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1885753882} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-07 11:25:54,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L800-->L801: Formula: (let ((.cse1 (= ~y$r_buff0_thd3~0_In218642557 ~y$r_buff0_thd3~0_Out218642557)) (.cse0 (= (mod ~y$w_buff0_used~0_In218642557 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In218642557 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= ~y$r_buff0_thd3~0_Out218642557 0) (not .cse0) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In218642557, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In218642557} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out218642557|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In218642557, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out218642557} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 11:25:54,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1500091116 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-1500091116 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-1500091116 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1500091116 256)))) (or (and (= |P2Thread1of1ForFork3_#t~ite31_Out-1500091116| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork3_#t~ite31_Out-1500091116| ~y$r_buff1_thd3~0_In-1500091116) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1500091116, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1500091116, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1500091116, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1500091116} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1500091116, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1500091116, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1500091116, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-1500091116|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1500091116} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-07 11:25:54,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork3_#res.base_3|) (= |v_P2Thread1of1ForFork3_#res.offset_3| 0) (= |v_P2Thread1of1ForFork3_#t~ite31_46| v_~y$r_buff1_thd3~0_83) (= v_~__unbuffered_cnt~0_104 (+ v_~__unbuffered_cnt~0_105 1))) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_83, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_104, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_3|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 11:25:54,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L849-1-->L855: Formula: (and (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_15) 1 0)) 0 1)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 11:25:54,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L855-2-->L855-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-1052821519 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1052821519 256) 0))) (or (and (= ~y$w_buff1~0_In-1052821519 |ULTIMATE.start_main_#t~ite42_Out-1052821519|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In-1052821519 |ULTIMATE.start_main_#t~ite42_Out-1052821519|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1052821519, ~y~0=~y~0_In-1052821519, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1052821519, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1052821519} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1052821519, ~y~0=~y~0_In-1052821519, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1052821519|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1052821519, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1052821519} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 11:25:54,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L855-4-->L856: Formula: (= v_~y~0_21 |v_ULTIMATE.start_main_#t~ite42_12|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_17|, ~y~0=v_~y~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 11:25:54,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L856-->L856-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1135078191 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1135078191 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1135078191| ~y$w_buff0_used~0_In-1135078191) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-1135078191|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1135078191, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1135078191} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1135078191, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1135078191, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1135078191|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 11:25:54,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L857-->L857-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1327560572 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1327560572 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1327560572 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1327560572 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1327560572 |ULTIMATE.start_main_#t~ite45_Out1327560572|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out1327560572|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1327560572, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1327560572, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1327560572, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1327560572} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1327560572, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1327560572, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1327560572, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1327560572|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1327560572} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 11:25:54,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L858-->L858-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1816394258 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1816394258 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite46_Out1816394258|) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In1816394258 |ULTIMATE.start_main_#t~ite46_Out1816394258|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1816394258, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1816394258} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1816394258, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1816394258, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1816394258|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 11:25:54,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L859-->L859-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1402410507 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1402410507 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1402410507 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1402410507 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-1402410507| ~y$r_buff1_thd0~0_In-1402410507) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite47_Out-1402410507| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1402410507, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1402410507, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1402410507, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1402410507} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1402410507, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1402410507, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1402410507|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1402410507, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1402410507} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 11:25:54,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= v_~z~0_155 2) (= 0 v_~__unbuffered_p0_EAX~0_46) (= 2 v_~__unbuffered_p3_EAX~0_33) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~__unbuffered_p3_EBX~0_33))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_24) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_207 |v_ULTIMATE.start_main_#t~ite47_57|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_24 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_57|, ~z~0=v_~z~0_155, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_33} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_56|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~z~0=v_~z~0_155, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_207, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:25:54,139 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8c045482-0608-44cf-94a2-b4e1f5670904/bin/utaipan/witness.graphml [2019-12-07 11:25:54,139 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:25:54,140 INFO L168 Benchmark]: Toolchain (without parser) took 174239.37 ms. Allocated memory was 1.0 GB in the beginning and 9.5 GB in the end (delta: 8.4 GB). Free memory was 934.4 MB in the beginning and 5.7 GB in the end (delta: -4.8 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2019-12-07 11:25:54,141 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:25:54,141 INFO L168 Benchmark]: CACSL2BoogieTranslator took 385.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.5 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -118.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:25:54,141 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.73 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 11:25:54,141 INFO L168 Benchmark]: Boogie Preprocessor took 25.43 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:25:54,142 INFO L168 Benchmark]: RCFGBuilder took 421.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 993.6 MB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:25:54,142 INFO L168 Benchmark]: TraceAbstraction took 173298.49 ms. Allocated memory was 1.1 GB in the beginning and 9.5 GB in the end (delta: 8.3 GB). Free memory was 993.6 MB in the beginning and 5.7 GB in the end (delta: -4.7 GB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. [2019-12-07 11:25:54,142 INFO L168 Benchmark]: Witness Printer took 66.89 ms. Allocated memory is still 9.5 GB. Free memory was 5.7 GB in the beginning and 5.7 GB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:25:54,144 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 385.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.5 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -118.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.73 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. * Boogie Preprocessor took 25.43 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 421.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 993.6 MB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 173298.49 ms. Allocated memory was 1.1 GB in the beginning and 9.5 GB in the end (delta: 8.3 GB). Free memory was 993.6 MB in the beginning and 5.7 GB in the end (delta: -4.7 GB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. * Witness Printer took 66.89 ms. Allocated memory is still 9.5 GB. Free memory was 5.7 GB in the beginning and 5.7 GB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 181 ProgramPointsBefore, 87 ProgramPointsAfterwards, 209 TransitionsBefore, 92 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 28 ChoiceCompositions, 7916 VarBasedMoverChecksPositive, 275 VarBasedMoverChecksNegative, 100 SemBasedMoverChecksPositive, 248 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 66604 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t701, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L845] FCALL, FORK 0 pthread_create(&t702, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L847] FCALL, FORK 0 pthread_create(&t703, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L781] 3 y$w_buff1 = y$w_buff0 [L782] 3 y$w_buff0 = 1 [L783] 3 y$w_buff1_used = y$w_buff0_used [L784] 3 y$w_buff0_used = (_Bool)1 [L849] FCALL, FORK 0 pthread_create(&t704, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 4 z = 2 [L814] 4 __unbuffered_p3_EAX = z [L817] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 2 x = 1 [L756] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 2 y$flush_delayed = weak$$choice2 [L759] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] EXPR 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 [!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)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 2 y = !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) [L761] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, 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))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 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)) [L762] 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)) [L763] 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)) [L766] 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)) [L767] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L821] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L822] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L823] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=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) [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 [L855] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, 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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 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 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 173.1s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 29.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3866 SDtfs, 5245 SDslu, 7822 SDs, 0 SdLazy, 5225 SolverSat, 259 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 37 SyntacticMatches, 11 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=261640occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 111.9s AutomataMinimizationTime, 23 MinimizatonAttempts, 406716 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 845 NumberOfCodeBlocks, 845 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 764 ConstructedInterpolants, 0 QuantifiedInterpolants, 172388 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...