./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix012_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_326922b3-18fa-49cf-a3db-e41119c26ecd/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_326922b3-18fa-49cf-a3db-e41119c26ecd/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_326922b3-18fa-49cf-a3db-e41119c26ecd/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_326922b3-18fa-49cf-a3db-e41119c26ecd/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_326922b3-18fa-49cf-a3db-e41119c26ecd/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_326922b3-18fa-49cf-a3db-e41119c26ecd/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 0a672d1b519511741231ff4d8f0dc06e3c2232de ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:54:01,317 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:54:01,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:54:01,325 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:54:01,326 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:54:01,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:54:01,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:54:01,329 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:54:01,330 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:54:01,330 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:54:01,331 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:54:01,332 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:54:01,332 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:54:01,333 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:54:01,333 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:54:01,334 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:54:01,335 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:54:01,335 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:54:01,336 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:54:01,338 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:54:01,339 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:54:01,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:54:01,340 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:54:01,341 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:54:01,342 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:54:01,343 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:54:01,343 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:54:01,343 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:54:01,343 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:54:01,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:54:01,344 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:54:01,345 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:54:01,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:54:01,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:54:01,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:54:01,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:54:01,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:54:01,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:54:01,347 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:54:01,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:54:01,348 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:54:01,348 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_326922b3-18fa-49cf-a3db-e41119c26ecd/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:54:01,358 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:54:01,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:54:01,359 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:54:01,359 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:54:01,359 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:54:01,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:54:01,359 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:54:01,359 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:54:01,359 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:54:01,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:54:01,360 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:54:01,360 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:54:01,360 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:54:01,360 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:54:01,360 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:54:01,360 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:54:01,360 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:54:01,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:54:01,361 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:54:01,361 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:54:01,361 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:54:01,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:54:01,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:54:01,361 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:54:01,362 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:54:01,362 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:54:01,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:54:01,362 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:54:01,362 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:54:01,362 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_326922b3-18fa-49cf-a3db-e41119c26ecd/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 -> 0a672d1b519511741231ff4d8f0dc06e3c2232de [2019-12-07 17:54:01,461 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:54:01,468 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:54:01,470 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:54:01,471 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:54:01,472 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:54:01,472 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_326922b3-18fa-49cf-a3db-e41119c26ecd/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix012_pso.oepc.i [2019-12-07 17:54:01,509 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_326922b3-18fa-49cf-a3db-e41119c26ecd/bin/uautomizer/data/76fc08601/ddf4e9f8570f4572b15e1d3f17a58266/FLAGb3423d717 [2019-12-07 17:54:01,928 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:54:01,928 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_326922b3-18fa-49cf-a3db-e41119c26ecd/sv-benchmarks/c/pthread-wmm/mix012_pso.oepc.i [2019-12-07 17:54:01,938 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_326922b3-18fa-49cf-a3db-e41119c26ecd/bin/uautomizer/data/76fc08601/ddf4e9f8570f4572b15e1d3f17a58266/FLAGb3423d717 [2019-12-07 17:54:01,948 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_326922b3-18fa-49cf-a3db-e41119c26ecd/bin/uautomizer/data/76fc08601/ddf4e9f8570f4572b15e1d3f17a58266 [2019-12-07 17:54:01,951 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:54:01,952 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:54:01,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:54:01,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:54:01,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:54:01,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:54:01" (1/1) ... [2019-12-07 17:54:01,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd1e142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:54:01, skipping insertion in model container [2019-12-07 17:54:01,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:54:01" (1/1) ... [2019-12-07 17:54:01,962 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:54:01,999 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:54:02,256 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:54:02,264 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:54:02,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:54:02,350 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:54:02,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:54:02 WrapperNode [2019-12-07 17:54:02,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:54:02,351 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:54:02,351 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:54:02,351 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:54:02,357 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:54:02" (1/1) ... [2019-12-07 17:54:02,370 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:54:02" (1/1) ... [2019-12-07 17:54:02,388 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:54:02,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:54:02,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:54:02,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:54:02,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:54:02" (1/1) ... [2019-12-07 17:54:02,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:54:02" (1/1) ... [2019-12-07 17:54:02,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:54:02" (1/1) ... [2019-12-07 17:54:02,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:54:02" (1/1) ... [2019-12-07 17:54:02,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:54:02" (1/1) ... [2019-12-07 17:54:02,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:54:02" (1/1) ... [2019-12-07 17:54:02,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:54:02" (1/1) ... [2019-12-07 17:54:02,413 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:54:02,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:54:02,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:54:02,413 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:54:02,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:54:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_326922b3-18fa-49cf-a3db-e41119c26ecd/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:54:02,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:54:02,456 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:54:02,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:54:02,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:54:02,456 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:54:02,456 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:54:02,456 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:54:02,456 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:54:02,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:54:02,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:54:02,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:54:02,458 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:54:02,802 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:54:02,802 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:54:02,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:54:02 BoogieIcfgContainer [2019-12-07 17:54:02,803 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:54:02,803 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:54:02,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:54:02,805 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:54:02,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:54:01" (1/3) ... [2019-12-07 17:54:02,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492faefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:54:02, skipping insertion in model container [2019-12-07 17:54:02,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:54:02" (2/3) ... [2019-12-07 17:54:02,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492faefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:54:02, skipping insertion in model container [2019-12-07 17:54:02,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:54:02" (3/3) ... [2019-12-07 17:54:02,807 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_pso.oepc.i [2019-12-07 17:54:02,813 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:54:02,813 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:54:02,818 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:54:02,818 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:54:02,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,841 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,841 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,841 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,842 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,842 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,846 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,846 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:02,871 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 17:54:02,886 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:54:02,886 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:54:02,886 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:54:02,886 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:54:02,886 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:54:02,887 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:54:02,887 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:54:02,887 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:54:02,897 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-07 17:54:02,898 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-07 17:54:02,958 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-07 17:54:02,958 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:54:02,969 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 566 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 17:54:02,981 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-07 17:54:03,006 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-07 17:54:03,006 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:54:03,009 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 566 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 17:54:03,020 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 17:54:03,020 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:54:05,724 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-07 17:54:05,989 INFO L206 etLargeBlockEncoding]: Checked pairs total: 77720 [2019-12-07 17:54:05,990 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-07 17:54:05,992 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-07 17:54:06,329 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8912 states. [2019-12-07 17:54:06,331 INFO L276 IsEmpty]: Start isEmpty. Operand 8912 states. [2019-12-07 17:54:06,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 17:54:06,334 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:06,335 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 17:54:06,335 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:54:06,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:06,339 INFO L82 PathProgramCache]: Analyzing trace with hash 795178, now seen corresponding path program 1 times [2019-12-07 17:54:06,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:06,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928435775] [2019-12-07 17:54:06,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:54:06,470 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:54:06,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928435775] [2019-12-07 17:54:06,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:54:06,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:54:06,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141812176] [2019-12-07 17:54:06,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:54:06,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:54:06,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:54:06,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:54:06,485 INFO L87 Difference]: Start difference. First operand 8912 states. Second operand 3 states. [2019-12-07 17:54:06,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:54:06,669 INFO L93 Difference]: Finished difference Result 8760 states and 28314 transitions. [2019-12-07 17:54:06,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:54:06,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 17:54:06,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:54:06,728 INFO L225 Difference]: With dead ends: 8760 [2019-12-07 17:54:06,728 INFO L226 Difference]: Without dead ends: 7798 [2019-12-07 17:54:06,729 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:54:06,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7798 states. [2019-12-07 17:54:06,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7798 to 7798. [2019-12-07 17:54:06,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7798 states. [2019-12-07 17:54:07,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7798 states to 7798 states and 25120 transitions. [2019-12-07 17:54:07,027 INFO L78 Accepts]: Start accepts. Automaton has 7798 states and 25120 transitions. Word has length 3 [2019-12-07 17:54:07,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:54:07,028 INFO L462 AbstractCegarLoop]: Abstraction has 7798 states and 25120 transitions. [2019-12-07 17:54:07,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:54:07,028 INFO L276 IsEmpty]: Start isEmpty. Operand 7798 states and 25120 transitions. [2019-12-07 17:54:07,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 17:54:07,031 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:07,031 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:54:07,031 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:54:07,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:07,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1406163788, now seen corresponding path program 1 times [2019-12-07 17:54:07,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:07,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616392419] [2019-12-07 17:54:07,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:54:07,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:54:07,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616392419] [2019-12-07 17:54:07,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:54:07,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:54:07,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062843406] [2019-12-07 17:54:07,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:54:07,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:54:07,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:54:07,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:54:07,101 INFO L87 Difference]: Start difference. First operand 7798 states and 25120 transitions. Second operand 4 states. [2019-12-07 17:54:07,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:54:07,360 INFO L93 Difference]: Finished difference Result 11906 states and 36801 transitions. [2019-12-07 17:54:07,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:54:07,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 17:54:07,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:54:07,420 INFO L225 Difference]: With dead ends: 11906 [2019-12-07 17:54:07,420 INFO L226 Difference]: Without dead ends: 11892 [2019-12-07 17:54:07,421 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:54:07,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11892 states. [2019-12-07 17:54:07,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11892 to 10583. [2019-12-07 17:54:07,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10583 states. [2019-12-07 17:54:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10583 states to 10583 states and 33330 transitions. [2019-12-07 17:54:07,668 INFO L78 Accepts]: Start accepts. Automaton has 10583 states and 33330 transitions. Word has length 11 [2019-12-07 17:54:07,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:54:07,669 INFO L462 AbstractCegarLoop]: Abstraction has 10583 states and 33330 transitions. [2019-12-07 17:54:07,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:54:07,669 INFO L276 IsEmpty]: Start isEmpty. Operand 10583 states and 33330 transitions. [2019-12-07 17:54:07,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:54:07,674 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:07,674 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:54:07,675 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:54:07,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:07,675 INFO L82 PathProgramCache]: Analyzing trace with hash 540130104, now seen corresponding path program 1 times [2019-12-07 17:54:07,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:07,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651774281] [2019-12-07 17:54:07,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:54:07,752 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:54:07,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651774281] [2019-12-07 17:54:07,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:54:07,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:54:07,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785465872] [2019-12-07 17:54:07,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:54:07,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:54:07,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:54:07,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:54:07,753 INFO L87 Difference]: Start difference. First operand 10583 states and 33330 transitions. Second operand 5 states. [2019-12-07 17:54:07,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:54:07,988 INFO L93 Difference]: Finished difference Result 15056 states and 46886 transitions. [2019-12-07 17:54:07,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:54:07,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 17:54:07,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:54:08,018 INFO L225 Difference]: With dead ends: 15056 [2019-12-07 17:54:08,018 INFO L226 Difference]: Without dead ends: 15056 [2019-12-07 17:54:08,018 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:54:08,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15056 states. [2019-12-07 17:54:08,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15056 to 12203. [2019-12-07 17:54:08,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12203 states. [2019-12-07 17:54:08,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12203 states to 12203 states and 38425 transitions. [2019-12-07 17:54:08,301 INFO L78 Accepts]: Start accepts. Automaton has 12203 states and 38425 transitions. Word has length 14 [2019-12-07 17:54:08,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:54:08,302 INFO L462 AbstractCegarLoop]: Abstraction has 12203 states and 38425 transitions. [2019-12-07 17:54:08,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:54:08,302 INFO L276 IsEmpty]: Start isEmpty. Operand 12203 states and 38425 transitions. [2019-12-07 17:54:08,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:54:08,305 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:08,305 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:54:08,305 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:54:08,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:08,305 INFO L82 PathProgramCache]: Analyzing trace with hash -191481557, now seen corresponding path program 1 times [2019-12-07 17:54:08,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:08,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632915289] [2019-12-07 17:54:08,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:54:08,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:54:08,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632915289] [2019-12-07 17:54:08,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:54:08,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:54:08,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440920718] [2019-12-07 17:54:08,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:54:08,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:54:08,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:54:08,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:54:08,351 INFO L87 Difference]: Start difference. First operand 12203 states and 38425 transitions. Second operand 3 states. [2019-12-07 17:54:08,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:54:08,358 INFO L93 Difference]: Finished difference Result 1592 states and 3548 transitions. [2019-12-07 17:54:08,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:54:08,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 17:54:08,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:54:08,360 INFO L225 Difference]: With dead ends: 1592 [2019-12-07 17:54:08,360 INFO L226 Difference]: Without dead ends: 1592 [2019-12-07 17:54:08,361 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:54:08,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2019-12-07 17:54:08,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1572. [2019-12-07 17:54:08,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-12-07 17:54:08,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 3508 transitions. [2019-12-07 17:54:08,378 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 3508 transitions. Word has length 16 [2019-12-07 17:54:08,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:54:08,379 INFO L462 AbstractCegarLoop]: Abstraction has 1572 states and 3508 transitions. [2019-12-07 17:54:08,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:54:08,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 3508 transitions. [2019-12-07 17:54:08,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 17:54:08,380 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:08,380 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:54:08,380 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:54:08,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:08,380 INFO L82 PathProgramCache]: Analyzing trace with hash 603755618, now seen corresponding path program 1 times [2019-12-07 17:54:08,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:08,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884563928] [2019-12-07 17:54:08,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:54:08,458 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:54:08,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884563928] [2019-12-07 17:54:08,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:54:08,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:54:08,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801068830] [2019-12-07 17:54:08,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:54:08,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:54:08,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:54:08,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:54:08,460 INFO L87 Difference]: Start difference. First operand 1572 states and 3508 transitions. Second operand 6 states. [2019-12-07 17:54:08,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:54:08,719 INFO L93 Difference]: Finished difference Result 2337 states and 5011 transitions. [2019-12-07 17:54:08,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:54:08,719 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 17:54:08,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:54:08,723 INFO L225 Difference]: With dead ends: 2337 [2019-12-07 17:54:08,723 INFO L226 Difference]: Without dead ends: 2337 [2019-12-07 17:54:08,723 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:54:08,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-12-07 17:54:08,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 1705. [2019-12-07 17:54:08,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1705 states. [2019-12-07 17:54:08,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 3772 transitions. [2019-12-07 17:54:08,751 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 3772 transitions. Word has length 24 [2019-12-07 17:54:08,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:54:08,752 INFO L462 AbstractCegarLoop]: Abstraction has 1705 states and 3772 transitions. [2019-12-07 17:54:08,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:54:08,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 3772 transitions. [2019-12-07 17:54:08,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 17:54:08,754 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:08,754 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] [2019-12-07 17:54:08,754 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:54:08,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:08,755 INFO L82 PathProgramCache]: Analyzing trace with hash 461887986, now seen corresponding path program 1 times [2019-12-07 17:54:08,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:08,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759884656] [2019-12-07 17:54:08,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:54:08,807 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:54:08,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759884656] [2019-12-07 17:54:08,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:54:08,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:54:08,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202108737] [2019-12-07 17:54:08,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:54:08,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:54:08,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:54:08,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:54:08,809 INFO L87 Difference]: Start difference. First operand 1705 states and 3772 transitions. Second operand 5 states. [2019-12-07 17:54:09,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:54:09,081 INFO L93 Difference]: Finished difference Result 2417 states and 5251 transitions. [2019-12-07 17:54:09,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:54:09,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 17:54:09,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:54:09,084 INFO L225 Difference]: With dead ends: 2417 [2019-12-07 17:54:09,084 INFO L226 Difference]: Without dead ends: 2417 [2019-12-07 17:54:09,084 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:54:09,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2019-12-07 17:54:09,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2124. [2019-12-07 17:54:09,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2124 states. [2019-12-07 17:54:09,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 2124 states and 4675 transitions. [2019-12-07 17:54:09,104 INFO L78 Accepts]: Start accepts. Automaton has 2124 states and 4675 transitions. Word has length 26 [2019-12-07 17:54:09,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:54:09,104 INFO L462 AbstractCegarLoop]: Abstraction has 2124 states and 4675 transitions. [2019-12-07 17:54:09,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:54:09,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 4675 transitions. [2019-12-07 17:54:09,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:54:09,105 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:09,106 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:54:09,106 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:54:09,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:09,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1792140012, now seen corresponding path program 1 times [2019-12-07 17:54:09,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:09,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91871659] [2019-12-07 17:54:09,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:54:09,155 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:54:09,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91871659] [2019-12-07 17:54:09,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:54:09,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:54:09,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057984829] [2019-12-07 17:54:09,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:54:09,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:54:09,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:54:09,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:54:09,157 INFO L87 Difference]: Start difference. First operand 2124 states and 4675 transitions. Second operand 4 states. [2019-12-07 17:54:09,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:54:09,168 INFO L93 Difference]: Finished difference Result 1195 states and 2515 transitions. [2019-12-07 17:54:09,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:54:09,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 17:54:09,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:54:09,169 INFO L225 Difference]: With dead ends: 1195 [2019-12-07 17:54:09,169 INFO L226 Difference]: Without dead ends: 1195 [2019-12-07 17:54:09,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:54:09,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2019-12-07 17:54:09,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1099. [2019-12-07 17:54:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1099 states. [2019-12-07 17:54:09,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 2338 transitions. [2019-12-07 17:54:09,180 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 2338 transitions. Word has length 27 [2019-12-07 17:54:09,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:54:09,180 INFO L462 AbstractCegarLoop]: Abstraction has 1099 states and 2338 transitions. [2019-12-07 17:54:09,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:54:09,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 2338 transitions. [2019-12-07 17:54:09,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 17:54:09,182 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:09,182 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] [2019-12-07 17:54:09,183 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:54:09,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:09,183 INFO L82 PathProgramCache]: Analyzing trace with hash -306941312, now seen corresponding path program 1 times [2019-12-07 17:54:09,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:09,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564088282] [2019-12-07 17:54:09,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:54:09,272 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:54:09,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564088282] [2019-12-07 17:54:09,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:54:09,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:54:09,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61541645] [2019-12-07 17:54:09,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:54:09,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:54:09,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:54:09,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:54:09,274 INFO L87 Difference]: Start difference. First operand 1099 states and 2338 transitions. Second operand 7 states. [2019-12-07 17:54:09,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:54:09,782 INFO L93 Difference]: Finished difference Result 1596 states and 3306 transitions. [2019-12-07 17:54:09,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 17:54:09,782 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-07 17:54:09,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:54:09,783 INFO L225 Difference]: With dead ends: 1596 [2019-12-07 17:54:09,783 INFO L226 Difference]: Without dead ends: 1590 [2019-12-07 17:54:09,783 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:54:09,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2019-12-07 17:54:09,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1154. [2019-12-07 17:54:09,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1154 states. [2019-12-07 17:54:09,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 2439 transitions. [2019-12-07 17:54:09,795 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 2439 transitions. Word has length 50 [2019-12-07 17:54:09,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:54:09,795 INFO L462 AbstractCegarLoop]: Abstraction has 1154 states and 2439 transitions. [2019-12-07 17:54:09,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:54:09,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 2439 transitions. [2019-12-07 17:54:09,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 17:54:09,797 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:09,797 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] [2019-12-07 17:54:09,797 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:54:09,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:09,797 INFO L82 PathProgramCache]: Analyzing trace with hash 945539546, now seen corresponding path program 2 times [2019-12-07 17:54:09,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:09,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947916786] [2019-12-07 17:54:09,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:54:09,842 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:54:09,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947916786] [2019-12-07 17:54:09,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:54:09,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:54:09,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198245963] [2019-12-07 17:54:09,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:54:09,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:54:09,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:54:09,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:54:09,843 INFO L87 Difference]: Start difference. First operand 1154 states and 2439 transitions. Second operand 3 states. [2019-12-07 17:54:09,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:54:09,886 INFO L93 Difference]: Finished difference Result 1575 states and 3323 transitions. [2019-12-07 17:54:09,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:54:09,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-07 17:54:09,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:54:09,888 INFO L225 Difference]: With dead ends: 1575 [2019-12-07 17:54:09,888 INFO L226 Difference]: Without dead ends: 1575 [2019-12-07 17:54:09,888 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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:54:09,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2019-12-07 17:54:09,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1222. [2019-12-07 17:54:09,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-07 17:54:09,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 2603 transitions. [2019-12-07 17:54:09,906 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 2603 transitions. Word has length 50 [2019-12-07 17:54:09,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:54:09,906 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 2603 transitions. [2019-12-07 17:54:09,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:54:09,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 2603 transitions. [2019-12-07 17:54:09,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 17:54:09,908 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:09,909 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:54:09,909 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:54:09,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:09,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1376295086, now seen corresponding path program 1 times [2019-12-07 17:54:09,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:09,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746328293] [2019-12-07 17:54:09,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:54:10,067 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:54:10,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746328293] [2019-12-07 17:54:10,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:54:10,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:54:10,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379349025] [2019-12-07 17:54:10,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:54:10,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:54:10,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:54:10,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:54:10,069 INFO L87 Difference]: Start difference. First operand 1222 states and 2603 transitions. Second operand 10 states. [2019-12-07 17:54:10,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:54:10,726 INFO L93 Difference]: Finished difference Result 1987 states and 4096 transitions. [2019-12-07 17:54:10,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 17:54:10,726 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2019-12-07 17:54:10,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:54:10,728 INFO L225 Difference]: With dead ends: 1987 [2019-12-07 17:54:10,728 INFO L226 Difference]: Without dead ends: 1987 [2019-12-07 17:54:10,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2019-12-07 17:54:10,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2019-12-07 17:54:10,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1323. [2019-12-07 17:54:10,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1323 states. [2019-12-07 17:54:10,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 2817 transitions. [2019-12-07 17:54:10,746 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 2817 transitions. Word has length 51 [2019-12-07 17:54:10,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:54:10,746 INFO L462 AbstractCegarLoop]: Abstraction has 1323 states and 2817 transitions. [2019-12-07 17:54:10,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:54:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 2817 transitions. [2019-12-07 17:54:10,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 17:54:10,748 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:10,749 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:54:10,749 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:54:10,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:10,749 INFO L82 PathProgramCache]: Analyzing trace with hash 576609332, now seen corresponding path program 2 times [2019-12-07 17:54:10,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:10,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153935619] [2019-12-07 17:54:10,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:54:10,799 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:54:10,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153935619] [2019-12-07 17:54:10,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:54:10,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:54:10,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942198912] [2019-12-07 17:54:10,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:54:10,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:54:10,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:54:10,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:54:10,801 INFO L87 Difference]: Start difference. First operand 1323 states and 2817 transitions. Second operand 4 states. [2019-12-07 17:54:10,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:54:10,816 INFO L93 Difference]: Finished difference Result 2216 states and 4731 transitions. [2019-12-07 17:54:10,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:54:10,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-12-07 17:54:10,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:54:10,818 INFO L225 Difference]: With dead ends: 2216 [2019-12-07 17:54:10,818 INFO L226 Difference]: Without dead ends: 962 [2019-12-07 17:54:10,818 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:54:10,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2019-12-07 17:54:10,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2019-12-07 17:54:10,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2019-12-07 17:54:10,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 2044 transitions. [2019-12-07 17:54:10,830 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 2044 transitions. Word has length 51 [2019-12-07 17:54:10,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:54:10,830 INFO L462 AbstractCegarLoop]: Abstraction has 962 states and 2044 transitions. [2019-12-07 17:54:10,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:54:10,830 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 2044 transitions. [2019-12-07 17:54:10,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 17:54:10,832 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:10,832 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:54:10,832 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:54:10,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:10,833 INFO L82 PathProgramCache]: Analyzing trace with hash -2033347596, now seen corresponding path program 3 times [2019-12-07 17:54:10,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:10,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244261198] [2019-12-07 17:54:10,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:54:10,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:54:10,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244261198] [2019-12-07 17:54:10,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:54:10,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:54:10,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012832241] [2019-12-07 17:54:10,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:54:10,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:54:10,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:54:10,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:54:10,908 INFO L87 Difference]: Start difference. First operand 962 states and 2044 transitions. Second operand 7 states. [2019-12-07 17:54:11,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:54:11,022 INFO L93 Difference]: Finished difference Result 1687 states and 3497 transitions. [2019-12-07 17:54:11,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:54:11,022 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-07 17:54:11,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:54:11,023 INFO L225 Difference]: With dead ends: 1687 [2019-12-07 17:54:11,023 INFO L226 Difference]: Without dead ends: 1113 [2019-12-07 17:54:11,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:54:11,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-12-07 17:54:11,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 956. [2019-12-07 17:54:11,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-12-07 17:54:11,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2014 transitions. [2019-12-07 17:54:11,031 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 2014 transitions. Word has length 51 [2019-12-07 17:54:11,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:54:11,031 INFO L462 AbstractCegarLoop]: Abstraction has 956 states and 2014 transitions. [2019-12-07 17:54:11,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:54:11,031 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2014 transitions. [2019-12-07 17:54:11,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 17:54:11,032 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:11,033 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:54:11,033 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:54:11,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:11,033 INFO L82 PathProgramCache]: Analyzing trace with hash 544395700, now seen corresponding path program 4 times [2019-12-07 17:54:11,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:11,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802322581] [2019-12-07 17:54:11,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:54:11,084 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:54:11,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802322581] [2019-12-07 17:54:11,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:54:11,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:54:11,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974704155] [2019-12-07 17:54:11,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:54:11,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:54:11,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:54:11,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:54:11,086 INFO L87 Difference]: Start difference. First operand 956 states and 2014 transitions. Second operand 3 states. [2019-12-07 17:54:11,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:54:11,094 INFO L93 Difference]: Finished difference Result 955 states and 2012 transitions. [2019-12-07 17:54:11,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:54:11,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 17:54:11,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:54:11,095 INFO L225 Difference]: With dead ends: 955 [2019-12-07 17:54:11,095 INFO L226 Difference]: Without dead ends: 955 [2019-12-07 17:54:11,096 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:54:11,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-12-07 17:54:11,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 789. [2019-12-07 17:54:11,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-12-07 17:54:11,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1685 transitions. [2019-12-07 17:54:11,103 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1685 transitions. Word has length 51 [2019-12-07 17:54:11,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:54:11,103 INFO L462 AbstractCegarLoop]: Abstraction has 789 states and 1685 transitions. [2019-12-07 17:54:11,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:54:11,103 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1685 transitions. [2019-12-07 17:54:11,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:54:11,104 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:11,104 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:54:11,104 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:54:11,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:11,105 INFO L82 PathProgramCache]: Analyzing trace with hash 355104308, now seen corresponding path program 1 times [2019-12-07 17:54:11,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:11,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992014579] [2019-12-07 17:54:11,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:54:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:54:11,170 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:54:11,170 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:54:11,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L799: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= 0 v_~y$r_buff0_thd2~0_418) (= v_~main$tmp_guard0~0_19 0) (= 0 v_~__unbuffered_cnt~0_61) (= v_~y$r_buff0_thd0~0_150 0) (= v_~y$r_buff1_thd1~0_136 0) (= 0 v_~y$w_buff0~0_517) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd2~0_265) (= v_~weak$$choice2~0_161 0) (= |v_#valid_61| (store .cse0 |v_ULTIMATE.start_main_~#t309~0.base_27| 1)) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~y$flush_delayed~0_39) (= v_~__unbuffered_p1_EBX~0_45 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t309~0.base_27| 4)) (= |v_ULTIMATE.start_main_~#t309~0.offset_19| 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~y$r_buff0_thd1~0_219 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$w_buff1~0_303 0) (= 0 |v_#NULL.base_6|) (= v_~y$r_buff1_thd0~0_161 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~__unbuffered_p0_EAX~0_105) (= v_~main$tmp_guard1~0_47 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t309~0.base_27|) (= v_~x~0_99 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t309~0.base_27|) 0) (= v_~y~0_150 0) (= v_~y$w_buff1_used~0_497 0) (= v_~y$w_buff0_used~0_750 0) (= v_~y$mem_tmp~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_50) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t309~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t309~0.base_27|) |v_ULTIMATE.start_main_~#t309~0.offset_19| 0)) |v_#memory_int_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_750, ULTIMATE.start_main_~#t310~0.base=|v_ULTIMATE.start_main_~#t310~0.base_28|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_47, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_38|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_136, ~y$mem_tmp~0=v_~y$mem_tmp~0_25, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~y$w_buff0~0=v_~y$w_buff0~0_517, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_17|, ~y~0=v_~y~0_150, ULTIMATE.start_main_~#t309~0.offset=|v_ULTIMATE.start_main_~#t309~0.offset_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_45, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ULTIMATE.start_main_~#t310~0.offset=|v_ULTIMATE.start_main_~#t310~0.offset_20|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t309~0.base=|v_ULTIMATE.start_main_~#t309~0.base_27|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_265, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~y$w_buff1~0=v_~y$w_buff1~0_303, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_30|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_150, #valid=|v_#valid_61|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_418, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_161, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_161, ~x~0=v_~x~0_99, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_497} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t310~0.base, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t309~0.offset, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t310~0.offset, #NULL.base, ULTIMATE.start_main_~#t309~0.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:54:11,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t310~0.base_10|)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t310~0.base_10| 4)) (not (= |v_ULTIMATE.start_main_~#t310~0.base_10| 0)) (= |v_ULTIMATE.start_main_~#t310~0.offset_9| 0) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t310~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t310~0.base_10|) |v_ULTIMATE.start_main_~#t310~0.offset_9| 1)) |v_#memory_int_5|) (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t310~0.base_10| 1) |v_#valid_19|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t310~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t310~0.base=|v_ULTIMATE.start_main_~#t310~0.base_10|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t310~0.offset=|v_ULTIMATE.start_main_~#t310~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t310~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t310~0.offset] because there is no mapped edge [2019-12-07 17:54:11,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (= ~y$r_buff1_thd2~0_Out-1890418742 ~y$r_buff0_thd2~0_In-1890418742) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1890418742 0)) (= ~y$r_buff1_thd1~0_Out-1890418742 ~y$r_buff0_thd1~0_In-1890418742) (= ~__unbuffered_p0_EAX~0_Out-1890418742 ~x~0_In-1890418742) (= ~y$r_buff0_thd1~0_Out-1890418742 1) (= ~y$r_buff1_thd0~0_Out-1890418742 ~y$r_buff0_thd0~0_In-1890418742)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1890418742, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1890418742, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1890418742, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1890418742, ~x~0=~x~0_In-1890418742} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1890418742, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1890418742, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1890418742, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1890418742, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1890418742, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1890418742, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1890418742, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1890418742, ~x~0=~x~0_In-1890418742} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 17:54:11,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-352574952 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-352574952 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-352574952|) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-352574952| ~y$w_buff0_used~0_In-352574952)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-352574952, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-352574952} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-352574952|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-352574952, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-352574952} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:54:11,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd1~0_In619823284 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In619823284 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In619823284 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In619823284 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out619823284| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out619823284| ~y$w_buff1_used~0_In619823284)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In619823284, ~y$w_buff0_used~0=~y$w_buff0_used~0_In619823284, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In619823284, ~y$w_buff1_used~0=~y$w_buff1_used~0_In619823284} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out619823284|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In619823284, ~y$w_buff0_used~0=~y$w_buff0_used~0_In619823284, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In619823284, ~y$w_buff1_used~0=~y$w_buff1_used~0_In619823284} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:54:11,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse1 (= ~y$r_buff0_thd1~0_In1238193437 ~y$r_buff0_thd1~0_Out1238193437)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1238193437 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In1238193437 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= 0 ~y$r_buff0_thd1~0_Out1238193437) (not .cse0) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1238193437, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1238193437} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1238193437, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1238193437|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1238193437} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:54:11,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-283489678 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-283489678 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-283489678 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-283489678 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-283489678|)) (and (= ~y$r_buff1_thd1~0_In-283489678 |P0Thread1of1ForFork0_#t~ite8_Out-283489678|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-283489678, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-283489678, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-283489678, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-283489678} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-283489678, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-283489678, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-283489678|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-283489678, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-283489678} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:54:11,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L744-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_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:54:11,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In84316866 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite17_In84316866| |P1Thread1of1ForFork1_#t~ite17_Out84316866|) (= |P1Thread1of1ForFork1_#t~ite18_Out84316866| ~y$w_buff1~0_In84316866)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In84316866 256)))) (or (and (= (mod ~y$w_buff1_used~0_In84316866 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In84316866 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In84316866 256))))) .cse0 (= |P1Thread1of1ForFork1_#t~ite18_Out84316866| |P1Thread1of1ForFork1_#t~ite17_Out84316866|) (= ~y$w_buff1~0_In84316866 |P1Thread1of1ForFork1_#t~ite17_Out84316866|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In84316866, ~y$w_buff1~0=~y$w_buff1~0_In84316866, ~y$w_buff0_used~0=~y$w_buff0_used~0_In84316866, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In84316866, ~weak$$choice2~0=~weak$$choice2~0_In84316866, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In84316866|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In84316866} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In84316866, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out84316866|, ~y$w_buff1~0=~y$w_buff1~0_In84316866, ~y$w_buff0_used~0=~y$w_buff0_used~0_In84316866, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In84316866, ~weak$$choice2~0=~weak$$choice2~0_In84316866, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out84316866|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In84316866} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 17:54:11,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In817501535 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out817501535| |P1Thread1of1ForFork1_#t~ite20_Out817501535|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In817501535 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In817501535 256)) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In817501535 256) 0)) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In817501535 256))))) (= |P1Thread1of1ForFork1_#t~ite20_Out817501535| ~y$w_buff0_used~0_In817501535) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite21_Out817501535| ~y$w_buff0_used~0_In817501535) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite20_In817501535| |P1Thread1of1ForFork1_#t~ite20_Out817501535|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In817501535, ~y$w_buff0_used~0=~y$w_buff0_used~0_In817501535, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In817501535|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In817501535, ~weak$$choice2~0=~weak$$choice2~0_In817501535, ~y$w_buff1_used~0=~y$w_buff1_used~0_In817501535} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In817501535, ~y$w_buff0_used~0=~y$w_buff0_used~0_In817501535, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out817501535|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In817501535, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out817501535|, ~weak$$choice2~0=~weak$$choice2~0_In817501535, ~y$w_buff1_used~0=~y$w_buff1_used~0_In817501535} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 17:54:11,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1377519322 256))) (.cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out-1377519322| |P1Thread1of1ForFork1_#t~ite24_Out-1377519322|)) (.cse4 (= 0 (mod ~y$w_buff0_used~0_In-1377519322 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1377519322 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1377519322 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1377519322 256) 0))) (or (and (or (and (= |P1Thread1of1ForFork1_#t~ite23_Out-1377519322| |P1Thread1of1ForFork1_#t~ite23_In-1377519322|) (= ~y$w_buff1_used~0_In-1377519322 |P1Thread1of1ForFork1_#t~ite24_Out-1377519322|) (not .cse0)) (and (or (and .cse1 .cse2) (and .cse1 .cse3) .cse4) .cse0 .cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out-1377519322| ~y$w_buff1_used~0_In-1377519322))) (= |P1Thread1of1ForFork1_#t~ite22_In-1377519322| |P1Thread1of1ForFork1_#t~ite22_Out-1377519322|)) (let ((.cse6 (not .cse1))) (and (= |P1Thread1of1ForFork1_#t~ite22_Out-1377519322| 0) .cse0 .cse5 (not .cse4) (= |P1Thread1of1ForFork1_#t~ite23_Out-1377519322| |P1Thread1of1ForFork1_#t~ite22_Out-1377519322|) (or (not .cse3) .cse6) (or (not .cse2) .cse6))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1377519322, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1377519322, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1377519322, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1377519322|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1377519322|, ~weak$$choice2~0=~weak$$choice2~0_In-1377519322, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1377519322} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1377519322, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1377519322, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1377519322, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1377519322|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1377519322|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1377519322|, ~weak$$choice2~0=~weak$$choice2~0_In-1377519322, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1377519322} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 17:54:11,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L768-8-->L770: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_105 256))) (= v_~y$w_buff1_used~0_417 |v_P1Thread1of1ForFork1_#t~ite24_23|) (= v_~y$r_buff0_thd2~0_320 v_~y$r_buff0_thd2~0_319)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_320, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_23|, ~weak$$choice2~0=v_~weak$$choice2~0_105} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_319, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_20|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_22|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_18|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_33|, ~weak$$choice2~0=v_~weak$$choice2~0_105, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_26|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_30|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_417} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:54:11,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-651960455 256) 0))) (or (let ((.cse1 (not (= 0 (mod ~y$r_buff0_thd2~0_In-651960455 256))))) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-651960455| |P1Thread1of1ForFork1_#t~ite30_Out-651960455|) .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-651960455| |P1Thread1of1ForFork1_#t~ite28_Out-651960455|) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out-651960455|) (not (= 0 (mod ~y$w_buff0_used~0_In-651960455 256))) (or (not (= 0 (mod ~y$r_buff1_thd2~0_In-651960455 256))) .cse1) (or .cse1 (not (= (mod ~y$w_buff1_used~0_In-651960455 256) 0))))) (and (= |P1Thread1of1ForFork1_#t~ite29_In-651960455| |P1Thread1of1ForFork1_#t~ite29_Out-651960455|) (not .cse0) (= ~y$r_buff1_thd2~0_In-651960455 |P1Thread1of1ForFork1_#t~ite30_Out-651960455|) (= |P1Thread1of1ForFork1_#t~ite28_In-651960455| |P1Thread1of1ForFork1_#t~ite28_Out-651960455|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-651960455, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-651960455|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-651960455, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-651960455, ~weak$$choice2~0=~weak$$choice2~0_In-651960455, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In-651960455|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-651960455} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-651960455, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-651960455|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-651960455|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-651960455, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-651960455, ~weak$$choice2~0=~weak$$choice2~0_In-651960455, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-651960455|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-651960455} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 17:54:11,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L772-->L776: Formula: (and (= v_~y~0_43 v_~y$mem_tmp~0_8) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_8, ~y$flush_delayed~0=v_~y$flush_delayed~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 17:54:11,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out1695723956| |P1Thread1of1ForFork1_#t~ite32_Out1695723956|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1695723956 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1695723956 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~y~0_In1695723956 |P1Thread1of1ForFork1_#t~ite32_Out1695723956|)) (and .cse0 (not .cse2) (not .cse1) (= ~y$w_buff1~0_In1695723956 |P1Thread1of1ForFork1_#t~ite32_Out1695723956|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1695723956, ~y$w_buff1~0=~y$w_buff1~0_In1695723956, ~y~0=~y~0_In1695723956, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1695723956} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1695723956, ~y$w_buff1~0=~y$w_buff1~0_In1695723956, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1695723956|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1695723956|, ~y~0=~y~0_In1695723956, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1695723956} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 17:54:11,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-441426841 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-441426841 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-441426841| ~y$w_buff0_used~0_In-441426841)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-441426841|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-441426841, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-441426841} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-441426841, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-441426841, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-441426841|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:54:11,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-1328975699 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-1328975699 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1328975699 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1328975699 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out-1328975699| 0)) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out-1328975699| ~y$w_buff1_used~0_In-1328975699) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1328975699, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1328975699, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1328975699, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1328975699} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1328975699, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1328975699, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1328975699, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1328975699|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1328975699} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:54:11,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-326087050 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-326087050 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-326087050| ~y$r_buff0_thd2~0_In-326087050)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-326087050| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-326087050, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-326087050} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-326087050, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-326087050, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-326087050|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:54:11,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd2~0_In348547758 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In348547758 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In348547758 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In348547758 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out348547758|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In348547758 |P1Thread1of1ForFork1_#t~ite37_Out348547758|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In348547758, ~y$w_buff0_used~0=~y$w_buff0_used~0_In348547758, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In348547758, ~y$w_buff1_used~0=~y$w_buff1_used~0_In348547758} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In348547758, ~y$w_buff0_used~0=~y$w_buff0_used~0_In348547758, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In348547758, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out348547758|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In348547758} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:54:11,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_174 |v_P1Thread1of1ForFork1_#t~ite37_32|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_174, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_31|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:54:11,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L801-1-->L807: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 17:54:11,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-188100392 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-188100392 256) 0))) (or (and (= ~y~0_In-188100392 |ULTIMATE.start_main_#t~ite40_Out-188100392|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-188100392| ~y$w_buff1~0_In-188100392)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-188100392, ~y~0=~y~0_In-188100392, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-188100392, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-188100392} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-188100392|, ~y$w_buff1~0=~y$w_buff1~0_In-188100392, ~y~0=~y~0_In-188100392, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-188100392, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-188100392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:54:11,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L807-4-->L808: Formula: (= v_~y~0_34 |v_ULTIMATE.start_main_#t~ite40_14|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~y~0=v_~y~0_34} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 17:54:11,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-675958476 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-675958476 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-675958476 |ULTIMATE.start_main_#t~ite42_Out-675958476|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-675958476| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-675958476, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-675958476} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-675958476, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-675958476, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-675958476|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:54:11,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-486154085 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-486154085 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-486154085 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-486154085 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-486154085| ~y$w_buff1_used~0_In-486154085) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out-486154085| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-486154085, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-486154085, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-486154085, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-486154085} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-486154085, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-486154085, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-486154085|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-486154085, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-486154085} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:54:11,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1912098695 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1912098695 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In-1912098695 |ULTIMATE.start_main_#t~ite44_Out-1912098695|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1912098695|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1912098695, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1912098695} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1912098695, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1912098695, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1912098695|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:54:11,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In-1721248278 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1721248278 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1721248278 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1721248278 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-1721248278| ~y$r_buff1_thd0~0_In-1721248278)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-1721248278|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1721248278, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1721248278, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1721248278, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1721248278} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1721248278, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1721248278, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1721248278, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1721248278|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1721248278} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:54:11,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L811-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_28 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~y$r_buff1_thd0~0_112 |v_ULTIMATE.start_main_#t~ite45_56|) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_37) (= v_~__unbuffered_p1_EBX~0_29 0) (= 0 v_~__unbuffered_p0_EAX~0_76))) 1 0)) 0 1) v_~main$tmp_guard1~0_28)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_56|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_112, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_55|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:54:11,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:54:11 BasicIcfg [2019-12-07 17:54:11,224 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:54:11,224 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:54:11,225 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:54:11,225 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:54:11,225 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:54:02" (3/4) ... [2019-12-07 17:54:11,227 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:54:11,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L799: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= 0 v_~y$r_buff0_thd2~0_418) (= v_~main$tmp_guard0~0_19 0) (= 0 v_~__unbuffered_cnt~0_61) (= v_~y$r_buff0_thd0~0_150 0) (= v_~y$r_buff1_thd1~0_136 0) (= 0 v_~y$w_buff0~0_517) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd2~0_265) (= v_~weak$$choice2~0_161 0) (= |v_#valid_61| (store .cse0 |v_ULTIMATE.start_main_~#t309~0.base_27| 1)) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~y$flush_delayed~0_39) (= v_~__unbuffered_p1_EBX~0_45 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t309~0.base_27| 4)) (= |v_ULTIMATE.start_main_~#t309~0.offset_19| 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~y$r_buff0_thd1~0_219 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$w_buff1~0_303 0) (= 0 |v_#NULL.base_6|) (= v_~y$r_buff1_thd0~0_161 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~__unbuffered_p0_EAX~0_105) (= v_~main$tmp_guard1~0_47 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t309~0.base_27|) (= v_~x~0_99 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t309~0.base_27|) 0) (= v_~y~0_150 0) (= v_~y$w_buff1_used~0_497 0) (= v_~y$w_buff0_used~0_750 0) (= v_~y$mem_tmp~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_50) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t309~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t309~0.base_27|) |v_ULTIMATE.start_main_~#t309~0.offset_19| 0)) |v_#memory_int_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_750, ULTIMATE.start_main_~#t310~0.base=|v_ULTIMATE.start_main_~#t310~0.base_28|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_47, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_38|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_136, ~y$mem_tmp~0=v_~y$mem_tmp~0_25, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~y$w_buff0~0=v_~y$w_buff0~0_517, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_17|, ~y~0=v_~y~0_150, ULTIMATE.start_main_~#t309~0.offset=|v_ULTIMATE.start_main_~#t309~0.offset_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_45, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ULTIMATE.start_main_~#t310~0.offset=|v_ULTIMATE.start_main_~#t310~0.offset_20|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t309~0.base=|v_ULTIMATE.start_main_~#t309~0.base_27|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_265, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~y$w_buff1~0=v_~y$w_buff1~0_303, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_30|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_150, #valid=|v_#valid_61|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_418, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_161, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_161, ~x~0=v_~x~0_99, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_497} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t310~0.base, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t309~0.offset, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t310~0.offset, #NULL.base, ULTIMATE.start_main_~#t309~0.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:54:11,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t310~0.base_10|)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t310~0.base_10| 4)) (not (= |v_ULTIMATE.start_main_~#t310~0.base_10| 0)) (= |v_ULTIMATE.start_main_~#t310~0.offset_9| 0) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t310~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t310~0.base_10|) |v_ULTIMATE.start_main_~#t310~0.offset_9| 1)) |v_#memory_int_5|) (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t310~0.base_10| 1) |v_#valid_19|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t310~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t310~0.base=|v_ULTIMATE.start_main_~#t310~0.base_10|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t310~0.offset=|v_ULTIMATE.start_main_~#t310~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t310~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t310~0.offset] because there is no mapped edge [2019-12-07 17:54:11,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (= ~y$r_buff1_thd2~0_Out-1890418742 ~y$r_buff0_thd2~0_In-1890418742) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1890418742 0)) (= ~y$r_buff1_thd1~0_Out-1890418742 ~y$r_buff0_thd1~0_In-1890418742) (= ~__unbuffered_p0_EAX~0_Out-1890418742 ~x~0_In-1890418742) (= ~y$r_buff0_thd1~0_Out-1890418742 1) (= ~y$r_buff1_thd0~0_Out-1890418742 ~y$r_buff0_thd0~0_In-1890418742)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1890418742, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1890418742, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1890418742, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1890418742, ~x~0=~x~0_In-1890418742} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1890418742, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1890418742, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1890418742, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1890418742, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1890418742, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1890418742, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1890418742, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1890418742, ~x~0=~x~0_In-1890418742} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 17:54:11,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-352574952 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-352574952 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-352574952|) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-352574952| ~y$w_buff0_used~0_In-352574952)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-352574952, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-352574952} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-352574952|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-352574952, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-352574952} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:54:11,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd1~0_In619823284 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In619823284 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In619823284 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In619823284 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out619823284| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out619823284| ~y$w_buff1_used~0_In619823284)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In619823284, ~y$w_buff0_used~0=~y$w_buff0_used~0_In619823284, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In619823284, ~y$w_buff1_used~0=~y$w_buff1_used~0_In619823284} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out619823284|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In619823284, ~y$w_buff0_used~0=~y$w_buff0_used~0_In619823284, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In619823284, ~y$w_buff1_used~0=~y$w_buff1_used~0_In619823284} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:54:11,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse1 (= ~y$r_buff0_thd1~0_In1238193437 ~y$r_buff0_thd1~0_Out1238193437)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1238193437 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In1238193437 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= 0 ~y$r_buff0_thd1~0_Out1238193437) (not .cse0) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1238193437, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1238193437} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1238193437, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1238193437|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1238193437} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:54:11,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-283489678 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-283489678 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-283489678 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-283489678 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-283489678|)) (and (= ~y$r_buff1_thd1~0_In-283489678 |P0Thread1of1ForFork0_#t~ite8_Out-283489678|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-283489678, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-283489678, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-283489678, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-283489678} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-283489678, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-283489678, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-283489678|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-283489678, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-283489678} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:54:11,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L744-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_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:54:11,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In84316866 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite17_In84316866| |P1Thread1of1ForFork1_#t~ite17_Out84316866|) (= |P1Thread1of1ForFork1_#t~ite18_Out84316866| ~y$w_buff1~0_In84316866)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In84316866 256)))) (or (and (= (mod ~y$w_buff1_used~0_In84316866 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In84316866 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In84316866 256))))) .cse0 (= |P1Thread1of1ForFork1_#t~ite18_Out84316866| |P1Thread1of1ForFork1_#t~ite17_Out84316866|) (= ~y$w_buff1~0_In84316866 |P1Thread1of1ForFork1_#t~ite17_Out84316866|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In84316866, ~y$w_buff1~0=~y$w_buff1~0_In84316866, ~y$w_buff0_used~0=~y$w_buff0_used~0_In84316866, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In84316866, ~weak$$choice2~0=~weak$$choice2~0_In84316866, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In84316866|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In84316866} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In84316866, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out84316866|, ~y$w_buff1~0=~y$w_buff1~0_In84316866, ~y$w_buff0_used~0=~y$w_buff0_used~0_In84316866, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In84316866, ~weak$$choice2~0=~weak$$choice2~0_In84316866, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out84316866|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In84316866} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 17:54:11,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In817501535 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out817501535| |P1Thread1of1ForFork1_#t~ite20_Out817501535|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In817501535 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In817501535 256)) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In817501535 256) 0)) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In817501535 256))))) (= |P1Thread1of1ForFork1_#t~ite20_Out817501535| ~y$w_buff0_used~0_In817501535) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite21_Out817501535| ~y$w_buff0_used~0_In817501535) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite20_In817501535| |P1Thread1of1ForFork1_#t~ite20_Out817501535|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In817501535, ~y$w_buff0_used~0=~y$w_buff0_used~0_In817501535, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In817501535|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In817501535, ~weak$$choice2~0=~weak$$choice2~0_In817501535, ~y$w_buff1_used~0=~y$w_buff1_used~0_In817501535} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In817501535, ~y$w_buff0_used~0=~y$w_buff0_used~0_In817501535, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out817501535|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In817501535, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out817501535|, ~weak$$choice2~0=~weak$$choice2~0_In817501535, ~y$w_buff1_used~0=~y$w_buff1_used~0_In817501535} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 17:54:11,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1377519322 256))) (.cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out-1377519322| |P1Thread1of1ForFork1_#t~ite24_Out-1377519322|)) (.cse4 (= 0 (mod ~y$w_buff0_used~0_In-1377519322 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1377519322 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1377519322 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1377519322 256) 0))) (or (and (or (and (= |P1Thread1of1ForFork1_#t~ite23_Out-1377519322| |P1Thread1of1ForFork1_#t~ite23_In-1377519322|) (= ~y$w_buff1_used~0_In-1377519322 |P1Thread1of1ForFork1_#t~ite24_Out-1377519322|) (not .cse0)) (and (or (and .cse1 .cse2) (and .cse1 .cse3) .cse4) .cse0 .cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out-1377519322| ~y$w_buff1_used~0_In-1377519322))) (= |P1Thread1of1ForFork1_#t~ite22_In-1377519322| |P1Thread1of1ForFork1_#t~ite22_Out-1377519322|)) (let ((.cse6 (not .cse1))) (and (= |P1Thread1of1ForFork1_#t~ite22_Out-1377519322| 0) .cse0 .cse5 (not .cse4) (= |P1Thread1of1ForFork1_#t~ite23_Out-1377519322| |P1Thread1of1ForFork1_#t~ite22_Out-1377519322|) (or (not .cse3) .cse6) (or (not .cse2) .cse6))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1377519322, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1377519322, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1377519322, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1377519322|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1377519322|, ~weak$$choice2~0=~weak$$choice2~0_In-1377519322, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1377519322} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1377519322, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1377519322, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1377519322, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1377519322|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1377519322|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1377519322|, ~weak$$choice2~0=~weak$$choice2~0_In-1377519322, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1377519322} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 17:54:11,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L768-8-->L770: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_105 256))) (= v_~y$w_buff1_used~0_417 |v_P1Thread1of1ForFork1_#t~ite24_23|) (= v_~y$r_buff0_thd2~0_320 v_~y$r_buff0_thd2~0_319)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_320, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_23|, ~weak$$choice2~0=v_~weak$$choice2~0_105} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_319, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_20|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_22|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_18|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_33|, ~weak$$choice2~0=v_~weak$$choice2~0_105, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_26|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_30|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_417} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:54:11,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-651960455 256) 0))) (or (let ((.cse1 (not (= 0 (mod ~y$r_buff0_thd2~0_In-651960455 256))))) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-651960455| |P1Thread1of1ForFork1_#t~ite30_Out-651960455|) .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-651960455| |P1Thread1of1ForFork1_#t~ite28_Out-651960455|) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out-651960455|) (not (= 0 (mod ~y$w_buff0_used~0_In-651960455 256))) (or (not (= 0 (mod ~y$r_buff1_thd2~0_In-651960455 256))) .cse1) (or .cse1 (not (= (mod ~y$w_buff1_used~0_In-651960455 256) 0))))) (and (= |P1Thread1of1ForFork1_#t~ite29_In-651960455| |P1Thread1of1ForFork1_#t~ite29_Out-651960455|) (not .cse0) (= ~y$r_buff1_thd2~0_In-651960455 |P1Thread1of1ForFork1_#t~ite30_Out-651960455|) (= |P1Thread1of1ForFork1_#t~ite28_In-651960455| |P1Thread1of1ForFork1_#t~ite28_Out-651960455|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-651960455, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-651960455|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-651960455, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-651960455, ~weak$$choice2~0=~weak$$choice2~0_In-651960455, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In-651960455|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-651960455} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-651960455, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-651960455|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-651960455|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-651960455, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-651960455, ~weak$$choice2~0=~weak$$choice2~0_In-651960455, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-651960455|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-651960455} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 17:54:11,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L772-->L776: Formula: (and (= v_~y~0_43 v_~y$mem_tmp~0_8) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_8, ~y$flush_delayed~0=v_~y$flush_delayed~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 17:54:11,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out1695723956| |P1Thread1of1ForFork1_#t~ite32_Out1695723956|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1695723956 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1695723956 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~y~0_In1695723956 |P1Thread1of1ForFork1_#t~ite32_Out1695723956|)) (and .cse0 (not .cse2) (not .cse1) (= ~y$w_buff1~0_In1695723956 |P1Thread1of1ForFork1_#t~ite32_Out1695723956|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1695723956, ~y$w_buff1~0=~y$w_buff1~0_In1695723956, ~y~0=~y~0_In1695723956, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1695723956} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1695723956, ~y$w_buff1~0=~y$w_buff1~0_In1695723956, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1695723956|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1695723956|, ~y~0=~y~0_In1695723956, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1695723956} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 17:54:11,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-441426841 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-441426841 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-441426841| ~y$w_buff0_used~0_In-441426841)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-441426841|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-441426841, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-441426841} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-441426841, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-441426841, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-441426841|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:54:11,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-1328975699 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-1328975699 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1328975699 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1328975699 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out-1328975699| 0)) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out-1328975699| ~y$w_buff1_used~0_In-1328975699) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1328975699, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1328975699, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1328975699, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1328975699} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1328975699, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1328975699, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1328975699, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1328975699|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1328975699} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:54:11,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-326087050 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-326087050 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-326087050| ~y$r_buff0_thd2~0_In-326087050)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-326087050| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-326087050, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-326087050} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-326087050, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-326087050, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-326087050|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:54:11,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd2~0_In348547758 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In348547758 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In348547758 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In348547758 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out348547758|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In348547758 |P1Thread1of1ForFork1_#t~ite37_Out348547758|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In348547758, ~y$w_buff0_used~0=~y$w_buff0_used~0_In348547758, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In348547758, ~y$w_buff1_used~0=~y$w_buff1_used~0_In348547758} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In348547758, ~y$w_buff0_used~0=~y$w_buff0_used~0_In348547758, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In348547758, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out348547758|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In348547758} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:54:11,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_174 |v_P1Thread1of1ForFork1_#t~ite37_32|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_174, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_31|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:54:11,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L801-1-->L807: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 17:54:11,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-188100392 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-188100392 256) 0))) (or (and (= ~y~0_In-188100392 |ULTIMATE.start_main_#t~ite40_Out-188100392|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-188100392| ~y$w_buff1~0_In-188100392)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-188100392, ~y~0=~y~0_In-188100392, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-188100392, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-188100392} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-188100392|, ~y$w_buff1~0=~y$w_buff1~0_In-188100392, ~y~0=~y~0_In-188100392, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-188100392, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-188100392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:54:11,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L807-4-->L808: Formula: (= v_~y~0_34 |v_ULTIMATE.start_main_#t~ite40_14|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~y~0=v_~y~0_34} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 17:54:11,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-675958476 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-675958476 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-675958476 |ULTIMATE.start_main_#t~ite42_Out-675958476|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-675958476| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-675958476, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-675958476} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-675958476, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-675958476, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-675958476|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:54:11,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-486154085 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-486154085 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-486154085 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-486154085 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-486154085| ~y$w_buff1_used~0_In-486154085) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out-486154085| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-486154085, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-486154085, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-486154085, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-486154085} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-486154085, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-486154085, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-486154085|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-486154085, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-486154085} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:54:11,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1912098695 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1912098695 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In-1912098695 |ULTIMATE.start_main_#t~ite44_Out-1912098695|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1912098695|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1912098695, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1912098695} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1912098695, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1912098695, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1912098695|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:54:11,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In-1721248278 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1721248278 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1721248278 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1721248278 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-1721248278| ~y$r_buff1_thd0~0_In-1721248278)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-1721248278|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1721248278, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1721248278, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1721248278, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1721248278} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1721248278, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1721248278, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1721248278, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1721248278|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1721248278} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:54:11,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L811-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_28 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~y$r_buff1_thd0~0_112 |v_ULTIMATE.start_main_#t~ite45_56|) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_37) (= v_~__unbuffered_p1_EBX~0_29 0) (= 0 v_~__unbuffered_p0_EAX~0_76))) 1 0)) 0 1) v_~main$tmp_guard1~0_28)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_56|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_112, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_55|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:54:11,288 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_326922b3-18fa-49cf-a3db-e41119c26ecd/bin/uautomizer/witness.graphml [2019-12-07 17:54:11,288 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:54:11,290 INFO L168 Benchmark]: Toolchain (without parser) took 9338.07 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 373.8 MB). Free memory was 940.7 MB in the beginning and 818.3 MB in the end (delta: 122.4 MB). Peak memory consumption was 496.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:54:11,290 INFO L168 Benchmark]: CDTParser took 0.15 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:54:11,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 398.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -129.2 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:54:11,291 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.36 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:54:11,291 INFO L168 Benchmark]: Boogie Preprocessor took 24.39 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:54:11,291 INFO L168 Benchmark]: RCFGBuilder took 389.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:54:11,291 INFO L168 Benchmark]: TraceAbstraction took 8420.85 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 271.6 MB). Free memory was 1.0 GB in the beginning and 841.8 MB in the end (delta: 172.1 MB). Peak memory consumption was 443.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:54:11,292 INFO L168 Benchmark]: Witness Printer took 64.00 ms. Allocated memory is still 1.4 GB. Free memory was 841.8 MB in the beginning and 818.3 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:54:11,294 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.15 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 398.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -129.2 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.39 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 389.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8420.85 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 271.6 MB). Free memory was 1.0 GB in the beginning and 841.8 MB in the end (delta: 172.1 MB). Peak memory consumption was 443.7 MB. Max. memory is 11.5 GB. * Witness Printer took 64.00 ms. Allocated memory is still 1.4 GB. Free memory was 841.8 MB in the beginning and 818.3 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.0s, 148 ProgramPointsBefore, 75 ProgramPointsAfterwards, 182 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 30 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 28 ChoiceCompositions, 4966 VarBasedMoverChecksPositive, 278 VarBasedMoverChecksNegative, 167 SemBasedMoverChecksPositive, 218 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 77720 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L799] FCALL, FORK 0 pthread_create(&t309, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L726] 1 y$w_buff1 = y$w_buff0 [L727] 1 y$w_buff0 = 1 [L728] 1 y$w_buff1_used = y$w_buff0_used [L729] 1 y$w_buff0_used = (_Bool)1 [L801] FCALL, FORK 0 pthread_create(&t310, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 __unbuffered_p1_EAX = x [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 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) [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 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 [L764] 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) [L765] 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=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 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)) [L766] 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)) [L767] 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)) [L770] 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)) [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 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_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 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) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 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 [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L807] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] 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 [L810] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.2s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1647 SDtfs, 1661 SDslu, 3297 SDs, 0 SdLazy, 2772 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 22 SyntacticMatches, 11 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12203occurred 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: 0.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 6979 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 477 NumberOfCodeBlocks, 477 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 412 ConstructedInterpolants, 0 QuantifiedInterpolants, 55706 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...