./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi000_pso.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_d9e162ce-7527-4c73-87f2-ac109e499c06/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d9e162ce-7527-4c73-87f2-ac109e499c06/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d9e162ce-7527-4c73-87f2-ac109e499c06/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d9e162ce-7527-4c73-87f2-ac109e499c06/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi000_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d9e162ce-7527-4c73-87f2-ac109e499c06/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d9e162ce-7527-4c73-87f2-ac109e499c06/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 c3dc71537b9a4a93609d1b2b43dd9efd139178bf ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:28:46,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:28:46,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:28:46,285 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:28:46,286 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:28:46,286 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:28:46,287 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:28:46,289 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:28:46,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:28:46,291 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:28:46,291 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:28:46,292 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:28:46,292 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:28:46,293 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:28:46,294 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:28:46,294 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:28:46,295 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:28:46,296 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:28:46,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:28:46,298 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:28:46,299 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:28:46,300 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:28:46,301 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:28:46,301 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:28:46,303 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:28:46,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:28:46,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:28:46,303 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:28:46,304 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:28:46,304 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:28:46,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:28:46,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:28:46,305 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:28:46,306 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:28:46,306 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:28:46,306 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:28:46,307 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:28:46,307 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:28:46,307 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:28:46,308 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:28:46,308 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:28:46,308 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d9e162ce-7527-4c73-87f2-ac109e499c06/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:28:46,317 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:28:46,317 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:28:46,318 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:28:46,318 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:28:46,318 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:28:46,318 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:28:46,318 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:28:46,319 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:28:46,319 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:28:46,319 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:28:46,319 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:28:46,319 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:28:46,319 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:28:46,319 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:28:46,319 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:28:46,319 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:28:46,319 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:28:46,320 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:28:46,320 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:28:46,320 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:28:46,320 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:28:46,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:28:46,320 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:28:46,320 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:28:46,320 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:28:46,320 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:28:46,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:28:46,321 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:28:46,321 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:28:46,321 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_d9e162ce-7527-4c73-87f2-ac109e499c06/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 -> c3dc71537b9a4a93609d1b2b43dd9efd139178bf [2019-12-07 17:28:46,422 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:28:46,431 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:28:46,434 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:28:46,435 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:28:46,435 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:28:46,436 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d9e162ce-7527-4c73-87f2-ac109e499c06/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi000_pso.oepc.i [2019-12-07 17:28:46,478 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d9e162ce-7527-4c73-87f2-ac109e499c06/bin/uautomizer/data/acde0d2f2/4ab674cd266e4ded8ba31abda02dfe44/FLAG42d0c74e3 [2019-12-07 17:28:46,856 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:28:46,856 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d9e162ce-7527-4c73-87f2-ac109e499c06/sv-benchmarks/c/pthread-wmm/rfi000_pso.oepc.i [2019-12-07 17:28:46,869 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d9e162ce-7527-4c73-87f2-ac109e499c06/bin/uautomizer/data/acde0d2f2/4ab674cd266e4ded8ba31abda02dfe44/FLAG42d0c74e3 [2019-12-07 17:28:46,879 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d9e162ce-7527-4c73-87f2-ac109e499c06/bin/uautomizer/data/acde0d2f2/4ab674cd266e4ded8ba31abda02dfe44 [2019-12-07 17:28:46,880 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:28:46,881 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:28:46,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:28:46,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:28:46,885 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:28:46,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:28:46" (1/1) ... [2019-12-07 17:28:46,887 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d8e373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:28:46, skipping insertion in model container [2019-12-07 17:28:46,887 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:28:46" (1/1) ... [2019-12-07 17:28:46,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:28:46,929 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:28:47,229 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:28:47,238 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:28:47,297 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:28:47,344 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:28:47,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:28:47 WrapperNode [2019-12-07 17:28:47,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:28:47,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:28:47,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:28:47,345 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:28:47,351 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:28:47" (1/1) ... [2019-12-07 17:28:47,371 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:28:47" (1/1) ... [2019-12-07 17:28:47,398 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:28:47,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:28:47,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:28:47,398 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:28:47,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:28:47" (1/1) ... [2019-12-07 17:28:47,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:28:47" (1/1) ... [2019-12-07 17:28:47,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:28:47" (1/1) ... [2019-12-07 17:28:47,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:28:47" (1/1) ... [2019-12-07 17:28:47,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:28:47" (1/1) ... [2019-12-07 17:28:47,429 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:28:47" (1/1) ... [2019-12-07 17:28:47,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:28:47" (1/1) ... [2019-12-07 17:28:47,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:28:47,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:28:47,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:28:47,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:28:47,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:28:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d9e162ce-7527-4c73-87f2-ac109e499c06/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:28:47,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:28:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:28:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:28:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:28:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:28:47,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:28:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:28:47,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:28:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:28:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:28:47,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:28:47,487 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:28:47,943 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:28:47,943 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:28:47,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:28:47 BoogieIcfgContainer [2019-12-07 17:28:47,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:28:47,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:28:47,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:28:47,946 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:28:47,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:28:46" (1/3) ... [2019-12-07 17:28:47,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cc6d50f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:28:47, skipping insertion in model container [2019-12-07 17:28:47,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:28:47" (2/3) ... [2019-12-07 17:28:47,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cc6d50f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:28:47, skipping insertion in model container [2019-12-07 17:28:47,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:28:47" (3/3) ... [2019-12-07 17:28:47,948 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_pso.oepc.i [2019-12-07 17:28:47,955 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:28:47,955 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:28:47,960 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:28:47,960 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:28:47,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,989 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,989 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,990 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,990 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,990 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,995 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,995 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:47,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:28:48,025 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 17:28:48,038 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:28:48,038 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:28:48,038 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:28:48,038 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:28:48,038 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:28:48,039 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:28:48,039 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:28:48,039 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:28:48,051 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 231 places, 307 transitions [2019-12-07 17:28:48,052 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-07 17:28:48,131 INFO L134 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-07 17:28:48,131 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:28:48,149 INFO L76 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 83/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1205 event pairs. 6/226 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-07 17:28:48,187 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-07 17:28:48,242 INFO L134 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-07 17:28:48,242 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:28:48,255 INFO L76 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 83/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1205 event pairs. 6/226 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-07 17:28:48,289 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 41414 [2019-12-07 17:28:48,289 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:28:51,927 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 17:28:52,042 INFO L206 etLargeBlockEncoding]: Checked pairs total: 238871 [2019-12-07 17:28:52,042 INFO L214 etLargeBlockEncoding]: Total number of compositions: 134 [2019-12-07 17:28:52,044 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 150 places, 186 transitions [2019-12-07 17:28:55,409 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 55330 states. [2019-12-07 17:28:55,410 INFO L276 IsEmpty]: Start isEmpty. Operand 55330 states. [2019-12-07 17:28:55,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 17:28:55,414 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:55,414 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 17:28:55,415 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:28:55,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:55,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1316112, now seen corresponding path program 1 times [2019-12-07 17:28:55,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:55,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718718279] [2019-12-07 17:28:55,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:28:55,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718718279] [2019-12-07 17:28:55,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:55,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:28:55,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150531970] [2019-12-07 17:28:55,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:28:55,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:55,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:28:55,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:28:55,575 INFO L87 Difference]: Start difference. First operand 55330 states. Second operand 3 states. [2019-12-07 17:28:56,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:56,107 INFO L93 Difference]: Finished difference Result 55134 states and 195732 transitions. [2019-12-07 17:28:56,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:28:56,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 17:28:56,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:56,381 INFO L225 Difference]: With dead ends: 55134 [2019-12-07 17:28:56,381 INFO L226 Difference]: Without dead ends: 54186 [2019-12-07 17:28:56,382 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:28:57,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54186 states. [2019-12-07 17:28:57,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54186 to 54186. [2019-12-07 17:28:57,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54186 states. [2019-12-07 17:28:58,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54186 states to 54186 states and 192533 transitions. [2019-12-07 17:28:58,129 INFO L78 Accepts]: Start accepts. Automaton has 54186 states and 192533 transitions. Word has length 3 [2019-12-07 17:28:58,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:58,129 INFO L462 AbstractCegarLoop]: Abstraction has 54186 states and 192533 transitions. [2019-12-07 17:28:58,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:28:58,129 INFO L276 IsEmpty]: Start isEmpty. Operand 54186 states and 192533 transitions. [2019-12-07 17:28:58,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 17:28:58,131 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:58,131 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:28:58,131 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:28:58,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:58,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1209114037, now seen corresponding path program 1 times [2019-12-07 17:28:58,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:58,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832852709] [2019-12-07 17:28:58,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:58,202 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:28:58,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832852709] [2019-12-07 17:28:58,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:58,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:28:58,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640036535] [2019-12-07 17:28:58,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:28:58,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:58,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:28:58,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:28:58,204 INFO L87 Difference]: Start difference. First operand 54186 states and 192533 transitions. Second operand 4 states. [2019-12-07 17:28:58,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:58,889 INFO L93 Difference]: Finished difference Result 73782 states and 254483 transitions. [2019-12-07 17:28:58,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:28:58,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 17:28:58,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:59,038 INFO L225 Difference]: With dead ends: 73782 [2019-12-07 17:28:59,038 INFO L226 Difference]: Without dead ends: 73782 [2019-12-07 17:28:59,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:28:59,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73782 states. [2019-12-07 17:29:00,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73782 to 73598. [2019-12-07 17:29:00,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73598 states. [2019-12-07 17:29:00,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73598 states to 73598 states and 253973 transitions. [2019-12-07 17:29:00,882 INFO L78 Accepts]: Start accepts. Automaton has 73598 states and 253973 transitions. Word has length 11 [2019-12-07 17:29:00,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:00,882 INFO L462 AbstractCegarLoop]: Abstraction has 73598 states and 253973 transitions. [2019-12-07 17:29:00,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:29:00,882 INFO L276 IsEmpty]: Start isEmpty. Operand 73598 states and 253973 transitions. [2019-12-07 17:29:00,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:29:00,887 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:00,887 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:00,887 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:00,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:00,887 INFO L82 PathProgramCache]: Analyzing trace with hash 196484102, now seen corresponding path program 1 times [2019-12-07 17:29:00,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:00,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540334800] [2019-12-07 17:29:00,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:00,939 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:00,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540334800] [2019-12-07 17:29:00,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:00,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:29:00,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550072235] [2019-12-07 17:29:00,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:29:00,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:00,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:29:00,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:29:00,941 INFO L87 Difference]: Start difference. First operand 73598 states and 253973 transitions. Second operand 4 states. [2019-12-07 17:29:01,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:01,539 INFO L93 Difference]: Finished difference Result 91082 states and 310643 transitions. [2019-12-07 17:29:01,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:29:01,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 17:29:01,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:01,757 INFO L225 Difference]: With dead ends: 91082 [2019-12-07 17:29:01,757 INFO L226 Difference]: Without dead ends: 91082 [2019-12-07 17:29:01,758 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:02,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91082 states. [2019-12-07 17:29:03,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91082 to 84490. [2019-12-07 17:29:03,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84490 states. [2019-12-07 17:29:03,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84490 states to 84490 states and 288958 transitions. [2019-12-07 17:29:03,830 INFO L78 Accepts]: Start accepts. Automaton has 84490 states and 288958 transitions. Word has length 14 [2019-12-07 17:29:03,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:03,830 INFO L462 AbstractCegarLoop]: Abstraction has 84490 states and 288958 transitions. [2019-12-07 17:29:03,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:29:03,831 INFO L276 IsEmpty]: Start isEmpty. Operand 84490 states and 288958 transitions. [2019-12-07 17:29:03,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:29:03,836 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:03,836 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:03,836 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:03,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:03,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1667995754, now seen corresponding path program 1 times [2019-12-07 17:29:03,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:03,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746805674] [2019-12-07 17:29:03,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:03,888 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:03,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746805674] [2019-12-07 17:29:03,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:03,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:29:03,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118195415] [2019-12-07 17:29:03,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:29:03,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:03,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:29:03,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:29:03,890 INFO L87 Difference]: Start difference. First operand 84490 states and 288958 transitions. Second operand 4 states. [2019-12-07 17:29:03,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:03,928 INFO L93 Difference]: Finished difference Result 8514 states and 21866 transitions. [2019-12-07 17:29:03,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:29:03,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 17:29:03,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:03,934 INFO L225 Difference]: With dead ends: 8514 [2019-12-07 17:29:03,934 INFO L226 Difference]: Without dead ends: 7230 [2019-12-07 17:29:03,935 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:03,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7230 states. [2019-12-07 17:29:04,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7230 to 7222. [2019-12-07 17:29:04,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7222 states. [2019-12-07 17:29:04,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7222 states to 7222 states and 17730 transitions. [2019-12-07 17:29:04,010 INFO L78 Accepts]: Start accepts. Automaton has 7222 states and 17730 transitions. Word has length 20 [2019-12-07 17:29:04,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:04,010 INFO L462 AbstractCegarLoop]: Abstraction has 7222 states and 17730 transitions. [2019-12-07 17:29:04,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:29:04,010 INFO L276 IsEmpty]: Start isEmpty. Operand 7222 states and 17730 transitions. [2019-12-07 17:29:04,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 17:29:04,012 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:04,012 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:04,012 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:04,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:04,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1725930936, now seen corresponding path program 1 times [2019-12-07 17:29:04,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:04,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42907170] [2019-12-07 17:29:04,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:04,070 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:04,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42907170] [2019-12-07 17:29:04,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:04,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:29:04,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991743917] [2019-12-07 17:29:04,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:29:04,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:04,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:29:04,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:29:04,071 INFO L87 Difference]: Start difference. First operand 7222 states and 17730 transitions. Second operand 5 states. [2019-12-07 17:29:04,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:04,362 INFO L93 Difference]: Finished difference Result 8308 states and 20180 transitions. [2019-12-07 17:29:04,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:29:04,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 17:29:04,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:04,368 INFO L225 Difference]: With dead ends: 8308 [2019-12-07 17:29:04,368 INFO L226 Difference]: Without dead ends: 8308 [2019-12-07 17:29:04,369 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:29:04,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8308 states. [2019-12-07 17:29:04,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8308 to 8206. [2019-12-07 17:29:04,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8206 states. [2019-12-07 17:29:04,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8206 states to 8206 states and 19982 transitions. [2019-12-07 17:29:04,449 INFO L78 Accepts]: Start accepts. Automaton has 8206 states and 19982 transitions. Word has length 30 [2019-12-07 17:29:04,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:04,450 INFO L462 AbstractCegarLoop]: Abstraction has 8206 states and 19982 transitions. [2019-12-07 17:29:04,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:29:04,450 INFO L276 IsEmpty]: Start isEmpty. Operand 8206 states and 19982 transitions. [2019-12-07 17:29:04,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 17:29:04,452 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:04,452 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:04,452 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:04,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:04,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1964223061, now seen corresponding path program 1 times [2019-12-07 17:29:04,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:04,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571089091] [2019-12-07 17:29:04,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:04,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:04,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571089091] [2019-12-07 17:29:04,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:04,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:29:04,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974638248] [2019-12-07 17:29:04,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:29:04,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:04,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:29:04,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:29:04,477 INFO L87 Difference]: Start difference. First operand 8206 states and 19982 transitions. Second operand 3 states. [2019-12-07 17:29:04,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:04,554 INFO L93 Difference]: Finished difference Result 12335 states and 28548 transitions. [2019-12-07 17:29:04,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:29:04,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-07 17:29:04,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:04,565 INFO L225 Difference]: With dead ends: 12335 [2019-12-07 17:29:04,565 INFO L226 Difference]: Without dead ends: 12335 [2019-12-07 17:29:04,566 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:04,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12335 states. [2019-12-07 17:29:04,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12335 to 11324. [2019-12-07 17:29:04,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11324 states. [2019-12-07 17:29:04,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11324 states to 11324 states and 26462 transitions. [2019-12-07 17:29:04,714 INFO L78 Accepts]: Start accepts. Automaton has 11324 states and 26462 transitions. Word has length 31 [2019-12-07 17:29:04,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:04,714 INFO L462 AbstractCegarLoop]: Abstraction has 11324 states and 26462 transitions. [2019-12-07 17:29:04,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:29:04,714 INFO L276 IsEmpty]: Start isEmpty. Operand 11324 states and 26462 transitions. [2019-12-07 17:29:04,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 17:29:04,717 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:04,717 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:04,717 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:04,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:04,718 INFO L82 PathProgramCache]: Analyzing trace with hash -71378589, now seen corresponding path program 1 times [2019-12-07 17:29:04,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:04,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936954224] [2019-12-07 17:29:04,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:04,784 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:04,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936954224] [2019-12-07 17:29:04,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:04,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:29:04,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845604828] [2019-12-07 17:29:04,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:29:04,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:04,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:29:04,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:29:04,785 INFO L87 Difference]: Start difference. First operand 11324 states and 26462 transitions. Second operand 5 states. [2019-12-07 17:29:05,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:05,092 INFO L93 Difference]: Finished difference Result 12877 states and 29790 transitions. [2019-12-07 17:29:05,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:29:05,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 17:29:05,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:05,103 INFO L225 Difference]: With dead ends: 12877 [2019-12-07 17:29:05,103 INFO L226 Difference]: Without dead ends: 12877 [2019-12-07 17:29:05,103 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:29:05,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12877 states. [2019-12-07 17:29:05,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12877 to 11566. [2019-12-07 17:29:05,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11566 states. [2019-12-07 17:29:05,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11566 states to 11566 states and 27002 transitions. [2019-12-07 17:29:05,217 INFO L78 Accepts]: Start accepts. Automaton has 11566 states and 27002 transitions. Word has length 33 [2019-12-07 17:29:05,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:05,218 INFO L462 AbstractCegarLoop]: Abstraction has 11566 states and 27002 transitions. [2019-12-07 17:29:05,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:29:05,218 INFO L276 IsEmpty]: Start isEmpty. Operand 11566 states and 27002 transitions. [2019-12-07 17:29:05,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 17:29:05,224 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:05,224 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:05,224 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:05,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:05,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1192698792, now seen corresponding path program 1 times [2019-12-07 17:29:05,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:05,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868408288] [2019-12-07 17:29:05,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:05,293 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:05,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868408288] [2019-12-07 17:29:05,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:05,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:29:05,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491798677] [2019-12-07 17:29:05,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:29:05,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:05,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:29:05,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:29:05,295 INFO L87 Difference]: Start difference. First operand 11566 states and 27002 transitions. Second operand 5 states. [2019-12-07 17:29:05,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:05,334 INFO L93 Difference]: Finished difference Result 2231 states and 4806 transitions. [2019-12-07 17:29:05,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:29:05,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-07 17:29:05,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:05,336 INFO L225 Difference]: With dead ends: 2231 [2019-12-07 17:29:05,336 INFO L226 Difference]: Without dead ends: 2067 [2019-12-07 17:29:05,336 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:05,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2019-12-07 17:29:05,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 2029. [2019-12-07 17:29:05,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states. [2019-12-07 17:29:05,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 4378 transitions. [2019-12-07 17:29:05,352 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 4378 transitions. Word has length 42 [2019-12-07 17:29:05,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:05,353 INFO L462 AbstractCegarLoop]: Abstraction has 2029 states and 4378 transitions. [2019-12-07 17:29:05,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:29:05,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 4378 transitions. [2019-12-07 17:29:05,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 17:29:05,354 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:05,355 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:05,355 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:05,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:05,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1557518893, now seen corresponding path program 1 times [2019-12-07 17:29:05,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:05,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493122903] [2019-12-07 17:29:05,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:05,443 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:05,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493122903] [2019-12-07 17:29:05,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:05,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:29:05,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719741219] [2019-12-07 17:29:05,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:29:05,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:05,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:29:05,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:29:05,444 INFO L87 Difference]: Start difference. First operand 2029 states and 4378 transitions. Second operand 6 states. [2019-12-07 17:29:05,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:05,667 INFO L93 Difference]: Finished difference Result 2332 states and 4945 transitions. [2019-12-07 17:29:05,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:29:05,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-07 17:29:05,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:05,669 INFO L225 Difference]: With dead ends: 2332 [2019-12-07 17:29:05,669 INFO L226 Difference]: Without dead ends: 2307 [2019-12-07 17:29:05,669 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:29:05,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-12-07 17:29:05,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2245. [2019-12-07 17:29:05,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2019-12-07 17:29:05,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 4780 transitions. [2019-12-07 17:29:05,687 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 4780 transitions. Word has length 43 [2019-12-07 17:29:05,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:05,687 INFO L462 AbstractCegarLoop]: Abstraction has 2245 states and 4780 transitions. [2019-12-07 17:29:05,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:29:05,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 4780 transitions. [2019-12-07 17:29:05,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 17:29:05,689 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:05,690 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] [2019-12-07 17:29:05,690 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:05,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:05,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1777006862, now seen corresponding path program 1 times [2019-12-07 17:29:05,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:05,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490146918] [2019-12-07 17:29:05,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:05,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:05,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490146918] [2019-12-07 17:29:05,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:05,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:29:05,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234366215] [2019-12-07 17:29:05,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:29:05,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:05,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:29:05,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:29:05,714 INFO L87 Difference]: Start difference. First operand 2245 states and 4780 transitions. Second operand 3 states. [2019-12-07 17:29:05,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:05,760 INFO L93 Difference]: Finished difference Result 2436 states and 4911 transitions. [2019-12-07 17:29:05,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:29:05,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-12-07 17:29:05,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:05,762 INFO L225 Difference]: With dead ends: 2436 [2019-12-07 17:29:05,762 INFO L226 Difference]: Without dead ends: 2436 [2019-12-07 17:29:05,762 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:05,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2019-12-07 17:29:05,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 2189. [2019-12-07 17:29:05,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2189 states. [2019-12-07 17:29:05,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 4433 transitions. [2019-12-07 17:29:05,781 INFO L78 Accepts]: Start accepts. Automaton has 2189 states and 4433 transitions. Word has length 46 [2019-12-07 17:29:05,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:05,781 INFO L462 AbstractCegarLoop]: Abstraction has 2189 states and 4433 transitions. [2019-12-07 17:29:05,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:29:05,781 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 4433 transitions. [2019-12-07 17:29:05,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 17:29:05,784 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:05,784 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] [2019-12-07 17:29:05,784 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:05,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:05,784 INFO L82 PathProgramCache]: Analyzing trace with hash -753849587, now seen corresponding path program 1 times [2019-12-07 17:29:05,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:05,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516074899] [2019-12-07 17:29:05,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:05,871 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:05,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516074899] [2019-12-07 17:29:05,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:05,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:29:05,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906896379] [2019-12-07 17:29:05,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:29:05,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:05,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:29:05,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:29:05,872 INFO L87 Difference]: Start difference. First operand 2189 states and 4433 transitions. Second operand 6 states. [2019-12-07 17:29:06,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:06,094 INFO L93 Difference]: Finished difference Result 2336 states and 4693 transitions. [2019-12-07 17:29:06,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:29:06,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-12-07 17:29:06,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:06,096 INFO L225 Difference]: With dead ends: 2336 [2019-12-07 17:29:06,096 INFO L226 Difference]: Without dead ends: 2268 [2019-12-07 17:29:06,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:29:06,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2019-12-07 17:29:06,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 2036. [2019-12-07 17:29:06,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2036 states. [2019-12-07 17:29:06,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 2036 states and 4127 transitions. [2019-12-07 17:29:06,112 INFO L78 Accepts]: Start accepts. Automaton has 2036 states and 4127 transitions. Word has length 49 [2019-12-07 17:29:06,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:06,112 INFO L462 AbstractCegarLoop]: Abstraction has 2036 states and 4127 transitions. [2019-12-07 17:29:06,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:29:06,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 4127 transitions. [2019-12-07 17:29:06,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 17:29:06,115 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:06,115 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:06,115 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:06,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:06,115 INFO L82 PathProgramCache]: Analyzing trace with hash -253914571, now seen corresponding path program 1 times [2019-12-07 17:29:06,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:06,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831014023] [2019-12-07 17:29:06,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:06,185 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:06,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831014023] [2019-12-07 17:29:06,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:06,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:29:06,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862537322] [2019-12-07 17:29:06,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:29:06,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:06,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:29:06,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:29:06,187 INFO L87 Difference]: Start difference. First operand 2036 states and 4127 transitions. Second operand 5 states. [2019-12-07 17:29:06,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:06,310 INFO L93 Difference]: Finished difference Result 3209 states and 6530 transitions. [2019-12-07 17:29:06,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:29:06,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-12-07 17:29:06,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:06,312 INFO L225 Difference]: With dead ends: 3209 [2019-12-07 17:29:06,313 INFO L226 Difference]: Without dead ends: 3209 [2019-12-07 17:29:06,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:29:06,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3209 states. [2019-12-07 17:29:06,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3209 to 2789. [2019-12-07 17:29:06,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2789 states. [2019-12-07 17:29:06,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 5726 transitions. [2019-12-07 17:29:06,336 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 5726 transitions. Word has length 85 [2019-12-07 17:29:06,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:06,336 INFO L462 AbstractCegarLoop]: Abstraction has 2789 states and 5726 transitions. [2019-12-07 17:29:06,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:29:06,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 5726 transitions. [2019-12-07 17:29:06,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 17:29:06,339 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:06,339 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:06,339 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:06,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:06,339 INFO L82 PathProgramCache]: Analyzing trace with hash -963574665, now seen corresponding path program 1 times [2019-12-07 17:29:06,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:06,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519205133] [2019-12-07 17:29:06,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:06,465 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:06,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519205133] [2019-12-07 17:29:06,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:06,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:29:06,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372495673] [2019-12-07 17:29:06,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:29:06,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:06,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:29:06,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:29:06,466 INFO L87 Difference]: Start difference. First operand 2789 states and 5726 transitions. Second operand 9 states. [2019-12-07 17:29:07,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:07,061 INFO L93 Difference]: Finished difference Result 10514 states and 21499 transitions. [2019-12-07 17:29:07,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 17:29:07,061 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-12-07 17:29:07,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:07,067 INFO L225 Difference]: With dead ends: 10514 [2019-12-07 17:29:07,067 INFO L226 Difference]: Without dead ends: 8419 [2019-12-07 17:29:07,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2019-12-07 17:29:07,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8419 states. [2019-12-07 17:29:07,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8419 to 2916. [2019-12-07 17:29:07,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2916 states. [2019-12-07 17:29:07,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 5969 transitions. [2019-12-07 17:29:07,108 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 5969 transitions. Word has length 86 [2019-12-07 17:29:07,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:07,108 INFO L462 AbstractCegarLoop]: Abstraction has 2916 states and 5969 transitions. [2019-12-07 17:29:07,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:29:07,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 5969 transitions. [2019-12-07 17:29:07,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 17:29:07,111 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:07,111 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:07,112 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:07,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:07,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1447020425, now seen corresponding path program 2 times [2019-12-07 17:29:07,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:07,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217872026] [2019-12-07 17:29:07,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:07,275 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:07,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217872026] [2019-12-07 17:29:07,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:07,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 17:29:07,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950269450] [2019-12-07 17:29:07,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:29:07,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:07,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:29:07,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:29:07,276 INFO L87 Difference]: Start difference. First operand 2916 states and 5969 transitions. Second operand 11 states. [2019-12-07 17:29:08,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:08,180 INFO L93 Difference]: Finished difference Result 4754 states and 9513 transitions. [2019-12-07 17:29:08,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:29:08,181 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2019-12-07 17:29:08,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:08,183 INFO L225 Difference]: With dead ends: 4754 [2019-12-07 17:29:08,184 INFO L226 Difference]: Without dead ends: 4748 [2019-12-07 17:29:08,184 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-07 17:29:08,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4748 states. [2019-12-07 17:29:08,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4748 to 3648. [2019-12-07 17:29:08,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3648 states. [2019-12-07 17:29:08,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3648 states to 3648 states and 7395 transitions. [2019-12-07 17:29:08,222 INFO L78 Accepts]: Start accepts. Automaton has 3648 states and 7395 transitions. Word has length 86 [2019-12-07 17:29:08,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:08,223 INFO L462 AbstractCegarLoop]: Abstraction has 3648 states and 7395 transitions. [2019-12-07 17:29:08,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:29:08,223 INFO L276 IsEmpty]: Start isEmpty. Operand 3648 states and 7395 transitions. [2019-12-07 17:29:08,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 17:29:08,226 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:08,226 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:08,226 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:08,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:08,227 INFO L82 PathProgramCache]: Analyzing trace with hash -499246417, now seen corresponding path program 3 times [2019-12-07 17:29:08,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:08,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897057116] [2019-12-07 17:29:08,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:08,271 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:08,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897057116] [2019-12-07 17:29:08,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:08,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:29:08,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751579800] [2019-12-07 17:29:08,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:29:08,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:08,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:29:08,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:29:08,272 INFO L87 Difference]: Start difference. First operand 3648 states and 7395 transitions. Second operand 3 states. [2019-12-07 17:29:08,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:08,301 INFO L93 Difference]: Finished difference Result 3647 states and 7393 transitions. [2019-12-07 17:29:08,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:29:08,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-12-07 17:29:08,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:08,304 INFO L225 Difference]: With dead ends: 3647 [2019-12-07 17:29:08,304 INFO L226 Difference]: Without dead ends: 3647 [2019-12-07 17:29:08,304 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:08,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3647 states. [2019-12-07 17:29:08,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3647 to 3322. [2019-12-07 17:29:08,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3322 states. [2019-12-07 17:29:08,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3322 states to 3322 states and 6778 transitions. [2019-12-07 17:29:08,335 INFO L78 Accepts]: Start accepts. Automaton has 3322 states and 6778 transitions. Word has length 86 [2019-12-07 17:29:08,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:08,335 INFO L462 AbstractCegarLoop]: Abstraction has 3322 states and 6778 transitions. [2019-12-07 17:29:08,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:29:08,335 INFO L276 IsEmpty]: Start isEmpty. Operand 3322 states and 6778 transitions. [2019-12-07 17:29:08,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 17:29:08,339 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:08,339 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:08,339 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:08,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:08,339 INFO L82 PathProgramCache]: Analyzing trace with hash -339855243, now seen corresponding path program 1 times [2019-12-07 17:29:08,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:08,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903070004] [2019-12-07 17:29:08,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:08,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903070004] [2019-12-07 17:29:08,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:08,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:29:08,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545197567] [2019-12-07 17:29:08,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:29:08,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:08,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:29:08,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:29:08,448 INFO L87 Difference]: Start difference. First operand 3322 states and 6778 transitions. Second operand 9 states. [2019-12-07 17:29:08,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:08,999 INFO L93 Difference]: Finished difference Result 8895 states and 18117 transitions. [2019-12-07 17:29:09,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 17:29:09,000 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-12-07 17:29:09,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:09,004 INFO L225 Difference]: With dead ends: 8895 [2019-12-07 17:29:09,005 INFO L226 Difference]: Without dead ends: 6793 [2019-12-07 17:29:09,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2019-12-07 17:29:09,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6793 states. [2019-12-07 17:29:09,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6793 to 3630. [2019-12-07 17:29:09,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3630 states. [2019-12-07 17:29:09,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3630 states to 3630 states and 7352 transitions. [2019-12-07 17:29:09,050 INFO L78 Accepts]: Start accepts. Automaton has 3630 states and 7352 transitions. Word has length 87 [2019-12-07 17:29:09,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:09,051 INFO L462 AbstractCegarLoop]: Abstraction has 3630 states and 7352 transitions. [2019-12-07 17:29:09,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:29:09,051 INFO L276 IsEmpty]: Start isEmpty. Operand 3630 states and 7352 transitions. [2019-12-07 17:29:09,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 17:29:09,055 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:09,055 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:09,055 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:09,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:09,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1343981707, now seen corresponding path program 2 times [2019-12-07 17:29:09,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:09,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876925794] [2019-12-07 17:29:09,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:09,105 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:09,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876925794] [2019-12-07 17:29:09,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:09,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:29:09,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672411923] [2019-12-07 17:29:09,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:29:09,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:09,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:29:09,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:29:09,107 INFO L87 Difference]: Start difference. First operand 3630 states and 7352 transitions. Second operand 4 states. [2019-12-07 17:29:09,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:09,138 INFO L93 Difference]: Finished difference Result 5782 states and 11626 transitions. [2019-12-07 17:29:09,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:29:09,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-12-07 17:29:09,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:09,140 INFO L225 Difference]: With dead ends: 5782 [2019-12-07 17:29:09,140 INFO L226 Difference]: Without dead ends: 2199 [2019-12-07 17:29:09,141 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:09,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2199 states. [2019-12-07 17:29:09,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2199 to 2199. [2019-12-07 17:29:09,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2199 states. [2019-12-07 17:29:09,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2199 states to 2199 states and 4361 transitions. [2019-12-07 17:29:09,164 INFO L78 Accepts]: Start accepts. Automaton has 2199 states and 4361 transitions. Word has length 87 [2019-12-07 17:29:09,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:09,164 INFO L462 AbstractCegarLoop]: Abstraction has 2199 states and 4361 transitions. [2019-12-07 17:29:09,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:29:09,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2199 states and 4361 transitions. [2019-12-07 17:29:09,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 17:29:09,167 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:09,167 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,168 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:09,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:09,168 INFO L82 PathProgramCache]: Analyzing trace with hash -768002551, now seen corresponding path program 3 times [2019-12-07 17:29:09,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:09,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816186425] [2019-12-07 17:29:09,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:09,456 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:09,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816186425] [2019-12-07 17:29:09,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:09,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-07 17:29:09,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445580885] [2019-12-07 17:29:09,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 17:29:09,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:09,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 17:29:09,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-12-07 17:29:09,458 INFO L87 Difference]: Start difference. First operand 2199 states and 4361 transitions. Second operand 20 states. [2019-12-07 17:29:10,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:10,118 INFO L93 Difference]: Finished difference Result 3472 states and 6776 transitions. [2019-12-07 17:29:10,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 17:29:10,118 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 87 [2019-12-07 17:29:10,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:10,120 INFO L225 Difference]: With dead ends: 3472 [2019-12-07 17:29:10,121 INFO L226 Difference]: Without dead ends: 3431 [2019-12-07 17:29:10,121 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 17:29:10,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3431 states. [2019-12-07 17:29:10,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3431 to 2634. [2019-12-07 17:29:10,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2634 states. [2019-12-07 17:29:10,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 5165 transitions. [2019-12-07 17:29:10,144 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 5165 transitions. Word has length 87 [2019-12-07 17:29:10,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:10,144 INFO L462 AbstractCegarLoop]: Abstraction has 2634 states and 5165 transitions. [2019-12-07 17:29:10,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 17:29:10,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 5165 transitions. [2019-12-07 17:29:10,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 17:29:10,147 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:10,147 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,147 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:10,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:10,148 INFO L82 PathProgramCache]: Analyzing trace with hash 927908343, now seen corresponding path program 4 times [2019-12-07 17:29:10,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:10,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306706545] [2019-12-07 17:29:10,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:29:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:29:10,234 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:29:10,234 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:29:10,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1301] [1301] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1589~0.base_22|) (= v_~y$r_buff0_thd0~0_332 0) (= 0 v_~x~0_194) (= |v_#NULL.offset_7| 0) (= v_~y$w_buff1~0_277 0) (= v_~__unbuffered_p1_EBX~0_58 0) (= v_~y$flush_delayed~0_268 0) (= v_~main$tmp_guard0~0_27 0) (= v_~y$r_buff0_thd1~0_239 0) (= 0 v_~weak$$choice0~0_149) (= v_~y$w_buff1_used~0_756 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_88) (< 0 |v_#StackHeapBarrier_15|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1589~0.base_22| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1589~0.base_22|) |v_ULTIMATE.start_main_~#t1589~0.offset_16| 0)) |v_#memory_int_17|) (= 0 v_~y$r_buff1_thd2~0_570) (= v_~y$r_buff1_thd0~0_410 0) (= 0 v_~y$r_buff0_thd2~0_605) (= 0 v_~__unbuffered_cnt~0_64) (= v_~weak$$choice2~0_244 0) (= 0 v_~y$w_buff0~0_330) (= (store .cse0 |v_ULTIMATE.start_main_~#t1589~0.base_22| 1) |v_#valid_52|) (= 0 |v_#NULL.base_7|) (= v_~y~0_435 0) (= v_~main$tmp_guard1~0_84 0) (= 0 |v_ULTIMATE.start_main_~#t1589~0.offset_16|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1589~0.base_22| 4)) (= 0 v_~y$read_delayed_var~0.offset_6) (= (select .cse0 |v_ULTIMATE.start_main_~#t1589~0.base_22|) 0) (= v_~y$mem_tmp~0_167 0) (= v_~y$r_buff1_thd1~0_207 0) (= v_~y$w_buff0_used~0_1139 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_180|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_36|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_70|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_29|, ULTIMATE.start_main_#t~nondet70=|v_ULTIMATE.start_main_#t~nondet70_164|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_20|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_47|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_30|, ~y$mem_tmp~0=v_~y$mem_tmp~0_167, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_88, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_63|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_239, ~y$flush_delayed~0=v_~y$flush_delayed~0_268, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_15|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_80|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_68|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_74|, ULTIMATE.start_main_~#t1589~0.base=|v_ULTIMATE.start_main_~#t1589~0.base_22|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_34|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_393|, ~weak$$choice0~0=v_~weak$$choice0~0_149, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_227|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_83|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t1590~0.base=|v_ULTIMATE.start_main_~#t1590~0.base_19|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_605, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_410, ~x~0=v_~x~0_194, ~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_1139, ULTIMATE.start_main_~#t1590~0.offset=|v_ULTIMATE.start_main_~#t1590~0.offset_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_84, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_26|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_61|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_44|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_30|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_48|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_207, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_24|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_151|, ~y$w_buff0~0=v_~y$w_buff0~0_330, ~y~0=v_~y~0_435, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_58, ULTIMATE.start_main_#t~nondet69=|v_ULTIMATE.start_main_#t~nondet69_164|, ULTIMATE.start_main_~#t1589~0.offset=|v_ULTIMATE.start_main_~#t1589~0.offset_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_8|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_96|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite76=|v_ULTIMATE.start_main_#t~ite76_63|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_25|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_570, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_240|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_141|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_332, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_17|, ~weak$$choice2~0=v_~weak$$choice2~0_244, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_756} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~nondet70, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~ite90, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet62, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_~#t1589~0.base, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t1590~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t1590~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet69, ULTIMATE.start_main_~#t1589~0.offset, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_#t~ite76, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:29:10,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1261] [1261] L813-1-->L815: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1590~0.base_10|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1590~0.base_10| 1)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1590~0.base_10|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1590~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1590~0.base_10|) |v_ULTIMATE.start_main_~#t1590~0.offset_9| 1)) |v_#memory_int_11|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1590~0.base_10| 4) |v_#length_11|) (not (= |v_ULTIMATE.start_main_~#t1590~0.base_10| 0)) (= 0 |v_ULTIMATE.start_main_~#t1590~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1590~0.offset=|v_ULTIMATE.start_main_~#t1590~0.offset_9|, ULTIMATE.start_main_~#t1590~0.base=|v_ULTIMATE.start_main_~#t1590~0.base_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_11|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1590~0.offset, ULTIMATE.start_main_~#t1590~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-07 17:29:10,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1182] [1182] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_6|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_6|) (= v_~y$w_buff0_used~0_345 v_~y$w_buff1_used~0_208) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0_used~0_344 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 0)) (= v_~y$w_buff0~0_64 v_~y$w_buff1~0_60) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_344 256) 0)) (not (= 0 (mod v_~y$w_buff1_used~0_208 256))))) 1 0)) (= 2 v_~y$w_buff0~0_63)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_6|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_345, ~y$w_buff0~0=v_~y$w_buff0~0_64, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_6|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_6|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_344, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_63, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_6|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_208} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:29:10,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1228] [1228] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In870660672 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite31_Out870660672| ~y$mem_tmp~0_In870660672)) (and .cse0 (= ~y~0_In870660672 |P1Thread1of1ForFork1_#t~ite31_Out870660672|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In870660672, ~y$flush_delayed~0=~y$flush_delayed~0_In870660672, ~y~0=~y~0_In870660672} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In870660672, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out870660672|, ~y$flush_delayed~0=~y$flush_delayed~0_In870660672, ~y~0=~y~0_In870660672} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 17:29:10,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1224] [1224] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-689113252 256)))) (or (and .cse0 (= ~y~0_In-689113252 |P1Thread1of1ForFork1_#t~ite54_Out-689113252|)) (and (not .cse0) (= ~y$mem_tmp~0_In-689113252 |P1Thread1of1ForFork1_#t~ite54_Out-689113252|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-689113252, ~y$flush_delayed~0=~y$flush_delayed~0_In-689113252, ~y~0=~y~0_In-689113252} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-689113252, ~y$flush_delayed~0=~y$flush_delayed~0_In-689113252, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-689113252|, ~y~0=~y~0_In-689113252} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 17:29:10,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1244] [1244] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-2058363713 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2058363713 256)))) (or (and (= ~y$w_buff0_used~0_In-2058363713 |P0Thread1of1ForFork0_#t~ite5_Out-2058363713|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-2058363713|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2058363713, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2058363713} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-2058363713|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2058363713, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2058363713} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:29:10,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1220] [1220] L740-->L740-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-2039050289 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In-2039050289 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2039050289 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-2039050289 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-2039050289| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-2039050289| ~y$w_buff1_used~0_In-2039050289) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2039050289, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2039050289, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2039050289, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2039050289} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-2039050289|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2039050289, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2039050289, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2039050289, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2039050289} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:29:10,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1209] [1209] L741-->L742: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In606338596 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In606338596 256))) (.cse1 (= ~y$r_buff0_thd1~0_Out606338596 ~y$r_buff0_thd1~0_In606338596))) (or (and .cse0 .cse1) (and (= 0 ~y$r_buff0_thd1~0_Out606338596) (not .cse0) (not .cse2)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In606338596, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In606338596} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In606338596, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out606338596|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out606338596} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:29:10,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1219] [1219] L742-->L742-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd1~0_In1545069664 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1545069664 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In1545069664 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1545069664 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1545069664| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out1545069664| ~y$r_buff1_thd1~0_In1545069664)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1545069664, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1545069664, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1545069664, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1545069664} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1545069664, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1545069664, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1545069664|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1545069664, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1545069664} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:29:10,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1254] [1254] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= v_~y$r_buff1_thd1~0_56 |v_P0Thread1of1ForFork0_#t~ite8_28|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_56, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} 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:10,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1217] [1217] L790-2-->L790-5: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-1747771478 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1747771478 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite56_Out-1747771478| |P1Thread1of1ForFork1_#t~ite55_Out-1747771478|))) (or (and (not .cse0) (= ~y$w_buff1~0_In-1747771478 |P1Thread1of1ForFork1_#t~ite55_Out-1747771478|) .cse1 (not .cse2)) (and (or .cse2 .cse0) .cse1 (= ~y~0_In-1747771478 |P1Thread1of1ForFork1_#t~ite55_Out-1747771478|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1747771478, ~y$w_buff1~0=~y$w_buff1~0_In-1747771478, ~y~0=~y~0_In-1747771478, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1747771478} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1747771478, ~y$w_buff1~0=~y$w_buff1~0_In-1747771478, P1Thread1of1ForFork1_#t~ite56=|P1Thread1of1ForFork1_#t~ite56_Out-1747771478|, P1Thread1of1ForFork1_#t~ite55=|P1Thread1of1ForFork1_#t~ite55_Out-1747771478|, ~y~0=~y~0_In-1747771478, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1747771478} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite56, P1Thread1of1ForFork1_#t~ite55] because there is no mapped edge [2019-12-07 17:29:10,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1240] [1240] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In527546237 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In527546237 256)))) (or (and (= ~y$w_buff0_used~0_In527546237 |P1Thread1of1ForFork1_#t~ite57_Out527546237|) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite57_Out527546237| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In527546237, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In527546237} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In527546237, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In527546237, P1Thread1of1ForFork1_#t~ite57=|P1Thread1of1ForFork1_#t~ite57_Out527546237|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite57] because there is no mapped edge [2019-12-07 17:29:10,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1210] [1210] L792-->L792-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1844400940 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1844400940 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1844400940 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1844400940 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite58_Out-1844400940| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite58_Out-1844400940| ~y$w_buff1_used~0_In-1844400940) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1844400940, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1844400940, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1844400940, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1844400940} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1844400940, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1844400940, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1844400940, P1Thread1of1ForFork1_#t~ite58=|P1Thread1of1ForFork1_#t~ite58_Out-1844400940|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1844400940} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite58] because there is no mapped edge [2019-12-07 17:29:10,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1218] [1218] L793-->L793-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-582091094 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-582091094 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-582091094 |P1Thread1of1ForFork1_#t~ite59_Out-582091094|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite59_Out-582091094|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-582091094, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-582091094} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-582091094, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-582091094, P1Thread1of1ForFork1_#t~ite59=|P1Thread1of1ForFork1_#t~ite59_Out-582091094|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite59] because there is no mapped edge [2019-12-07 17:29:10,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1237] [1237] L794-->L794-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1139663296 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1139663296 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1139663296 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1139663296 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite60_Out1139663296| 0)) (and (= |P1Thread1of1ForFork1_#t~ite60_Out1139663296| ~y$r_buff1_thd2~0_In1139663296) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1139663296, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1139663296, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1139663296, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1139663296} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1139663296, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1139663296, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out1139663296|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1139663296, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1139663296} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-07 17:29:10,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1271] [1271] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_267 |v_P1Thread1of1ForFork1_#t~ite60_38|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_267, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 17:29:10,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1171] [1171] L819-->L821-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_104 256)) (= 0 (mod v_~y$w_buff0_used~0_277 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_277, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_277, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:29:10,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1233] [1233] L821-2-->L821-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In787549958 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In787549958 256)))) (or (and (= ~y$w_buff1~0_In787549958 |ULTIMATE.start_main_#t~ite63_Out787549958|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In787549958 |ULTIMATE.start_main_#t~ite63_Out787549958|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In787549958, ~y~0=~y~0_In787549958, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In787549958, ~y$w_buff1_used~0=~y$w_buff1_used~0_In787549958} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out787549958|, ~y$w_buff1~0=~y$w_buff1~0_In787549958, ~y~0=~y~0_In787549958, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In787549958, ~y$w_buff1_used~0=~y$w_buff1_used~0_In787549958} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 17:29:10,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1179] [1179] L821-4-->L822: Formula: (= v_~y~0_95 |v_ULTIMATE.start_main_#t~ite63_11|) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_10|, ~y~0=v_~y~0_95, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ~y~0, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 17:29:10,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1236] [1236] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In610036583 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In610036583 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite65_Out610036583|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In610036583 |ULTIMATE.start_main_#t~ite65_Out610036583|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In610036583, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In610036583} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In610036583, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In610036583, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out610036583|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 17:29:10,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1246] [1246] L823-->L823-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In1708050795 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1708050795 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1708050795 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1708050795 256) 0))) (or (and (= ~y$w_buff1_used~0_In1708050795 |ULTIMATE.start_main_#t~ite66_Out1708050795|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite66_Out1708050795|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1708050795, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1708050795, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1708050795, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1708050795} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1708050795, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1708050795, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out1708050795|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1708050795, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1708050795} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 17:29:10,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1226] [1226] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-2145547487 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2145547487 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite67_Out-2145547487| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite67_Out-2145547487| ~y$r_buff0_thd0~0_In-2145547487) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2145547487, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2145547487} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2145547487, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2145547487, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out-2145547487|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 17:29:10,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1214] [1214] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1793185844 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1793185844 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1793185844 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1793185844 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite68_Out1793185844| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite68_Out1793185844| ~y$r_buff1_thd0~0_In1793185844)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1793185844, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1793185844, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1793185844, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1793185844} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1793185844, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1793185844, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out1793185844|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1793185844, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1793185844} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 17:29:10,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1216] [1216] L840-->L840-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1849190605 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite91_Out1849190605| ~y~0_In1849190605)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite91_Out1849190605| ~y$mem_tmp~0_In1849190605)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1849190605, ~y$flush_delayed~0=~y$flush_delayed~0_In1849190605, ~y~0=~y~0_In1849190605} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1849190605, ULTIMATE.start_main_#t~ite91=|ULTIMATE.start_main_#t~ite91_Out1849190605|, ~y$flush_delayed~0=~y$flush_delayed~0_In1849190605, ~y~0=~y~0_In1849190605} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite91] because there is no mapped edge [2019-12-07 17:29:10,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1284] [1284] L840-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_37 256)) (= v_~y~0_283 |v_ULTIMATE.start_main_#t~ite91_30|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~y$flush_delayed~0_174 0)) InVars {ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_30|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_29|, ~y$flush_delayed~0=v_~y$flush_delayed~0_174, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~y~0=v_~y~0_283, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite91, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:29:10,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:29:10 BasicIcfg [2019-12-07 17:29:10,321 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:29:10,322 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:29:10,322 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:29:10,322 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:29:10,322 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:28:47" (3/4) ... [2019-12-07 17:29:10,324 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:29:10,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1301] [1301] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1589~0.base_22|) (= v_~y$r_buff0_thd0~0_332 0) (= 0 v_~x~0_194) (= |v_#NULL.offset_7| 0) (= v_~y$w_buff1~0_277 0) (= v_~__unbuffered_p1_EBX~0_58 0) (= v_~y$flush_delayed~0_268 0) (= v_~main$tmp_guard0~0_27 0) (= v_~y$r_buff0_thd1~0_239 0) (= 0 v_~weak$$choice0~0_149) (= v_~y$w_buff1_used~0_756 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_88) (< 0 |v_#StackHeapBarrier_15|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1589~0.base_22| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1589~0.base_22|) |v_ULTIMATE.start_main_~#t1589~0.offset_16| 0)) |v_#memory_int_17|) (= 0 v_~y$r_buff1_thd2~0_570) (= v_~y$r_buff1_thd0~0_410 0) (= 0 v_~y$r_buff0_thd2~0_605) (= 0 v_~__unbuffered_cnt~0_64) (= v_~weak$$choice2~0_244 0) (= 0 v_~y$w_buff0~0_330) (= (store .cse0 |v_ULTIMATE.start_main_~#t1589~0.base_22| 1) |v_#valid_52|) (= 0 |v_#NULL.base_7|) (= v_~y~0_435 0) (= v_~main$tmp_guard1~0_84 0) (= 0 |v_ULTIMATE.start_main_~#t1589~0.offset_16|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1589~0.base_22| 4)) (= 0 v_~y$read_delayed_var~0.offset_6) (= (select .cse0 |v_ULTIMATE.start_main_~#t1589~0.base_22|) 0) (= v_~y$mem_tmp~0_167 0) (= v_~y$r_buff1_thd1~0_207 0) (= v_~y$w_buff0_used~0_1139 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_180|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_36|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_70|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_29|, ULTIMATE.start_main_#t~nondet70=|v_ULTIMATE.start_main_#t~nondet70_164|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_20|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_47|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_30|, ~y$mem_tmp~0=v_~y$mem_tmp~0_167, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_88, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_63|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_239, ~y$flush_delayed~0=v_~y$flush_delayed~0_268, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_15|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_80|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_68|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_74|, ULTIMATE.start_main_~#t1589~0.base=|v_ULTIMATE.start_main_~#t1589~0.base_22|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_34|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_393|, ~weak$$choice0~0=v_~weak$$choice0~0_149, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_227|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_83|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t1590~0.base=|v_ULTIMATE.start_main_~#t1590~0.base_19|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_605, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_410, ~x~0=v_~x~0_194, ~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_1139, ULTIMATE.start_main_~#t1590~0.offset=|v_ULTIMATE.start_main_~#t1590~0.offset_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_84, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_26|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_61|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_44|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_30|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_48|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_207, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_24|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_151|, ~y$w_buff0~0=v_~y$w_buff0~0_330, ~y~0=v_~y~0_435, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_58, ULTIMATE.start_main_#t~nondet69=|v_ULTIMATE.start_main_#t~nondet69_164|, ULTIMATE.start_main_~#t1589~0.offset=|v_ULTIMATE.start_main_~#t1589~0.offset_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_8|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_96|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite76=|v_ULTIMATE.start_main_#t~ite76_63|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_25|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_570, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_240|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_141|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_332, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_17|, ~weak$$choice2~0=v_~weak$$choice2~0_244, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_756} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~nondet70, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~ite90, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet62, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_~#t1589~0.base, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t1590~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t1590~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet69, ULTIMATE.start_main_~#t1589~0.offset, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_#t~ite76, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:29:10,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1261] [1261] L813-1-->L815: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1590~0.base_10|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1590~0.base_10| 1)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1590~0.base_10|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1590~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1590~0.base_10|) |v_ULTIMATE.start_main_~#t1590~0.offset_9| 1)) |v_#memory_int_11|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1590~0.base_10| 4) |v_#length_11|) (not (= |v_ULTIMATE.start_main_~#t1590~0.base_10| 0)) (= 0 |v_ULTIMATE.start_main_~#t1590~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1590~0.offset=|v_ULTIMATE.start_main_~#t1590~0.offset_9|, ULTIMATE.start_main_~#t1590~0.base=|v_ULTIMATE.start_main_~#t1590~0.base_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_11|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1590~0.offset, ULTIMATE.start_main_~#t1590~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-07 17:29:10,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1182] [1182] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_6|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_6|) (= v_~y$w_buff0_used~0_345 v_~y$w_buff1_used~0_208) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0_used~0_344 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 0)) (= v_~y$w_buff0~0_64 v_~y$w_buff1~0_60) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_344 256) 0)) (not (= 0 (mod v_~y$w_buff1_used~0_208 256))))) 1 0)) (= 2 v_~y$w_buff0~0_63)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_6|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_345, ~y$w_buff0~0=v_~y$w_buff0~0_64, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_6|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_6|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_344, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_63, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_6|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_208} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:29:10,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1228] [1228] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In870660672 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite31_Out870660672| ~y$mem_tmp~0_In870660672)) (and .cse0 (= ~y~0_In870660672 |P1Thread1of1ForFork1_#t~ite31_Out870660672|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In870660672, ~y$flush_delayed~0=~y$flush_delayed~0_In870660672, ~y~0=~y~0_In870660672} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In870660672, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out870660672|, ~y$flush_delayed~0=~y$flush_delayed~0_In870660672, ~y~0=~y~0_In870660672} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 17:29:10,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1224] [1224] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-689113252 256)))) (or (and .cse0 (= ~y~0_In-689113252 |P1Thread1of1ForFork1_#t~ite54_Out-689113252|)) (and (not .cse0) (= ~y$mem_tmp~0_In-689113252 |P1Thread1of1ForFork1_#t~ite54_Out-689113252|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-689113252, ~y$flush_delayed~0=~y$flush_delayed~0_In-689113252, ~y~0=~y~0_In-689113252} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-689113252, ~y$flush_delayed~0=~y$flush_delayed~0_In-689113252, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-689113252|, ~y~0=~y~0_In-689113252} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 17:29:10,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1244] [1244] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-2058363713 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2058363713 256)))) (or (and (= ~y$w_buff0_used~0_In-2058363713 |P0Thread1of1ForFork0_#t~ite5_Out-2058363713|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-2058363713|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2058363713, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2058363713} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-2058363713|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2058363713, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2058363713} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:29:10,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1220] [1220] L740-->L740-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-2039050289 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In-2039050289 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2039050289 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-2039050289 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-2039050289| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-2039050289| ~y$w_buff1_used~0_In-2039050289) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2039050289, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2039050289, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2039050289, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2039050289} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-2039050289|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2039050289, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2039050289, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2039050289, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2039050289} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:29:10,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1209] [1209] L741-->L742: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In606338596 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In606338596 256))) (.cse1 (= ~y$r_buff0_thd1~0_Out606338596 ~y$r_buff0_thd1~0_In606338596))) (or (and .cse0 .cse1) (and (= 0 ~y$r_buff0_thd1~0_Out606338596) (not .cse0) (not .cse2)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In606338596, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In606338596} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In606338596, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out606338596|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out606338596} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:29:10,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1219] [1219] L742-->L742-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd1~0_In1545069664 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1545069664 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In1545069664 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1545069664 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1545069664| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out1545069664| ~y$r_buff1_thd1~0_In1545069664)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1545069664, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1545069664, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1545069664, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1545069664} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1545069664, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1545069664, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1545069664|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1545069664, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1545069664} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:29:10,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1254] [1254] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= v_~y$r_buff1_thd1~0_56 |v_P0Thread1of1ForFork0_#t~ite8_28|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_56, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} 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:10,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1217] [1217] L790-2-->L790-5: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-1747771478 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1747771478 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite56_Out-1747771478| |P1Thread1of1ForFork1_#t~ite55_Out-1747771478|))) (or (and (not .cse0) (= ~y$w_buff1~0_In-1747771478 |P1Thread1of1ForFork1_#t~ite55_Out-1747771478|) .cse1 (not .cse2)) (and (or .cse2 .cse0) .cse1 (= ~y~0_In-1747771478 |P1Thread1of1ForFork1_#t~ite55_Out-1747771478|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1747771478, ~y$w_buff1~0=~y$w_buff1~0_In-1747771478, ~y~0=~y~0_In-1747771478, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1747771478} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1747771478, ~y$w_buff1~0=~y$w_buff1~0_In-1747771478, P1Thread1of1ForFork1_#t~ite56=|P1Thread1of1ForFork1_#t~ite56_Out-1747771478|, P1Thread1of1ForFork1_#t~ite55=|P1Thread1of1ForFork1_#t~ite55_Out-1747771478|, ~y~0=~y~0_In-1747771478, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1747771478} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite56, P1Thread1of1ForFork1_#t~ite55] because there is no mapped edge [2019-12-07 17:29:10,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1240] [1240] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In527546237 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In527546237 256)))) (or (and (= ~y$w_buff0_used~0_In527546237 |P1Thread1of1ForFork1_#t~ite57_Out527546237|) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite57_Out527546237| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In527546237, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In527546237} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In527546237, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In527546237, P1Thread1of1ForFork1_#t~ite57=|P1Thread1of1ForFork1_#t~ite57_Out527546237|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite57] because there is no mapped edge [2019-12-07 17:29:10,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1210] [1210] L792-->L792-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1844400940 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1844400940 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1844400940 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1844400940 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite58_Out-1844400940| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite58_Out-1844400940| ~y$w_buff1_used~0_In-1844400940) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1844400940, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1844400940, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1844400940, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1844400940} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1844400940, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1844400940, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1844400940, P1Thread1of1ForFork1_#t~ite58=|P1Thread1of1ForFork1_#t~ite58_Out-1844400940|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1844400940} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite58] because there is no mapped edge [2019-12-07 17:29:10,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1218] [1218] L793-->L793-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-582091094 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-582091094 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-582091094 |P1Thread1of1ForFork1_#t~ite59_Out-582091094|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite59_Out-582091094|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-582091094, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-582091094} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-582091094, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-582091094, P1Thread1of1ForFork1_#t~ite59=|P1Thread1of1ForFork1_#t~ite59_Out-582091094|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite59] because there is no mapped edge [2019-12-07 17:29:10,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1237] [1237] L794-->L794-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1139663296 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1139663296 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1139663296 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1139663296 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite60_Out1139663296| 0)) (and (= |P1Thread1of1ForFork1_#t~ite60_Out1139663296| ~y$r_buff1_thd2~0_In1139663296) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1139663296, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1139663296, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1139663296, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1139663296} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1139663296, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1139663296, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out1139663296|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1139663296, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1139663296} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-07 17:29:10,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1271] [1271] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_267 |v_P1Thread1of1ForFork1_#t~ite60_38|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_267, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 17:29:10,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1171] [1171] L819-->L821-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_104 256)) (= 0 (mod v_~y$w_buff0_used~0_277 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_277, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_277, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:29:10,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1233] [1233] L821-2-->L821-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In787549958 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In787549958 256)))) (or (and (= ~y$w_buff1~0_In787549958 |ULTIMATE.start_main_#t~ite63_Out787549958|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In787549958 |ULTIMATE.start_main_#t~ite63_Out787549958|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In787549958, ~y~0=~y~0_In787549958, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In787549958, ~y$w_buff1_used~0=~y$w_buff1_used~0_In787549958} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out787549958|, ~y$w_buff1~0=~y$w_buff1~0_In787549958, ~y~0=~y~0_In787549958, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In787549958, ~y$w_buff1_used~0=~y$w_buff1_used~0_In787549958} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 17:29:10,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1179] [1179] L821-4-->L822: Formula: (= v_~y~0_95 |v_ULTIMATE.start_main_#t~ite63_11|) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_10|, ~y~0=v_~y~0_95, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ~y~0, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 17:29:10,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1236] [1236] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In610036583 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In610036583 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite65_Out610036583|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In610036583 |ULTIMATE.start_main_#t~ite65_Out610036583|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In610036583, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In610036583} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In610036583, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In610036583, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out610036583|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 17:29:10,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1246] [1246] L823-->L823-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In1708050795 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1708050795 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1708050795 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1708050795 256) 0))) (or (and (= ~y$w_buff1_used~0_In1708050795 |ULTIMATE.start_main_#t~ite66_Out1708050795|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite66_Out1708050795|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1708050795, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1708050795, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1708050795, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1708050795} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1708050795, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1708050795, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out1708050795|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1708050795, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1708050795} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 17:29:10,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1226] [1226] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-2145547487 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2145547487 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite67_Out-2145547487| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite67_Out-2145547487| ~y$r_buff0_thd0~0_In-2145547487) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2145547487, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2145547487} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2145547487, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2145547487, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out-2145547487|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 17:29:10,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1214] [1214] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1793185844 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1793185844 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1793185844 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1793185844 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite68_Out1793185844| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite68_Out1793185844| ~y$r_buff1_thd0~0_In1793185844)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1793185844, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1793185844, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1793185844, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1793185844} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1793185844, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1793185844, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out1793185844|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1793185844, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1793185844} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 17:29:10,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1216] [1216] L840-->L840-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1849190605 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite91_Out1849190605| ~y~0_In1849190605)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite91_Out1849190605| ~y$mem_tmp~0_In1849190605)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1849190605, ~y$flush_delayed~0=~y$flush_delayed~0_In1849190605, ~y~0=~y~0_In1849190605} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1849190605, ULTIMATE.start_main_#t~ite91=|ULTIMATE.start_main_#t~ite91_Out1849190605|, ~y$flush_delayed~0=~y$flush_delayed~0_In1849190605, ~y~0=~y~0_In1849190605} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite91] because there is no mapped edge [2019-12-07 17:29:10,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1284] [1284] L840-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_37 256)) (= v_~y~0_283 |v_ULTIMATE.start_main_#t~ite91_30|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~y$flush_delayed~0_174 0)) InVars {ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_30|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_29|, ~y$flush_delayed~0=v_~y$flush_delayed~0_174, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~y~0=v_~y~0_283, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite91, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:29:10,417 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d9e162ce-7527-4c73-87f2-ac109e499c06/bin/uautomizer/witness.graphml [2019-12-07 17:29:10,417 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:29:10,418 INFO L168 Benchmark]: Toolchain (without parser) took 23537.07 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 939.3 MB in the beginning and 1.4 GB in the end (delta: -465.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-12-07 17:29:10,419 INFO L168 Benchmark]: CDTParser took 0.20 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:10,419 INFO L168 Benchmark]: CACSL2BoogieTranslator took 462.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -136.1 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:29:10,419 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.98 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:10,419 INFO L168 Benchmark]: Boogie Preprocessor took 40.12 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:10,420 INFO L168 Benchmark]: RCFGBuilder took 505.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 996.7 MB in the end (delta: 73.5 MB). Peak memory consumption was 73.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:29:10,420 INFO L168 Benchmark]: TraceAbstraction took 22376.82 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 996.7 MB in the beginning and 1.4 GB in the end (delta: -449.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 17:29:10,420 INFO L168 Benchmark]: Witness Printer took 95.72 ms. Allocated memory is still 2.7 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 40.7 MB). Peak memory consumption was 40.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:29:10,421 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.20 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 462.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -136.1 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.98 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.12 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. * RCFGBuilder took 505.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 996.7 MB in the end (delta: 73.5 MB). Peak memory consumption was 73.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22376.82 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 996.7 MB in the beginning and 1.4 GB in the end (delta: -449.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 95.72 ms. Allocated memory is still 2.7 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 40.7 MB). Peak memory consumption was 40.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 231 ProgramPointsBefore, 150 ProgramPointsAfterwards, 307 TransitionsBefore, 186 TransitionsAfterwards, 41414 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 69 ConcurrentYvCompositions, 43 ChoiceCompositions, 14826 VarBasedMoverChecksPositive, 421 VarBasedMoverChecksNegative, 121 SemBasedMoverChecksPositive, 422 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 238871 CheckedPairsTotal, 134 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t1589, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L815] FCALL, FORK 0 pthread_create(&t1590, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd1 = (_Bool)1 [L735] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 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, __unbuffered_p1_EBX=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 y = 1 [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 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)=1, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 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) [L763] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=2, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 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)) [L764] 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, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, 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=1, y$flush_delayed=1, y$mem_tmp=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 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)) [L765] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, 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))=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] 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, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, 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=1, y$flush_delayed=1, y$mem_tmp=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] 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)) [L767] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L768] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, 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))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 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)) [L769] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y = y$flush_delayed ? y$mem_tmp : y [L771] 2 y$flush_delayed = (_Bool)0 [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 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)=1, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 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) [L779] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=2, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L779] 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)) [L780] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=1, y$flush_delayed=1, y$mem_tmp=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 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)) [L781] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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))=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 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)) [L782] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=1, y$flush_delayed=1, y$mem_tmp=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L782] 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)) [L783] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L784] 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)) [L785] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 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) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 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 [L790] 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=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 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) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 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 [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 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 [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 0 y$flush_delayed = weak$$choice2 [L831] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L834] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L835] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L836] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L837] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L838] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 225 locations, 2 error locations. Result: UNSAFE, OverallTime: 22.1s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5931 SDtfs, 4922 SDslu, 19076 SDs, 0 SdLazy, 6296 SolverSat, 272 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 41 SyntacticMatches, 9 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84490occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 21095 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1013 NumberOfCodeBlocks, 1013 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 908 ConstructedInterpolants, 0 QuantifiedInterpolants, 294742 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...