./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix054_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b93626b8-376a-44ae-ac0b-81bc5548bf4e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b93626b8-376a-44ae-ac0b-81bc5548bf4e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b93626b8-376a-44ae-ac0b-81bc5548bf4e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b93626b8-376a-44ae-ac0b-81bc5548bf4e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix054_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b93626b8-376a-44ae-ac0b-81bc5548bf4e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b93626b8-376a-44ae-ac0b-81bc5548bf4e/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf2cd00fabce720f4c3f98371101c93927116a53 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 17:29:18,120 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:29:18,121 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:29:18,129 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:29:18,129 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:29:18,130 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:29:18,131 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:29:18,132 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:29:18,133 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:29:18,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:29:18,135 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:29:18,135 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:29:18,136 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:29:18,136 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:29:18,137 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:29:18,138 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:29:18,138 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:29:18,139 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:29:18,140 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:29:18,142 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:29:18,143 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:29:18,144 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:29:18,145 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:29:18,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:29:18,147 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:29:18,147 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:29:18,147 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:29:18,148 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:29:18,148 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:29:18,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:29:18,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:29:18,149 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:29:18,149 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:29:18,150 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:29:18,150 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:29:18,151 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:29:18,151 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:29:18,151 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:29:18,151 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:29:18,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:29:18,152 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:29:18,153 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b93626b8-376a-44ae-ac0b-81bc5548bf4e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:29:18,162 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:29:18,162 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:29:18,163 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:29:18,163 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:29:18,163 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:29:18,163 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:29:18,163 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:29:18,163 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:29:18,163 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:29:18,164 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:29:18,164 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:29:18,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:29:18,164 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:29:18,164 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:29:18,164 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:29:18,164 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:29:18,164 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:29:18,164 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:29:18,164 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:29:18,165 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:29:18,165 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:29:18,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:29:18,165 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:29:18,165 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:29:18,165 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:29:18,165 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:29:18,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:29:18,166 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:29:18,166 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:29:18,166 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_b93626b8-376a-44ae-ac0b-81bc5548bf4e/bin/uautomizer 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 -> Automizer 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 -> bf2cd00fabce720f4c3f98371101c93927116a53 [2019-12-07 17:29:18,268 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:29:18,275 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:29:18,278 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:29:18,279 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:29:18,279 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:29:18,279 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b93626b8-376a-44ae-ac0b-81bc5548bf4e/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix054_power.oepc.i [2019-12-07 17:29:18,317 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b93626b8-376a-44ae-ac0b-81bc5548bf4e/bin/uautomizer/data/e7f0524c1/83eea2d1c8514bbc951b9451205448f7/FLAG60441eb0d [2019-12-07 17:29:18,815 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:29:18,816 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b93626b8-376a-44ae-ac0b-81bc5548bf4e/sv-benchmarks/c/pthread-wmm/mix054_power.oepc.i [2019-12-07 17:29:18,826 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b93626b8-376a-44ae-ac0b-81bc5548bf4e/bin/uautomizer/data/e7f0524c1/83eea2d1c8514bbc951b9451205448f7/FLAG60441eb0d [2019-12-07 17:29:18,835 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b93626b8-376a-44ae-ac0b-81bc5548bf4e/bin/uautomizer/data/e7f0524c1/83eea2d1c8514bbc951b9451205448f7 [2019-12-07 17:29:18,837 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:29:18,838 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:29:18,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:29:18,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:29:18,840 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:29:18,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:29:18" (1/1) ... [2019-12-07 17:29:18,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551fb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:18, skipping insertion in model container [2019-12-07 17:29:18,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:29:18" (1/1) ... [2019-12-07 17:29:18,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:29:18,876 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:29:19,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:29:19,122 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:29:19,165 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:29:19,211 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:29:19,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:19 WrapperNode [2019-12-07 17:29:19,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:29:19,212 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:29:19,212 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:29:19,212 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:29:19,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:19" (1/1) ... [2019-12-07 17:29:19,230 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:19" (1/1) ... [2019-12-07 17:29:19,249 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:29:19,249 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:29:19,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:29:19,250 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:29:19,256 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:19" (1/1) ... [2019-12-07 17:29:19,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:19" (1/1) ... [2019-12-07 17:29:19,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:19" (1/1) ... [2019-12-07 17:29:19,260 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:19" (1/1) ... [2019-12-07 17:29:19,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:19" (1/1) ... [2019-12-07 17:29:19,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:19" (1/1) ... [2019-12-07 17:29:19,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:19" (1/1) ... [2019-12-07 17:29:19,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:29:19,275 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:29:19,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:29:19,275 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:29:19,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b93626b8-376a-44ae-ac0b-81bc5548bf4e/bin/uautomizer/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 17:29:19,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:29:19,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:29:19,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:29:19,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:29:19,316 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:29:19,317 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:29:19,317 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:29:19,317 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:29:19,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:29:19,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:29:19,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:29:19,319 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 17:29:19,653 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:29:19,653 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:29:19,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:29:19 BoogieIcfgContainer [2019-12-07 17:29:19,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:29:19,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:29:19,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:29:19,656 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:29:19,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:29:18" (1/3) ... [2019-12-07 17:29:19,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32d7e939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:29:19, skipping insertion in model container [2019-12-07 17:29:19,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:19" (2/3) ... [2019-12-07 17:29:19,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32d7e939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:29:19, skipping insertion in model container [2019-12-07 17:29:19,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:29:19" (3/3) ... [2019-12-07 17:29:19,658 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_power.oepc.i [2019-12-07 17:29:19,664 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:29:19,664 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:29:19,669 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:29:19,669 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:29:19,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,692 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,692 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,692 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,692 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,693 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,697 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,697 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:19,719 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 17:29:19,731 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:29:19,731 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:29:19,732 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:29:19,732 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:29:19,732 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:29:19,732 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:29:19,732 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:29:19,732 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:29:19,742 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-07 17:29:19,743 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-07 17:29:19,790 INFO L134 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-07 17:29:19,790 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:29:19,799 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 577 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 17:29:19,812 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-07 17:29:19,837 INFO L134 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-07 17:29:19,837 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:29:19,840 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 577 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 17:29:19,851 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 17:29:19,852 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:29:22,469 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-07 17:29:22,751 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74785 [2019-12-07 17:29:22,751 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-07 17:29:22,754 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 85 transitions [2019-12-07 17:29:23,146 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8582 states. [2019-12-07 17:29:23,148 INFO L276 IsEmpty]: Start isEmpty. Operand 8582 states. [2019-12-07 17:29:23,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 17:29:23,153 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:23,153 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 17:29:23,154 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:23,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:23,158 INFO L82 PathProgramCache]: Analyzing trace with hash 791214, now seen corresponding path program 1 times [2019-12-07 17:29:23,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:23,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871621552] [2019-12-07 17:29:23,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:23,300 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 17:29:23,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871621552] [2019-12-07 17:29:23,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:23,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:29:23,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181365986] [2019-12-07 17:29:23,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:29:23,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:23,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:29:23,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:29:23,317 INFO L87 Difference]: Start difference. First operand 8582 states. Second operand 3 states. [2019-12-07 17:29:23,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:23,506 INFO L93 Difference]: Finished difference Result 8460 states and 27514 transitions. [2019-12-07 17:29:23,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:29:23,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 17:29:23,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:23,571 INFO L225 Difference]: With dead ends: 8460 [2019-12-07 17:29:23,571 INFO L226 Difference]: Without dead ends: 7472 [2019-12-07 17:29:23,572 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 17:29:23,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7472 states. [2019-12-07 17:29:23,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7472 to 7472. [2019-12-07 17:29:23,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7472 states. [2019-12-07 17:29:23,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7472 states to 7472 states and 24214 transitions. [2019-12-07 17:29:23,832 INFO L78 Accepts]: Start accepts. Automaton has 7472 states and 24214 transitions. Word has length 3 [2019-12-07 17:29:23,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:23,833 INFO L462 AbstractCegarLoop]: Abstraction has 7472 states and 24214 transitions. [2019-12-07 17:29:23,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:29:23,833 INFO L276 IsEmpty]: Start isEmpty. Operand 7472 states and 24214 transitions. [2019-12-07 17:29:23,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 17:29:23,836 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:23,836 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:23,836 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:23,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:23,836 INFO L82 PathProgramCache]: Analyzing trace with hash 743461303, now seen corresponding path program 1 times [2019-12-07 17:29:23,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:23,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38020490] [2019-12-07 17:29:23,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:23,921 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 17:29:23,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38020490] [2019-12-07 17:29:23,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:23,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:29:23,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182522341] [2019-12-07 17:29:23,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:29:23,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:23,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:29:23,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:29:23,923 INFO L87 Difference]: Start difference. First operand 7472 states and 24214 transitions. Second operand 4 states. [2019-12-07 17:29:24,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:24,168 INFO L93 Difference]: Finished difference Result 11704 states and 36249 transitions. [2019-12-07 17:29:24,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:29:24,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 17:29:24,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:24,218 INFO L225 Difference]: With dead ends: 11704 [2019-12-07 17:29:24,218 INFO L226 Difference]: Without dead ends: 11690 [2019-12-07 17:29:24,218 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 17:29:24,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11690 states. [2019-12-07 17:29:24,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11690 to 10458. [2019-12-07 17:29:24,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10458 states. [2019-12-07 17:29:24,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10458 states to 10458 states and 32991 transitions. [2019-12-07 17:29:24,446 INFO L78 Accepts]: Start accepts. Automaton has 10458 states and 32991 transitions. Word has length 11 [2019-12-07 17:29:24,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:24,446 INFO L462 AbstractCegarLoop]: Abstraction has 10458 states and 32991 transitions. [2019-12-07 17:29:24,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:29:24,446 INFO L276 IsEmpty]: Start isEmpty. Operand 10458 states and 32991 transitions. [2019-12-07 17:29:24,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:29:24,450 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:24,450 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:24,450 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:24,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:24,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1209900993, now seen corresponding path program 1 times [2019-12-07 17:29:24,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:24,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71569775] [2019-12-07 17:29:24,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:24,504 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 17:29:24,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71569775] [2019-12-07 17:29:24,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:24,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:29:24,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213441779] [2019-12-07 17:29:24,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:29:24,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:24,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:29:24,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:29:24,506 INFO L87 Difference]: Start difference. First operand 10458 states and 32991 transitions. Second operand 5 states. [2019-12-07 17:29:24,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:24,776 INFO L93 Difference]: Finished difference Result 15000 states and 46671 transitions. [2019-12-07 17:29:24,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:29:24,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 17:29:24,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:24,811 INFO L225 Difference]: With dead ends: 15000 [2019-12-07 17:29:24,811 INFO L226 Difference]: Without dead ends: 15000 [2019-12-07 17:29:24,811 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 17:29:24,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15000 states. [2019-12-07 17:29:25,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15000 to 11886. [2019-12-07 17:29:25,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11886 states. [2019-12-07 17:29:25,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11886 states to 11886 states and 37489 transitions. [2019-12-07 17:29:25,114 INFO L78 Accepts]: Start accepts. Automaton has 11886 states and 37489 transitions. Word has length 14 [2019-12-07 17:29:25,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:25,115 INFO L462 AbstractCegarLoop]: Abstraction has 11886 states and 37489 transitions. [2019-12-07 17:29:25,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:29:25,115 INFO L276 IsEmpty]: Start isEmpty. Operand 11886 states and 37489 transitions. [2019-12-07 17:29:25,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:29:25,117 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:25,117 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:25,117 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:25,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:25,117 INFO L82 PathProgramCache]: Analyzing trace with hash 529414606, now seen corresponding path program 1 times [2019-12-07 17:29:25,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:25,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241452941] [2019-12-07 17:29:25,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:25,156 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 17:29:25,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241452941] [2019-12-07 17:29:25,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:25,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:29:25,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31409593] [2019-12-07 17:29:25,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:29:25,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:25,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:29:25,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:29:25,157 INFO L87 Difference]: Start difference. First operand 11886 states and 37489 transitions. Second operand 3 states. [2019-12-07 17:29:25,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:25,193 INFO L93 Difference]: Finished difference Result 11886 states and 36968 transitions. [2019-12-07 17:29:25,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:29:25,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 17:29:25,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:25,220 INFO L225 Difference]: With dead ends: 11886 [2019-12-07 17:29:25,220 INFO L226 Difference]: Without dead ends: 11886 [2019-12-07 17:29:25,221 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 17:29:25,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11886 states. [2019-12-07 17:29:25,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11886 to 11798. [2019-12-07 17:29:25,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11798 states. [2019-12-07 17:29:25,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11798 states to 11798 states and 36712 transitions. [2019-12-07 17:29:25,405 INFO L78 Accepts]: Start accepts. Automaton has 11798 states and 36712 transitions. Word has length 16 [2019-12-07 17:29:25,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:25,405 INFO L462 AbstractCegarLoop]: Abstraction has 11798 states and 36712 transitions. [2019-12-07 17:29:25,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:29:25,405 INFO L276 IsEmpty]: Start isEmpty. Operand 11798 states and 36712 transitions. [2019-12-07 17:29:25,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:29:25,407 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:25,407 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:25,407 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:25,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:25,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1560475965, now seen corresponding path program 1 times [2019-12-07 17:29:25,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:25,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834433846] [2019-12-07 17:29:25,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:25,454 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 17:29:25,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834433846] [2019-12-07 17:29:25,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:25,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:29:25,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360512037] [2019-12-07 17:29:25,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:29:25,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:25,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:29:25,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:29:25,455 INFO L87 Difference]: Start difference. First operand 11798 states and 36712 transitions. Second operand 3 states. [2019-12-07 17:29:25,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:25,511 INFO L93 Difference]: Finished difference Result 20097 states and 61984 transitions. [2019-12-07 17:29:25,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:29:25,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 17:29:25,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:25,534 INFO L225 Difference]: With dead ends: 20097 [2019-12-07 17:29:25,534 INFO L226 Difference]: Without dead ends: 17619 [2019-12-07 17:29:25,534 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 17:29:25,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17619 states. [2019-12-07 17:29:25,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17619 to 16855. [2019-12-07 17:29:25,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16855 states. [2019-12-07 17:29:25,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16855 states to 16855 states and 52512 transitions. [2019-12-07 17:29:25,849 INFO L78 Accepts]: Start accepts. Automaton has 16855 states and 52512 transitions. Word has length 16 [2019-12-07 17:29:25,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:25,849 INFO L462 AbstractCegarLoop]: Abstraction has 16855 states and 52512 transitions. [2019-12-07 17:29:25,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:29:25,850 INFO L276 IsEmpty]: Start isEmpty. Operand 16855 states and 52512 transitions. [2019-12-07 17:29:25,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:29:25,853 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:25,854 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:25,854 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:25,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:25,854 INFO L82 PathProgramCache]: Analyzing trace with hash 783398497, now seen corresponding path program 1 times [2019-12-07 17:29:25,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:25,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682357917] [2019-12-07 17:29:25,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:25,907 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 17:29:25,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682357917] [2019-12-07 17:29:25,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:25,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:29:25,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433464295] [2019-12-07 17:29:25,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:29:25,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:25,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:29:25,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:29:25,909 INFO L87 Difference]: Start difference. First operand 16855 states and 52512 transitions. Second operand 4 states. [2019-12-07 17:29:25,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:25,931 INFO L93 Difference]: Finished difference Result 2989 states and 7615 transitions. [2019-12-07 17:29:25,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:29:25,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 17:29:25,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:25,933 INFO L225 Difference]: With dead ends: 2989 [2019-12-07 17:29:25,933 INFO L226 Difference]: Without dead ends: 2059 [2019-12-07 17:29:25,934 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 17:29:25,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2059 states. [2019-12-07 17:29:25,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2059 to 2059. [2019-12-07 17:29:25,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2059 states. [2019-12-07 17:29:25,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 2059 states and 4626 transitions. [2019-12-07 17:29:25,954 INFO L78 Accepts]: Start accepts. Automaton has 2059 states and 4626 transitions. Word has length 17 [2019-12-07 17:29:25,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:25,955 INFO L462 AbstractCegarLoop]: Abstraction has 2059 states and 4626 transitions. [2019-12-07 17:29:25,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:29:25,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 4626 transitions. [2019-12-07 17:29:25,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 17:29:25,956 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:25,957 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:25,957 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:25,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:25,957 INFO L82 PathProgramCache]: Analyzing trace with hash 702739982, now seen corresponding path program 1 times [2019-12-07 17:29:25,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:25,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094135490] [2019-12-07 17:29:25,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:26,006 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 17:29:26,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094135490] [2019-12-07 17:29:26,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:26,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:29:26,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585598569] [2019-12-07 17:29:26,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:29:26,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:26,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:29:26,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:29:26,007 INFO L87 Difference]: Start difference. First operand 2059 states and 4626 transitions. Second operand 6 states. [2019-12-07 17:29:26,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:26,270 INFO L93 Difference]: Finished difference Result 2885 states and 6208 transitions. [2019-12-07 17:29:26,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:29:26,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 17:29:26,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:26,272 INFO L225 Difference]: With dead ends: 2885 [2019-12-07 17:29:26,272 INFO L226 Difference]: Without dead ends: 2834 [2019-12-07 17:29:26,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:29:26,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2019-12-07 17:29:26,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2017. [2019-12-07 17:29:26,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2017 states. [2019-12-07 17:29:26,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 4535 transitions. [2019-12-07 17:29:26,293 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 4535 transitions. Word has length 25 [2019-12-07 17:29:26,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:26,293 INFO L462 AbstractCegarLoop]: Abstraction has 2017 states and 4535 transitions. [2019-12-07 17:29:26,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:29:26,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 4535 transitions. [2019-12-07 17:29:26,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 17:29:26,296 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:26,296 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:26,296 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:26,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:26,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1134333202, now seen corresponding path program 1 times [2019-12-07 17:29:26,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:26,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026980342] [2019-12-07 17:29:26,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:26,349 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 17:29:26,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026980342] [2019-12-07 17:29:26,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:26,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:29:26,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579226117] [2019-12-07 17:29:26,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:29:26,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:26,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:29:26,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:29:26,351 INFO L87 Difference]: Start difference. First operand 2017 states and 4535 transitions. Second operand 5 states. [2019-12-07 17:29:26,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:26,376 INFO L93 Difference]: Finished difference Result 1101 states and 2460 transitions. [2019-12-07 17:29:26,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:29:26,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 17:29:26,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:26,377 INFO L225 Difference]: With dead ends: 1101 [2019-12-07 17:29:26,377 INFO L226 Difference]: Without dead ends: 983 [2019-12-07 17:29:26,377 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 17:29:26,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2019-12-07 17:29:26,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 707. [2019-12-07 17:29:26,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-12-07 17:29:26,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1554 transitions. [2019-12-07 17:29:26,384 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1554 transitions. Word has length 28 [2019-12-07 17:29:26,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:26,385 INFO L462 AbstractCegarLoop]: Abstraction has 707 states and 1554 transitions. [2019-12-07 17:29:26,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:29:26,385 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1554 transitions. [2019-12-07 17:29:26,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:29:26,386 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:26,386 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] [2019-12-07 17:29:26,387 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:26,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:26,387 INFO L82 PathProgramCache]: Analyzing trace with hash 2108814601, now seen corresponding path program 1 times [2019-12-07 17:29:26,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:26,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237046383] [2019-12-07 17:29:26,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:26,414 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 17:29:26,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237046383] [2019-12-07 17:29:26,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:26,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:29:26,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732969262] [2019-12-07 17:29:26,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:29:26,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:26,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:29:26,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:29:26,416 INFO L87 Difference]: Start difference. First operand 707 states and 1554 transitions. Second operand 3 states. [2019-12-07 17:29:26,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:26,438 INFO L93 Difference]: Finished difference Result 1066 states and 2274 transitions. [2019-12-07 17:29:26,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:29:26,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 17:29:26,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:26,440 INFO L225 Difference]: With dead ends: 1066 [2019-12-07 17:29:26,440 INFO L226 Difference]: Without dead ends: 1066 [2019-12-07 17:29:26,440 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 17:29:26,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2019-12-07 17:29:26,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 806. [2019-12-07 17:29:26,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2019-12-07 17:29:26,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1751 transitions. [2019-12-07 17:29:26,448 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1751 transitions. Word has length 52 [2019-12-07 17:29:26,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:26,448 INFO L462 AbstractCegarLoop]: Abstraction has 806 states and 1751 transitions. [2019-12-07 17:29:26,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:29:26,448 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1751 transitions. [2019-12-07 17:29:26,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:29:26,450 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:26,450 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] [2019-12-07 17:29:26,450 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:26,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:26,450 INFO L82 PathProgramCache]: Analyzing trace with hash -525709791, now seen corresponding path program 1 times [2019-12-07 17:29:26,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:26,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508678616] [2019-12-07 17:29:26,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:26,524 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 17:29:26,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508678616] [2019-12-07 17:29:26,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:26,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:29:26,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497355877] [2019-12-07 17:29:26,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:29:26,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:26,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:29:26,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:29:26,526 INFO L87 Difference]: Start difference. First operand 806 states and 1751 transitions. Second operand 7 states. [2019-12-07 17:29:27,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:27,024 INFO L93 Difference]: Finished difference Result 1466 states and 3066 transitions. [2019-12-07 17:29:27,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 17:29:27,024 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 17:29:27,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:27,025 INFO L225 Difference]: With dead ends: 1466 [2019-12-07 17:29:27,025 INFO L226 Difference]: Without dead ends: 1466 [2019-12-07 17:29:27,026 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:29:27,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2019-12-07 17:29:27,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1013. [2019-12-07 17:29:27,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2019-12-07 17:29:27,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 2183 transitions. [2019-12-07 17:29:27,036 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 2183 transitions. Word has length 52 [2019-12-07 17:29:27,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:27,036 INFO L462 AbstractCegarLoop]: Abstraction has 1013 states and 2183 transitions. [2019-12-07 17:29:27,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:29:27,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 2183 transitions. [2019-12-07 17:29:27,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:29:27,037 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:27,037 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] [2019-12-07 17:29:27,037 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:27,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:27,038 INFO L82 PathProgramCache]: Analyzing trace with hash -346039067, now seen corresponding path program 2 times [2019-12-07 17:29:27,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:27,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191183991] [2019-12-07 17:29:27,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:27,104 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 17:29:27,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191183991] [2019-12-07 17:29:27,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:27,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:29:27,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481607641] [2019-12-07 17:29:27,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:29:27,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:27,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:29:27,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:29:27,106 INFO L87 Difference]: Start difference. First operand 1013 states and 2183 transitions. Second operand 7 states. [2019-12-07 17:29:27,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:27,282 INFO L93 Difference]: Finished difference Result 2737 states and 5771 transitions. [2019-12-07 17:29:27,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:29:27,282 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 17:29:27,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:27,284 INFO L225 Difference]: With dead ends: 2737 [2019-12-07 17:29:27,284 INFO L226 Difference]: Without dead ends: 1834 [2019-12-07 17:29:27,284 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:29:27,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2019-12-07 17:29:27,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1060. [2019-12-07 17:29:27,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2019-12-07 17:29:27,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 2272 transitions. [2019-12-07 17:29:27,296 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 2272 transitions. Word has length 52 [2019-12-07 17:29:27,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:27,296 INFO L462 AbstractCegarLoop]: Abstraction has 1060 states and 2272 transitions. [2019-12-07 17:29:27,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:29:27,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 2272 transitions. [2019-12-07 17:29:27,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:29:27,298 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:27,298 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] [2019-12-07 17:29:27,298 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:27,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:27,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1667381275, now seen corresponding path program 3 times [2019-12-07 17:29:27,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:27,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901171347] [2019-12-07 17:29:27,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:27,373 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 17:29:27,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901171347] [2019-12-07 17:29:27,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:27,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:29:27,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635328764] [2019-12-07 17:29:27,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:29:27,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:27,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:29:27,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:29:27,376 INFO L87 Difference]: Start difference. First operand 1060 states and 2272 transitions. Second operand 5 states. [2019-12-07 17:29:27,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:27,420 INFO L93 Difference]: Finished difference Result 1296 states and 2760 transitions. [2019-12-07 17:29:27,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:29:27,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-07 17:29:27,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:27,421 INFO L225 Difference]: With dead ends: 1296 [2019-12-07 17:29:27,421 INFO L226 Difference]: Without dead ends: 1296 [2019-12-07 17:29:27,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 17:29:27,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2019-12-07 17:29:27,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 976. [2019-12-07 17:29:27,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2019-12-07 17:29:27,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 2123 transitions. [2019-12-07 17:29:27,434 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 2123 transitions. Word has length 52 [2019-12-07 17:29:27,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:27,434 INFO L462 AbstractCegarLoop]: Abstraction has 976 states and 2123 transitions. [2019-12-07 17:29:27,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:29:27,435 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 2123 transitions. [2019-12-07 17:29:27,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:29:27,436 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:27,436 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] [2019-12-07 17:29:27,436 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:27,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:27,437 INFO L82 PathProgramCache]: Analyzing trace with hash -288059161, now seen corresponding path program 1 times [2019-12-07 17:29:27,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:27,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893681753] [2019-12-07 17:29:27,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:29:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:29:27,536 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:29:27,536 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:29:27,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L792: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd2~0_239) (= 0 v_~y$flush_delayed~0_31) (= v_~main$tmp_guard0~0_30 0) (= v_~x~0_98 0) (= v_~y~0_135 0) (= |v_#NULL.offset_3| 0) (= v_~y$mem_tmp~0_22 0) (= v_~y$r_buff1_thd1~0_110 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1441~0.base_35| 1) |v_#valid_57|) (= v_~y$r_buff0_thd1~0_187 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1441~0.base_35| 4)) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~y$w_buff0_used~0_704 0) (= v_~main$tmp_guard1~0_45 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1441~0.base_35|)) (= v_~y$r_buff0_thd0~0_135 0) (= v_~y$r_buff1_thd0~0_153 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_cnt~0_51) (< 0 |v_#StackHeapBarrier_14|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1441~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1441~0.base_35|) |v_ULTIMATE.start_main_~#t1441~0.offset_27| 0)) |v_#memory_int_15|) (= 0 v_~y$r_buff0_thd2~0_327) (= 0 v_~weak$$choice0~0_20) (= v_~y$w_buff1_used~0_445 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1441~0.base_35|) (= 0 |v_#NULL.base_3|) (= |v_ULTIMATE.start_main_~#t1441~0.offset_27| 0) (= v_~weak$$choice2~0_107 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$w_buff1~0_286 0) (= 0 v_~y$w_buff0~0_484))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_704, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_78|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_47|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_110, ~y$mem_tmp~0=v_~y$mem_tmp~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_484, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_187, ~y$flush_delayed~0=v_~y$flush_delayed~0_31, #length=|v_#length_17|, ULTIMATE.start_main_~#t1441~0.base=|v_ULTIMATE.start_main_~#t1441~0.base_35|, ~y~0=v_~y~0_135, ULTIMATE.start_main_~#t1442~0.offset=|v_ULTIMATE.start_main_~#t1442~0.offset_15|, ULTIMATE.start_main_~#t1442~0.base=|v_ULTIMATE.start_main_~#t1442~0.base_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_239, ~weak$$choice0~0=v_~weak$$choice0~0_20, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_102|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ~y$w_buff1~0=v_~y$w_buff1~0_286, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t1441~0.offset=|v_ULTIMATE.start_main_~#t1441~0.offset_27|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_135, #valid=|v_#valid_57|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_327, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ~x~0=v_~x~0_98, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_445} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1441~0.base, ~y~0, ULTIMATE.start_main_~#t1442~0.offset, ULTIMATE.start_main_~#t1442~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t1441~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:29:27,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L4-->L736: Formula: (and (= ~y$r_buff0_thd0~0_In117574726 ~y$r_buff1_thd0~0_Out117574726) (= ~y$r_buff0_thd2~0_In117574726 ~y$r_buff1_thd2~0_Out117574726) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In117574726)) (= 1 ~y$r_buff0_thd1~0_Out117574726) (= ~x~0_Out117574726 1) (= ~y$r_buff0_thd1~0_In117574726 ~y$r_buff1_thd1~0_Out117574726)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In117574726, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In117574726, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In117574726, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In117574726} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out117574726, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out117574726, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In117574726, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out117574726, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In117574726, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In117574726, ~x~0=~x~0_Out117574726, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out117574726} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 17:29:27,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L792-1-->L794: Formula: (and (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1442~0.base_11|)) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1442~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1442~0.base_11|) |v_ULTIMATE.start_main_~#t1442~0.offset_10| 1)) |v_#memory_int_7|) (= |v_ULTIMATE.start_main_~#t1442~0.offset_10| 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1442~0.base_11| 4) |v_#length_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1442~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1442~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1442~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1442~0.offset=|v_ULTIMATE.start_main_~#t1442~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t1442~0.base=|v_ULTIMATE.start_main_~#t1442~0.base_11|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1442~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1442~0.base, #length] because there is no mapped edge [2019-12-07 17:29:27,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L737-->L737-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In505394849 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In505394849 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In505394849 |P0Thread1of1ForFork0_#t~ite5_Out505394849|)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out505394849|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In505394849, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In505394849} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out505394849|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In505394849, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In505394849} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:29:27,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L758-->L758-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In845982246 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite15_Out845982246| |P1Thread1of1ForFork1_#t~ite14_Out845982246|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In845982246 256)))) (or (and (= (mod ~y$r_buff1_thd2~0_In845982246 256) 0) .cse1) (and (= (mod ~y$w_buff1_used~0_In845982246 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In845982246 256)))) (= |P1Thread1of1ForFork1_#t~ite14_Out845982246| ~y$w_buff0~0_In845982246)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite15_Out845982246| ~y$w_buff0~0_In845982246) (= |P1Thread1of1ForFork1_#t~ite14_In845982246| |P1Thread1of1ForFork1_#t~ite14_Out845982246|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In845982246, ~y$w_buff0_used~0=~y$w_buff0_used~0_In845982246, ~y$w_buff0~0=~y$w_buff0~0_In845982246, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In845982246, ~weak$$choice2~0=~weak$$choice2~0_In845982246, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In845982246|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In845982246} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In845982246, ~y$w_buff0_used~0=~y$w_buff0_used~0_In845982246, ~y$w_buff0~0=~y$w_buff0~0_In845982246, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In845982246, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out845982246|, ~weak$$choice2~0=~weak$$choice2~0_In845982246, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out845982246|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In845982246} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 17:29:27,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L760-->L760-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1050702239 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In1050702239| |P1Thread1of1ForFork1_#t~ite20_Out1050702239|) (= |P1Thread1of1ForFork1_#t~ite21_Out1050702239| ~y$w_buff0_used~0_In1050702239)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out1050702239| ~y$w_buff0_used~0_In1050702239) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1050702239 256)))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In1050702239 256)) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In1050702239 256)) .cse1) (= (mod ~y$w_buff0_used~0_In1050702239 256) 0))) .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out1050702239| |P1Thread1of1ForFork1_#t~ite21_Out1050702239|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1050702239, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1050702239, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1050702239|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1050702239, ~weak$$choice2~0=~weak$$choice2~0_In1050702239, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1050702239} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1050702239, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1050702239, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1050702239|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1050702239, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1050702239|, ~weak$$choice2~0=~weak$$choice2~0_In1050702239, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1050702239} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 17:29:27,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_18 256) 0)) (= v_~y$r_buff0_thd2~0_68 v_~y$r_buff0_thd2~0_67)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_67, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_5|, ~weak$$choice2~0=v_~weak$$choice2~0_18, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_11|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_5|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 17:29:27,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L763-->L763-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-366639957 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-366639957 256)))) (or (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-366639957 256))) (and (= (mod ~y$r_buff1_thd2~0_In-366639957 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In-366639957 256) 0))) (= |P1Thread1of1ForFork1_#t~ite30_Out-366639957| |P1Thread1of1ForFork1_#t~ite29_Out-366639957|) (= ~y$r_buff1_thd2~0_In-366639957 |P1Thread1of1ForFork1_#t~ite29_Out-366639957|) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite29_In-366639957| |P1Thread1of1ForFork1_#t~ite29_Out-366639957|) (not .cse1) (= ~y$r_buff1_thd2~0_In-366639957 |P1Thread1of1ForFork1_#t~ite30_Out-366639957|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-366639957, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-366639957|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-366639957, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-366639957, ~weak$$choice2~0=~weak$$choice2~0_In-366639957, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-366639957} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-366639957, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-366639957|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-366639957|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-366639957, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-366639957, ~weak$$choice2~0=~weak$$choice2~0_In-366639957, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-366639957} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 17:29:27,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L765-->L769: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_24 v_~y$mem_tmp~0_6) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_9} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~y~0=v_~y~0_24} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 17:29:27,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L769-2-->L769-5: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1059524152 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1059524152 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite33_Out1059524152| |P1Thread1of1ForFork1_#t~ite32_Out1059524152|))) (or (and (= ~y$w_buff1~0_In1059524152 |P1Thread1of1ForFork1_#t~ite32_Out1059524152|) (not .cse0) .cse1 (not .cse2)) (and (or .cse2 .cse0) .cse1 (= ~y~0_In1059524152 |P1Thread1of1ForFork1_#t~ite32_Out1059524152|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1059524152, ~y$w_buff1~0=~y$w_buff1~0_In1059524152, ~y~0=~y~0_In1059524152, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1059524152} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1059524152, ~y$w_buff1~0=~y$w_buff1~0_In1059524152, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1059524152|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1059524152|, ~y~0=~y~0_In1059524152, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1059524152} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 17:29:27,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1756559810 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1756559810 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out1756559810|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1756559810| ~y$w_buff0_used~0_In1756559810)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1756559810, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1756559810} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1756559810, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1756559810, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1756559810|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:29:27,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L771-->L771-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In223359847 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In223359847 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In223359847 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In223359847 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out223359847| 0)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out223359847| ~y$w_buff1_used~0_In223359847) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In223359847, ~y$w_buff0_used~0=~y$w_buff0_used~0_In223359847, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In223359847, ~y$w_buff1_used~0=~y$w_buff1_used~0_In223359847} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In223359847, ~y$w_buff0_used~0=~y$w_buff0_used~0_In223359847, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In223359847, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out223359847|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In223359847} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:29:27,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In2128283667 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2128283667 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out2128283667| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out2128283667| ~y$r_buff0_thd2~0_In2128283667) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2128283667, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2128283667} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2128283667, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2128283667, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out2128283667|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:29:27,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L773-->L773-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-476359376 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-476359376 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-476359376 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-476359376 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-476359376| ~y$r_buff1_thd2~0_In-476359376) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-476359376| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-476359376, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-476359376, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-476359376, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-476359376} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-476359376, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-476359376, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-476359376, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-476359376|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-476359376} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:29:27,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_151 |v_P1Thread1of1ForFork1_#t~ite37_30|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_151, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_29|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:29:27,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L738-->L738-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-165427219 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-165427219 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-165427219 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-165427219 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-165427219| ~y$w_buff1_used~0_In-165427219) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite6_Out-165427219| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-165427219, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-165427219, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-165427219, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-165427219} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-165427219|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-165427219, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-165427219, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-165427219, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-165427219} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:29:27,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L739-->L740: Formula: (let ((.cse0 (= ~y$r_buff0_thd1~0_In-2082331744 ~y$r_buff0_thd1~0_Out-2082331744)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2082331744 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-2082331744 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= ~y$r_buff0_thd1~0_Out-2082331744 0) (not .cse1) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2082331744, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2082331744} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2082331744, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2082331744|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-2082331744} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:29:27,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In582944745 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In582944745 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In582944745 256))) (.cse2 (= (mod ~y$r_buff1_thd1~0_In582944745 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out582944745| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out582944745| ~y$r_buff1_thd1~0_In582944745) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In582944745, ~y$w_buff0_used~0=~y$w_buff0_used~0_In582944745, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In582944745, ~y$w_buff1_used~0=~y$w_buff1_used~0_In582944745} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In582944745, ~y$w_buff0_used~0=~y$w_buff0_used~0_In582944745, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out582944745|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In582944745, ~y$w_buff1_used~0=~y$w_buff1_used~0_In582944745} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:29:27,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L740-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y$r_buff1_thd1~0_50 |v_P0Thread1of1ForFork0_#t~ite8_26|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:29:27,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L798-->L800-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$w_buff0_used~0_276 256)) (= (mod v_~y$r_buff0_thd0~0_50 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:29:27,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L800-2-->L800-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite40_Out-673995952| |ULTIMATE.start_main_#t~ite41_Out-673995952|)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-673995952 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-673995952 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-673995952| ~y$w_buff1~0_In-673995952) (not .cse0) .cse1 (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite40_Out-673995952| ~y~0_In-673995952) .cse1 (or .cse2 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-673995952, ~y~0=~y~0_In-673995952, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-673995952, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-673995952} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-673995952|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-673995952|, ~y$w_buff1~0=~y$w_buff1~0_In-673995952, ~y~0=~y~0_In-673995952, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-673995952, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-673995952} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:29:27,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1402347078 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1402347078 256)))) (or (and (= ~y$w_buff0_used~0_In1402347078 |ULTIMATE.start_main_#t~ite42_Out1402347078|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out1402347078|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1402347078, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1402347078} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1402347078, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1402347078, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1402347078|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:29:27,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1253189261 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1253189261 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1253189261 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1253189261 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out1253189261|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In1253189261 |ULTIMATE.start_main_#t~ite43_Out1253189261|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1253189261, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1253189261, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1253189261, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1253189261} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1253189261, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1253189261, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1253189261|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1253189261, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1253189261} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:29:27,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1955490600 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1955490600 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out1955490600|)) (and (= ~y$r_buff0_thd0~0_In1955490600 |ULTIMATE.start_main_#t~ite44_Out1955490600|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1955490600, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1955490600} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1955490600, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1955490600, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1955490600|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:29:27,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L804-->L804-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-681835849 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-681835849 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-681835849 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-681835849 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-681835849| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-681835849| ~y$r_buff1_thd0~0_In-681835849) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-681835849, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-681835849, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-681835849, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-681835849} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-681835849, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-681835849, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-681835849, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-681835849|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-681835849} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:29:27,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L804-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~main$tmp_guard1~0_16 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_18) (= v_~x~0_61 2))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~y$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite45_33|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~x~0=v_~x~0_61, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_33|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x~0=v_~x~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_104, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_32|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:29:27,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:29:27 BasicIcfg [2019-12-07 17:29:27,603 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:29:27,604 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:29:27,604 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:29:27,604 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:29:27,604 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:29:19" (3/4) ... [2019-12-07 17:29:27,606 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:29:27,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L792: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd2~0_239) (= 0 v_~y$flush_delayed~0_31) (= v_~main$tmp_guard0~0_30 0) (= v_~x~0_98 0) (= v_~y~0_135 0) (= |v_#NULL.offset_3| 0) (= v_~y$mem_tmp~0_22 0) (= v_~y$r_buff1_thd1~0_110 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1441~0.base_35| 1) |v_#valid_57|) (= v_~y$r_buff0_thd1~0_187 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1441~0.base_35| 4)) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~y$w_buff0_used~0_704 0) (= v_~main$tmp_guard1~0_45 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1441~0.base_35|)) (= v_~y$r_buff0_thd0~0_135 0) (= v_~y$r_buff1_thd0~0_153 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_cnt~0_51) (< 0 |v_#StackHeapBarrier_14|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1441~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1441~0.base_35|) |v_ULTIMATE.start_main_~#t1441~0.offset_27| 0)) |v_#memory_int_15|) (= 0 v_~y$r_buff0_thd2~0_327) (= 0 v_~weak$$choice0~0_20) (= v_~y$w_buff1_used~0_445 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1441~0.base_35|) (= 0 |v_#NULL.base_3|) (= |v_ULTIMATE.start_main_~#t1441~0.offset_27| 0) (= v_~weak$$choice2~0_107 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$w_buff1~0_286 0) (= 0 v_~y$w_buff0~0_484))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_704, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_78|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_47|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_110, ~y$mem_tmp~0=v_~y$mem_tmp~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_484, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_187, ~y$flush_delayed~0=v_~y$flush_delayed~0_31, #length=|v_#length_17|, ULTIMATE.start_main_~#t1441~0.base=|v_ULTIMATE.start_main_~#t1441~0.base_35|, ~y~0=v_~y~0_135, ULTIMATE.start_main_~#t1442~0.offset=|v_ULTIMATE.start_main_~#t1442~0.offset_15|, ULTIMATE.start_main_~#t1442~0.base=|v_ULTIMATE.start_main_~#t1442~0.base_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_239, ~weak$$choice0~0=v_~weak$$choice0~0_20, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_102|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ~y$w_buff1~0=v_~y$w_buff1~0_286, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t1441~0.offset=|v_ULTIMATE.start_main_~#t1441~0.offset_27|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_135, #valid=|v_#valid_57|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_327, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ~x~0=v_~x~0_98, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_445} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1441~0.base, ~y~0, ULTIMATE.start_main_~#t1442~0.offset, ULTIMATE.start_main_~#t1442~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t1441~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:29:27,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L4-->L736: Formula: (and (= ~y$r_buff0_thd0~0_In117574726 ~y$r_buff1_thd0~0_Out117574726) (= ~y$r_buff0_thd2~0_In117574726 ~y$r_buff1_thd2~0_Out117574726) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In117574726)) (= 1 ~y$r_buff0_thd1~0_Out117574726) (= ~x~0_Out117574726 1) (= ~y$r_buff0_thd1~0_In117574726 ~y$r_buff1_thd1~0_Out117574726)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In117574726, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In117574726, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In117574726, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In117574726} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out117574726, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out117574726, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In117574726, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out117574726, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In117574726, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In117574726, ~x~0=~x~0_Out117574726, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out117574726} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 17:29:27,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L792-1-->L794: Formula: (and (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1442~0.base_11|)) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1442~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1442~0.base_11|) |v_ULTIMATE.start_main_~#t1442~0.offset_10| 1)) |v_#memory_int_7|) (= |v_ULTIMATE.start_main_~#t1442~0.offset_10| 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1442~0.base_11| 4) |v_#length_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1442~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1442~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1442~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1442~0.offset=|v_ULTIMATE.start_main_~#t1442~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t1442~0.base=|v_ULTIMATE.start_main_~#t1442~0.base_11|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1442~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1442~0.base, #length] because there is no mapped edge [2019-12-07 17:29:27,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L737-->L737-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In505394849 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In505394849 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In505394849 |P0Thread1of1ForFork0_#t~ite5_Out505394849|)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out505394849|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In505394849, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In505394849} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out505394849|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In505394849, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In505394849} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:29:27,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L758-->L758-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In845982246 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite15_Out845982246| |P1Thread1of1ForFork1_#t~ite14_Out845982246|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In845982246 256)))) (or (and (= (mod ~y$r_buff1_thd2~0_In845982246 256) 0) .cse1) (and (= (mod ~y$w_buff1_used~0_In845982246 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In845982246 256)))) (= |P1Thread1of1ForFork1_#t~ite14_Out845982246| ~y$w_buff0~0_In845982246)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite15_Out845982246| ~y$w_buff0~0_In845982246) (= |P1Thread1of1ForFork1_#t~ite14_In845982246| |P1Thread1of1ForFork1_#t~ite14_Out845982246|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In845982246, ~y$w_buff0_used~0=~y$w_buff0_used~0_In845982246, ~y$w_buff0~0=~y$w_buff0~0_In845982246, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In845982246, ~weak$$choice2~0=~weak$$choice2~0_In845982246, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In845982246|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In845982246} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In845982246, ~y$w_buff0_used~0=~y$w_buff0_used~0_In845982246, ~y$w_buff0~0=~y$w_buff0~0_In845982246, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In845982246, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out845982246|, ~weak$$choice2~0=~weak$$choice2~0_In845982246, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out845982246|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In845982246} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 17:29:27,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L760-->L760-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1050702239 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In1050702239| |P1Thread1of1ForFork1_#t~ite20_Out1050702239|) (= |P1Thread1of1ForFork1_#t~ite21_Out1050702239| ~y$w_buff0_used~0_In1050702239)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out1050702239| ~y$w_buff0_used~0_In1050702239) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1050702239 256)))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In1050702239 256)) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In1050702239 256)) .cse1) (= (mod ~y$w_buff0_used~0_In1050702239 256) 0))) .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out1050702239| |P1Thread1of1ForFork1_#t~ite21_Out1050702239|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1050702239, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1050702239, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1050702239|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1050702239, ~weak$$choice2~0=~weak$$choice2~0_In1050702239, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1050702239} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1050702239, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1050702239, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1050702239|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1050702239, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1050702239|, ~weak$$choice2~0=~weak$$choice2~0_In1050702239, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1050702239} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 17:29:27,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_18 256) 0)) (= v_~y$r_buff0_thd2~0_68 v_~y$r_buff0_thd2~0_67)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_67, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_5|, ~weak$$choice2~0=v_~weak$$choice2~0_18, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_11|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_5|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 17:29:27,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L763-->L763-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-366639957 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-366639957 256)))) (or (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-366639957 256))) (and (= (mod ~y$r_buff1_thd2~0_In-366639957 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In-366639957 256) 0))) (= |P1Thread1of1ForFork1_#t~ite30_Out-366639957| |P1Thread1of1ForFork1_#t~ite29_Out-366639957|) (= ~y$r_buff1_thd2~0_In-366639957 |P1Thread1of1ForFork1_#t~ite29_Out-366639957|) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite29_In-366639957| |P1Thread1of1ForFork1_#t~ite29_Out-366639957|) (not .cse1) (= ~y$r_buff1_thd2~0_In-366639957 |P1Thread1of1ForFork1_#t~ite30_Out-366639957|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-366639957, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-366639957|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-366639957, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-366639957, ~weak$$choice2~0=~weak$$choice2~0_In-366639957, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-366639957} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-366639957, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-366639957|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-366639957|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-366639957, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-366639957, ~weak$$choice2~0=~weak$$choice2~0_In-366639957, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-366639957} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 17:29:27,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L765-->L769: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_24 v_~y$mem_tmp~0_6) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_9} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~y~0=v_~y~0_24} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 17:29:27,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L769-2-->L769-5: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1059524152 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1059524152 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite33_Out1059524152| |P1Thread1of1ForFork1_#t~ite32_Out1059524152|))) (or (and (= ~y$w_buff1~0_In1059524152 |P1Thread1of1ForFork1_#t~ite32_Out1059524152|) (not .cse0) .cse1 (not .cse2)) (and (or .cse2 .cse0) .cse1 (= ~y~0_In1059524152 |P1Thread1of1ForFork1_#t~ite32_Out1059524152|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1059524152, ~y$w_buff1~0=~y$w_buff1~0_In1059524152, ~y~0=~y~0_In1059524152, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1059524152} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1059524152, ~y$w_buff1~0=~y$w_buff1~0_In1059524152, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1059524152|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1059524152|, ~y~0=~y~0_In1059524152, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1059524152} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 17:29:27,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1756559810 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1756559810 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out1756559810|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1756559810| ~y$w_buff0_used~0_In1756559810)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1756559810, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1756559810} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1756559810, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1756559810, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1756559810|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:29:27,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L771-->L771-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In223359847 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In223359847 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In223359847 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In223359847 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out223359847| 0)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out223359847| ~y$w_buff1_used~0_In223359847) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In223359847, ~y$w_buff0_used~0=~y$w_buff0_used~0_In223359847, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In223359847, ~y$w_buff1_used~0=~y$w_buff1_used~0_In223359847} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In223359847, ~y$w_buff0_used~0=~y$w_buff0_used~0_In223359847, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In223359847, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out223359847|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In223359847} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:29:27,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In2128283667 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2128283667 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out2128283667| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out2128283667| ~y$r_buff0_thd2~0_In2128283667) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2128283667, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2128283667} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2128283667, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2128283667, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out2128283667|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:29:27,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L773-->L773-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-476359376 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-476359376 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-476359376 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-476359376 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-476359376| ~y$r_buff1_thd2~0_In-476359376) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-476359376| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-476359376, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-476359376, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-476359376, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-476359376} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-476359376, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-476359376, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-476359376, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-476359376|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-476359376} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:29:27,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_151 |v_P1Thread1of1ForFork1_#t~ite37_30|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_151, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_29|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:29:27,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L738-->L738-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-165427219 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-165427219 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-165427219 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-165427219 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-165427219| ~y$w_buff1_used~0_In-165427219) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite6_Out-165427219| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-165427219, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-165427219, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-165427219, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-165427219} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-165427219|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-165427219, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-165427219, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-165427219, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-165427219} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:29:27,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L739-->L740: Formula: (let ((.cse0 (= ~y$r_buff0_thd1~0_In-2082331744 ~y$r_buff0_thd1~0_Out-2082331744)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2082331744 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-2082331744 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= ~y$r_buff0_thd1~0_Out-2082331744 0) (not .cse1) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2082331744, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2082331744} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2082331744, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2082331744|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-2082331744} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:29:27,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In582944745 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In582944745 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In582944745 256))) (.cse2 (= (mod ~y$r_buff1_thd1~0_In582944745 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out582944745| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out582944745| ~y$r_buff1_thd1~0_In582944745) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In582944745, ~y$w_buff0_used~0=~y$w_buff0_used~0_In582944745, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In582944745, ~y$w_buff1_used~0=~y$w_buff1_used~0_In582944745} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In582944745, ~y$w_buff0_used~0=~y$w_buff0_used~0_In582944745, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out582944745|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In582944745, ~y$w_buff1_used~0=~y$w_buff1_used~0_In582944745} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:29:27,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L740-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y$r_buff1_thd1~0_50 |v_P0Thread1of1ForFork0_#t~ite8_26|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:29:27,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L798-->L800-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$w_buff0_used~0_276 256)) (= (mod v_~y$r_buff0_thd0~0_50 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:29:27,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L800-2-->L800-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite40_Out-673995952| |ULTIMATE.start_main_#t~ite41_Out-673995952|)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-673995952 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-673995952 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-673995952| ~y$w_buff1~0_In-673995952) (not .cse0) .cse1 (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite40_Out-673995952| ~y~0_In-673995952) .cse1 (or .cse2 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-673995952, ~y~0=~y~0_In-673995952, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-673995952, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-673995952} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-673995952|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-673995952|, ~y$w_buff1~0=~y$w_buff1~0_In-673995952, ~y~0=~y~0_In-673995952, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-673995952, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-673995952} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:29:27,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1402347078 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1402347078 256)))) (or (and (= ~y$w_buff0_used~0_In1402347078 |ULTIMATE.start_main_#t~ite42_Out1402347078|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out1402347078|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1402347078, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1402347078} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1402347078, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1402347078, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1402347078|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:29:27,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1253189261 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1253189261 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1253189261 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1253189261 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out1253189261|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In1253189261 |ULTIMATE.start_main_#t~ite43_Out1253189261|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1253189261, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1253189261, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1253189261, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1253189261} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1253189261, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1253189261, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1253189261|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1253189261, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1253189261} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:29:27,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1955490600 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1955490600 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out1955490600|)) (and (= ~y$r_buff0_thd0~0_In1955490600 |ULTIMATE.start_main_#t~ite44_Out1955490600|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1955490600, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1955490600} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1955490600, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1955490600, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1955490600|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:29:27,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L804-->L804-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-681835849 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-681835849 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-681835849 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-681835849 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-681835849| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-681835849| ~y$r_buff1_thd0~0_In-681835849) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-681835849, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-681835849, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-681835849, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-681835849} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-681835849, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-681835849, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-681835849, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-681835849|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-681835849} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:29:27,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L804-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~main$tmp_guard1~0_16 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_18) (= v_~x~0_61 2))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~y$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite45_33|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~x~0=v_~x~0_61, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_33|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x~0=v_~x~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_104, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_32|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:29:27,666 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b93626b8-376a-44ae-ac0b-81bc5548bf4e/bin/uautomizer/witness.graphml [2019-12-07 17:29:27,666 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:29:27,667 INFO L168 Benchmark]: Toolchain (without parser) took 8829.86 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 420.5 MB). Free memory was 940.7 MB in the beginning and 673.2 MB in the end (delta: 267.5 MB). Peak memory consumption was 688.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:29:27,668 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:29:27,668 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -127.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:29:27,668 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:29:27,669 INFO L168 Benchmark]: Boogie Preprocessor took 25.00 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:29:27,669 INFO L168 Benchmark]: RCFGBuilder took 379.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:29:27,669 INFO L168 Benchmark]: TraceAbstraction took 7949.08 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 320.3 MB). Free memory was 1.0 GB in the beginning and 698.6 MB in the end (delta: 311.9 MB). Peak memory consumption was 632.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:29:27,670 INFO L168 Benchmark]: Witness Printer took 62.70 ms. Allocated memory is still 1.4 GB. Free memory was 698.6 MB in the beginning and 673.2 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:29:27,671 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 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 373.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -127.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.00 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 379.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7949.08 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 320.3 MB). Free memory was 1.0 GB in the beginning and 698.6 MB in the end (delta: 311.9 MB). Peak memory consumption was 632.2 MB. Max. memory is 11.5 GB. * Witness Printer took 62.70 ms. Allocated memory is still 1.4 GB. Free memory was 698.6 MB in the beginning and 673.2 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.0s, 146 ProgramPointsBefore, 75 ProgramPointsAfterwards, 180 TransitionsBefore, 85 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 28 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 27 ChoiceCompositions, 4902 VarBasedMoverChecksPositive, 321 VarBasedMoverChecksNegative, 236 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 74785 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L792] FCALL, FORK 0 pthread_create(&t1441, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L794] FCALL, FORK 0 pthread_create(&t1442, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L757] 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, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 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) [L758] 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)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L759] 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)) [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 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)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] 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)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 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 [L803] 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 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 7.8s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1541 SDtfs, 1602 SDslu, 3105 SDs, 0 SdLazy, 1630 SolverSat, 86 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16855occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 8098 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 391 NumberOfCodeBlocks, 391 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 326 ConstructedInterpolants, 0 QuantifiedInterpolants, 39077 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...