./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi007_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b7c60acb-db2b-4791-8206-ca5268e5ac28/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b7c60acb-db2b-4791-8206-ca5268e5ac28/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b7c60acb-db2b-4791-8206-ca5268e5ac28/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b7c60acb-db2b-4791-8206-ca5268e5ac28/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi007_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b7c60acb-db2b-4791-8206-ca5268e5ac28/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b7c60acb-db2b-4791-8206-ca5268e5ac28/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 254daee91aac18eceae46897fdef61d4981a523a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:35:51,325 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:35:51,327 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:35:51,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:35:51,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:35:51,335 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:35:51,336 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:35:51,337 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:35:51,338 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:35:51,339 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:35:51,340 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:35:51,340 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:35:51,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:35:51,341 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:35:51,342 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:35:51,343 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:35:51,343 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:35:51,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:35:51,345 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:35:51,347 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:35:51,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:35:51,349 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:35:51,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:35:51,350 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:35:51,352 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:35:51,352 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:35:51,352 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:35:51,353 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:35:51,353 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:35:51,354 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:35:51,354 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:35:51,354 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:35:51,355 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:35:51,355 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:35:51,356 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:35:51,356 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:35:51,356 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:35:51,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:35:51,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:35:51,357 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:35:51,357 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:35:51,358 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b7c60acb-db2b-4791-8206-ca5268e5ac28/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:35:51,368 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:35:51,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:35:51,369 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:35:51,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:35:51,369 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:35:51,369 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:35:51,369 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:35:51,369 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:35:51,370 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:35:51,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:35:51,370 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:35:51,370 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:35:51,370 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:35:51,370 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:35:51,370 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:35:51,371 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:35:51,371 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:35:51,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:35:51,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:35:51,371 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:35:51,371 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:35:51,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:35:51,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:35:51,372 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:35:51,372 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:35:51,372 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:35:51,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:35:51,372 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:35:51,372 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:35:51,372 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_b7c60acb-db2b-4791-8206-ca5268e5ac28/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 -> 254daee91aac18eceae46897fdef61d4981a523a [2019-12-07 17:35:51,473 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:35:51,482 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:35:51,485 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:35:51,486 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:35:51,487 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:35:51,487 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b7c60acb-db2b-4791-8206-ca5268e5ac28/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi007_power.oepc.i [2019-12-07 17:35:51,529 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b7c60acb-db2b-4791-8206-ca5268e5ac28/bin/uautomizer/data/ecf6081a1/55ceb5065e4844e78fbab62d4b53e9d4/FLAGf87f0cd8e [2019-12-07 17:35:51,895 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:35:51,896 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b7c60acb-db2b-4791-8206-ca5268e5ac28/sv-benchmarks/c/pthread-wmm/rfi007_power.oepc.i [2019-12-07 17:35:51,908 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b7c60acb-db2b-4791-8206-ca5268e5ac28/bin/uautomizer/data/ecf6081a1/55ceb5065e4844e78fbab62d4b53e9d4/FLAGf87f0cd8e [2019-12-07 17:35:52,292 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b7c60acb-db2b-4791-8206-ca5268e5ac28/bin/uautomizer/data/ecf6081a1/55ceb5065e4844e78fbab62d4b53e9d4 [2019-12-07 17:35:52,294 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:35:52,295 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:35:52,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:35:52,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:35:52,298 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:35:52,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:35:52" (1/1) ... [2019-12-07 17:35:52,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4880376f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:52, skipping insertion in model container [2019-12-07 17:35:52,300 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:35:52" (1/1) ... [2019-12-07 17:35:52,305 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:35:52,333 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:35:52,571 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:35:52,579 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:35:52,622 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:35:52,667 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:35:52,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:52 WrapperNode [2019-12-07 17:35:52,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:35:52,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:35:52,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:35:52,668 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:35:52,674 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:35:52" (1/1) ... [2019-12-07 17:35:52,687 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:35:52" (1/1) ... [2019-12-07 17:35:52,706 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:35:52,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:35:52,707 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:35:52,707 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:35:52,714 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:52" (1/1) ... [2019-12-07 17:35:52,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:52" (1/1) ... [2019-12-07 17:35:52,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:52" (1/1) ... [2019-12-07 17:35:52,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:52" (1/1) ... [2019-12-07 17:35:52,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:52" (1/1) ... [2019-12-07 17:35:52,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:52" (1/1) ... [2019-12-07 17:35:52,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:52" (1/1) ... [2019-12-07 17:35:52,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:35:52,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:35:52,734 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:35:52,734 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:35:52,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b7c60acb-db2b-4791-8206-ca5268e5ac28/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:35:52,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:35:52,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:35:52,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:35:52,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:35:52,776 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:35:52,776 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:35:52,776 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:35:52,776 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:35:52,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:35:52,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:35:52,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:35:52,777 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:35:53,115 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:35:53,115 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:35:53,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:35:53 BoogieIcfgContainer [2019-12-07 17:35:53,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:35:53,116 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:35:53,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:35:53,118 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:35:53,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:35:52" (1/3) ... [2019-12-07 17:35:53,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224292fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:35:53, skipping insertion in model container [2019-12-07 17:35:53,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:52" (2/3) ... [2019-12-07 17:35:53,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224292fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:35:53, skipping insertion in model container [2019-12-07 17:35:53,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:35:53" (3/3) ... [2019-12-07 17:35:53,120 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_power.oepc.i [2019-12-07 17:35:53,126 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:35:53,126 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:35:53,131 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:35:53,131 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:35:53,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,153 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,153 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,154 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,154 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,154 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,160 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,160 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:53,187 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 17:35:53,200 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:35:53,200 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:35:53,200 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:35:53,200 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:35:53,200 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:35:53,200 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:35:53,200 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:35:53,200 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:35:53,212 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-07 17:35:53,213 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 17:35:53,265 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 17:35:53,266 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:35:53,274 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 560 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 17:35:53,286 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 17:35:53,312 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 17:35:53,312 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:35:53,315 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 560 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 17:35:53,325 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 17:35:53,326 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:35:55,933 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 17:35:56,228 INFO L206 etLargeBlockEncoding]: Checked pairs total: 76691 [2019-12-07 17:35:56,228 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-07 17:35:56,231 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-12-07 17:35:56,604 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9438 states. [2019-12-07 17:35:56,606 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states. [2019-12-07 17:35:56,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 17:35:56,610 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:56,610 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 17:35:56,610 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:35:56,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:56,614 INFO L82 PathProgramCache]: Analyzing trace with hash 790297, now seen corresponding path program 1 times [2019-12-07 17:35:56,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:56,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132131903] [2019-12-07 17:35:56,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:56,756 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:35:56,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132131903] [2019-12-07 17:35:56,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:56,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:35:56,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873262499] [2019-12-07 17:35:56,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:35:56,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:56,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:35:56,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:35:56,773 INFO L87 Difference]: Start difference. First operand 9438 states. Second operand 3 states. [2019-12-07 17:35:56,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:56,978 INFO L93 Difference]: Finished difference Result 9266 states and 29920 transitions. [2019-12-07 17:35:56,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:35:56,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 17:35:56,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:57,044 INFO L225 Difference]: With dead ends: 9266 [2019-12-07 17:35:57,044 INFO L226 Difference]: Without dead ends: 8258 [2019-12-07 17:35:57,045 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:35:57,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8258 states. [2019-12-07 17:35:57,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8258 to 8258. [2019-12-07 17:35:57,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8258 states. [2019-12-07 17:35:57,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 26572 transitions. [2019-12-07 17:35:57,340 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 26572 transitions. Word has length 3 [2019-12-07 17:35:57,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:35:57,340 INFO L462 AbstractCegarLoop]: Abstraction has 8258 states and 26572 transitions. [2019-12-07 17:35:57,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:35:57,340 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 26572 transitions. [2019-12-07 17:35:57,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 17:35:57,343 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:57,343 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:35:57,344 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:35:57,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:57,344 INFO L82 PathProgramCache]: Analyzing trace with hash 316025548, now seen corresponding path program 1 times [2019-12-07 17:35:57,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:57,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718872833] [2019-12-07 17:35:57,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:57,431 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:35:57,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718872833] [2019-12-07 17:35:57,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:57,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:35:57,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676566490] [2019-12-07 17:35:57,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:35:57,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:57,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:35:57,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:35:57,434 INFO L87 Difference]: Start difference. First operand 8258 states and 26572 transitions. Second operand 4 states. [2019-12-07 17:35:57,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:57,720 INFO L93 Difference]: Finished difference Result 12603 states and 38772 transitions. [2019-12-07 17:35:57,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:35:57,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 17:35:57,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:57,776 INFO L225 Difference]: With dead ends: 12603 [2019-12-07 17:35:57,777 INFO L226 Difference]: Without dead ends: 12589 [2019-12-07 17:35:57,777 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:35:57,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12589 states. [2019-12-07 17:35:58,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12589 to 11299. [2019-12-07 17:35:58,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11299 states. [2019-12-07 17:35:58,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11299 states to 11299 states and 35365 transitions. [2019-12-07 17:35:58,033 INFO L78 Accepts]: Start accepts. Automaton has 11299 states and 35365 transitions. Word has length 11 [2019-12-07 17:35:58,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:35:58,033 INFO L462 AbstractCegarLoop]: Abstraction has 11299 states and 35365 transitions. [2019-12-07 17:35:58,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:35:58,034 INFO L276 IsEmpty]: Start isEmpty. Operand 11299 states and 35365 transitions. [2019-12-07 17:35:58,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:35:58,038 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:58,038 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:35:58,038 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:35:58,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:58,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1209477957, now seen corresponding path program 1 times [2019-12-07 17:35:58,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:58,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733489495] [2019-12-07 17:35:58,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:58,092 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:35:58,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733489495] [2019-12-07 17:35:58,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:58,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:35:58,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768892105] [2019-12-07 17:35:58,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:35:58,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:58,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:35:58,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:35:58,093 INFO L87 Difference]: Start difference. First operand 11299 states and 35365 transitions. Second operand 4 states. [2019-12-07 17:35:58,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:58,233 INFO L93 Difference]: Finished difference Result 13736 states and 42816 transitions. [2019-12-07 17:35:58,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:35:58,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 17:35:58,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:58,267 INFO L225 Difference]: With dead ends: 13736 [2019-12-07 17:35:58,267 INFO L226 Difference]: Without dead ends: 13736 [2019-12-07 17:35:58,268 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:35:58,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13736 states. [2019-12-07 17:35:58,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13736 to 12234. [2019-12-07 17:35:58,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12234 states. [2019-12-07 17:35:58,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12234 states to 12234 states and 38359 transitions. [2019-12-07 17:35:58,553 INFO L78 Accepts]: Start accepts. Automaton has 12234 states and 38359 transitions. Word has length 14 [2019-12-07 17:35:58,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:35:58,554 INFO L462 AbstractCegarLoop]: Abstraction has 12234 states and 38359 transitions. [2019-12-07 17:35:58,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:35:58,554 INFO L276 IsEmpty]: Start isEmpty. Operand 12234 states and 38359 transitions. [2019-12-07 17:35:58,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:35:58,556 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:58,556 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:35:58,556 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:35:58,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:58,557 INFO L82 PathProgramCache]: Analyzing trace with hash -572907870, now seen corresponding path program 1 times [2019-12-07 17:35:58,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:58,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828518711] [2019-12-07 17:35:58,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:58,614 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:35:58,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828518711] [2019-12-07 17:35:58,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:58,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:35:58,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633964275] [2019-12-07 17:35:58,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:35:58,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:58,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:35:58,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:35:58,616 INFO L87 Difference]: Start difference. First operand 12234 states and 38359 transitions. Second operand 3 states. [2019-12-07 17:35:58,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:58,696 INFO L93 Difference]: Finished difference Result 21165 states and 65846 transitions. [2019-12-07 17:35:58,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:35:58,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 17:35:58,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:58,730 INFO L225 Difference]: With dead ends: 21165 [2019-12-07 17:35:58,730 INFO L226 Difference]: Without dead ends: 18521 [2019-12-07 17:35:58,731 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:35:58,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18521 states. [2019-12-07 17:35:59,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18521 to 17725. [2019-12-07 17:35:59,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17725 states. [2019-12-07 17:35:59,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17725 states to 17725 states and 55613 transitions. [2019-12-07 17:35:59,098 INFO L78 Accepts]: Start accepts. Automaton has 17725 states and 55613 transitions. Word has length 16 [2019-12-07 17:35:59,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:35:59,098 INFO L462 AbstractCegarLoop]: Abstraction has 17725 states and 55613 transitions. [2019-12-07 17:35:59,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:35:59,098 INFO L276 IsEmpty]: Start isEmpty. Operand 17725 states and 55613 transitions. [2019-12-07 17:35:59,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:35:59,102 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:59,102 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:35:59,103 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:35:59,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:59,103 INFO L82 PathProgramCache]: Analyzing trace with hash -574911552, now seen corresponding path program 1 times [2019-12-07 17:35:59,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:59,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362763933] [2019-12-07 17:35:59,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:59,140 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:35:59,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362763933] [2019-12-07 17:35:59,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:59,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:35:59,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772817179] [2019-12-07 17:35:59,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:35:59,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:59,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:35:59,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:35:59,141 INFO L87 Difference]: Start difference. First operand 17725 states and 55613 transitions. Second operand 3 states. [2019-12-07 17:35:59,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:59,190 INFO L93 Difference]: Finished difference Result 16785 states and 51752 transitions. [2019-12-07 17:35:59,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:35:59,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 17:35:59,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:59,210 INFO L225 Difference]: With dead ends: 16785 [2019-12-07 17:35:59,210 INFO L226 Difference]: Without dead ends: 16785 [2019-12-07 17:35:59,211 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:35:59,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16785 states. [2019-12-07 17:35:59,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16785 to 16697. [2019-12-07 17:35:59,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16697 states. [2019-12-07 17:35:59,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16697 states to 16697 states and 51504 transitions. [2019-12-07 17:35:59,491 INFO L78 Accepts]: Start accepts. Automaton has 16697 states and 51504 transitions. Word has length 17 [2019-12-07 17:35:59,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:35:59,491 INFO L462 AbstractCegarLoop]: Abstraction has 16697 states and 51504 transitions. [2019-12-07 17:35:59,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:35:59,491 INFO L276 IsEmpty]: Start isEmpty. Operand 16697 states and 51504 transitions. [2019-12-07 17:35:59,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:35:59,494 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:59,494 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:35:59,494 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:35:59,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:59,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1923749814, now seen corresponding path program 1 times [2019-12-07 17:35:59,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:59,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176504180] [2019-12-07 17:35:59,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:59,539 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:35:59,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176504180] [2019-12-07 17:35:59,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:59,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:35:59,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740950470] [2019-12-07 17:35:59,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:35:59,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:59,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:35:59,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:35:59,541 INFO L87 Difference]: Start difference. First operand 16697 states and 51504 transitions. Second operand 4 states. [2019-12-07 17:35:59,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:59,563 INFO L93 Difference]: Finished difference Result 3027 states and 7631 transitions. [2019-12-07 17:35:59,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:35:59,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 17:35:59,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:59,565 INFO L225 Difference]: With dead ends: 3027 [2019-12-07 17:35:59,565 INFO L226 Difference]: Without dead ends: 2101 [2019-12-07 17:35:59,565 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:35:59,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2101 states. [2019-12-07 17:35:59,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2101 to 2101. [2019-12-07 17:35:59,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2019-12-07 17:35:59,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 4686 transitions. [2019-12-07 17:35:59,587 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 4686 transitions. Word has length 17 [2019-12-07 17:35:59,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:35:59,587 INFO L462 AbstractCegarLoop]: Abstraction has 2101 states and 4686 transitions. [2019-12-07 17:35:59,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:35:59,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 4686 transitions. [2019-12-07 17:35:59,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 17:35:59,589 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:59,589 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:35:59,589 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:35:59,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:59,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1133745070, now seen corresponding path program 1 times [2019-12-07 17:35:59,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:59,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93064394] [2019-12-07 17:35:59,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:59,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:35:59,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93064394] [2019-12-07 17:35:59,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:59,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:35:59,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588405860] [2019-12-07 17:35:59,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:35:59,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:59,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:35:59,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:35:59,661 INFO L87 Difference]: Start difference. First operand 2101 states and 4686 transitions. Second operand 6 states. [2019-12-07 17:35:59,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:59,989 INFO L93 Difference]: Finished difference Result 5510 states and 12155 transitions. [2019-12-07 17:35:59,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:35:59,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 17:35:59,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:59,993 INFO L225 Difference]: With dead ends: 5510 [2019-12-07 17:35:59,993 INFO L226 Difference]: Without dead ends: 5475 [2019-12-07 17:35:59,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:36:00,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5475 states. [2019-12-07 17:36:00,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5475 to 2768. [2019-12-07 17:36:00,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2768 states. [2019-12-07 17:36:00,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2768 states and 6308 transitions. [2019-12-07 17:36:00,026 INFO L78 Accepts]: Start accepts. Automaton has 2768 states and 6308 transitions. Word has length 25 [2019-12-07 17:36:00,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:36:00,026 INFO L462 AbstractCegarLoop]: Abstraction has 2768 states and 6308 transitions. [2019-12-07 17:36:00,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:36:00,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2768 states and 6308 transitions. [2019-12-07 17:36:00,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 17:36:00,028 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:36:00,028 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:36:00,028 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:36:00,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:36:00,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1963896570, now seen corresponding path program 1 times [2019-12-07 17:36:00,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:36:00,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082393637] [2019-12-07 17:36:00,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:36:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:36:00,092 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:36:00,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082393637] [2019-12-07 17:36:00,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:36:00,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:36:00,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751555064] [2019-12-07 17:36:00,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:36:00,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:36:00,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:36:00,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:36:00,094 INFO L87 Difference]: Start difference. First operand 2768 states and 6308 transitions. Second operand 6 states. [2019-12-07 17:36:00,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:36:00,397 INFO L93 Difference]: Finished difference Result 5148 states and 11236 transitions. [2019-12-07 17:36:00,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:36:00,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-07 17:36:00,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:36:00,400 INFO L225 Difference]: With dead ends: 5148 [2019-12-07 17:36:00,401 INFO L226 Difference]: Without dead ends: 5119 [2019-12-07 17:36:00,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:36:00,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5119 states. [2019-12-07 17:36:00,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5119 to 2810. [2019-12-07 17:36:00,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2810 states. [2019-12-07 17:36:00,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 6417 transitions. [2019-12-07 17:36:00,434 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 6417 transitions. Word has length 26 [2019-12-07 17:36:00,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:36:00,434 INFO L462 AbstractCegarLoop]: Abstraction has 2810 states and 6417 transitions. [2019-12-07 17:36:00,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:36:00,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 6417 transitions. [2019-12-07 17:36:00,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 17:36:00,437 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:36:00,437 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:36:00,437 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:36:00,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:36:00,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1234551102, now seen corresponding path program 1 times [2019-12-07 17:36:00,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:36:00,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456129601] [2019-12-07 17:36:00,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:36:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:36:00,493 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:36:00,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456129601] [2019-12-07 17:36:00,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:36:00,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:36:00,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51163667] [2019-12-07 17:36:00,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:36:00,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:36:00,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:36:00,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:36:00,494 INFO L87 Difference]: Start difference. First operand 2810 states and 6417 transitions. Second operand 5 states. [2019-12-07 17:36:00,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:36:00,525 INFO L93 Difference]: Finished difference Result 1471 states and 3338 transitions. [2019-12-07 17:36:00,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:36:00,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 17:36:00,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:36:00,527 INFO L225 Difference]: With dead ends: 1471 [2019-12-07 17:36:00,528 INFO L226 Difference]: Without dead ends: 1312 [2019-12-07 17:36:00,528 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:36:00,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-12-07 17:36:00,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 841. [2019-12-07 17:36:00,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-12-07 17:36:00,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1889 transitions. [2019-12-07 17:36:00,544 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1889 transitions. Word has length 28 [2019-12-07 17:36:00,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:36:00,544 INFO L462 AbstractCegarLoop]: Abstraction has 841 states and 1889 transitions. [2019-12-07 17:36:00,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:36:00,545 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1889 transitions. [2019-12-07 17:36:00,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:36:00,547 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:36:00,547 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:36:00,547 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:36:00,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:36:00,548 INFO L82 PathProgramCache]: Analyzing trace with hash 551725022, now seen corresponding path program 1 times [2019-12-07 17:36:00,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:36:00,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194970252] [2019-12-07 17:36:00,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:36:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:36:00,605 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:36:00,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194970252] [2019-12-07 17:36:00,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:36:00,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:36:00,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014490047] [2019-12-07 17:36:00,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:36:00,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:36:00,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:36:00,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:36:00,607 INFO L87 Difference]: Start difference. First operand 841 states and 1889 transitions. Second operand 3 states. [2019-12-07 17:36:00,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:36:00,643 INFO L93 Difference]: Finished difference Result 1065 states and 2362 transitions. [2019-12-07 17:36:00,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:36:00,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 17:36:00,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:36:00,644 INFO L225 Difference]: With dead ends: 1065 [2019-12-07 17:36:00,645 INFO L226 Difference]: Without dead ends: 1065 [2019-12-07 17:36:00,645 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:36:00,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2019-12-07 17:36:00,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 765. [2019-12-07 17:36:00,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2019-12-07 17:36:00,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1700 transitions. [2019-12-07 17:36:00,655 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1700 transitions. Word has length 52 [2019-12-07 17:36:00,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:36:00,655 INFO L462 AbstractCegarLoop]: Abstraction has 765 states and 1700 transitions. [2019-12-07 17:36:00,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:36:00,655 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1700 transitions. [2019-12-07 17:36:00,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:36:00,657 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:36:00,657 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:36:00,657 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:36:00,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:36:00,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1774994823, now seen corresponding path program 1 times [2019-12-07 17:36:00,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:36:00,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44563811] [2019-12-07 17:36:00,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:36:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:36:00,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:36:00,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44563811] [2019-12-07 17:36:00,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:36:00,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:36:00,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329893924] [2019-12-07 17:36:00,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:36:00,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:36:00,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:36:00,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:36:00,746 INFO L87 Difference]: Start difference. First operand 765 states and 1700 transitions. Second operand 7 states. [2019-12-07 17:36:01,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:36:01,024 INFO L93 Difference]: Finished difference Result 3260 states and 7094 transitions. [2019-12-07 17:36:01,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 17:36:01,024 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-07 17:36:01,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:36:01,026 INFO L225 Difference]: With dead ends: 3260 [2019-12-07 17:36:01,027 INFO L226 Difference]: Without dead ends: 2226 [2019-12-07 17:36:01,027 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:36:01,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2019-12-07 17:36:01,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 888. [2019-12-07 17:36:01,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2019-12-07 17:36:01,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1964 transitions. [2019-12-07 17:36:01,038 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1964 transitions. Word has length 53 [2019-12-07 17:36:01,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:36:01,038 INFO L462 AbstractCegarLoop]: Abstraction has 888 states and 1964 transitions. [2019-12-07 17:36:01,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:36:01,038 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1964 transitions. [2019-12-07 17:36:01,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:36:01,039 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:36:01,039 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:36:01,040 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:36:01,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:36:01,040 INFO L82 PathProgramCache]: Analyzing trace with hash 238171223, now seen corresponding path program 2 times [2019-12-07 17:36:01,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:36:01,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199433469] [2019-12-07 17:36:01,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:36:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:36:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:36:01,128 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:36:01,128 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:36:01,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x~0_148) (= v_~x$r_buff0_thd0~0_133 0) (= v_~x$r_buff0_thd1~0_227 0) (= v_~weak$$choice2~0_120 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_40 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1705~0.base_24|) (= 0 |v_ULTIMATE.start_main_~#t1705~0.offset_18|) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1705~0.base_24| 1)) (= 0 v_~__unbuffered_cnt~0_63) (= v_~main$tmp_guard1~0_41 0) (= v_~y~0_147 0) (= 0 |v_#NULL.base_6|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_24 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1705~0.base_24|)) (= 0 v_~x$w_buff1_used~0_507) (= 0 v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd0~0_183 0) (= 0 v_~x$w_buff1~0_317) (= 0 v_~x$w_buff0~0_542) (= 0 v_~x$r_buff0_thd2~0_359) (= 0 v_~x$read_delayed_var~0.offset_7) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1705~0.base_24| 4) |v_#length_13|) (= 0 v_~x$w_buff0_used~0_792) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1705~0.base_24| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1705~0.base_24|) |v_ULTIMATE.start_main_~#t1705~0.offset_18| 0)) |v_#memory_int_13|) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x$r_buff1_thd2~0_331) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_542, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, ULTIMATE.start_main_~#t1706~0.base=|v_ULTIMATE.start_main_~#t1706~0.base_16|, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, #length=|v_#length_13|, ~y~0=v_~y~0_147, ULTIMATE.start_main_~#t1705~0.offset=|v_ULTIMATE.start_main_~#t1705~0.offset_18|, ULTIMATE.start_main_~#t1705~0.base=|v_ULTIMATE.start_main_~#t1705~0.base_24|, ULTIMATE.start_main_~#t1706~0.offset=|v_ULTIMATE.start_main_~#t1706~0.offset_14|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_507, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_331, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_359, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_792, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_148, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1706~0.base, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t1705~0.offset, ULTIMATE.start_main_~#t1705~0.base, ULTIMATE.start_main_~#t1706~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 17:36:01,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= 1 v_~x$r_buff0_thd1~0_40) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72 0)) (= v_~x$r_buff1_thd1~0_23 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd2~0_64 v_~x$r_buff0_thd2~0_110) (= v_~y~0_18 1) (= v_~x$r_buff1_thd0~0_37 v_~x$r_buff0_thd0~0_53)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~y~0=v_~y~0_18, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_37} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 17:36:01,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-1-->L799: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1706~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t1706~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t1706~0.base_12| 0)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1706~0.base_12| 1) |v_#valid_27|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1706~0.base_12|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1706~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1706~0.base_12|) |v_ULTIMATE.start_main_~#t1706~0.offset_10| 1)) |v_#memory_int_9|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1706~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1706~0.offset=|v_ULTIMATE.start_main_~#t1706~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1706~0.base=|v_ULTIMATE.start_main_~#t1706~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1706~0.offset, ULTIMATE.start_main_~#t1706~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 17:36:01,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1714366664 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1714366664 256)))) (or (and (= ~x$w_buff0_used~0_In-1714366664 |P0Thread1of1ForFork0_#t~ite5_Out-1714366664|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1714366664|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1714366664, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1714366664} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1714366664|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1714366664, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1714366664} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:36:01,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1379247409 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out1379247409| ~x$w_buff0~0_In1379247409) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In1379247409| |P1Thread1of1ForFork1_#t~ite14_Out1379247409|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite14_Out1379247409| |P1Thread1of1ForFork1_#t~ite15_Out1379247409|) (= |P1Thread1of1ForFork1_#t~ite14_Out1379247409| ~x$w_buff0~0_In1379247409) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1379247409 256) 0))) (or (and (= (mod ~x$r_buff1_thd2~0_In1379247409 256) 0) .cse1) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1379247409 256))) (= 0 (mod ~x$w_buff0_used~0_In1379247409 256))))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1379247409, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1379247409, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1379247409, ~weak$$choice2~0=~weak$$choice2~0_In1379247409, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1379247409, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1379247409|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1379247409} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1379247409, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1379247409, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1379247409, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1379247409|, ~weak$$choice2~0=~weak$$choice2~0_In1379247409, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1379247409, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1379247409|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1379247409} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 17:36:01,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In891475039 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In891475039 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In891475039 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In891475039 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out891475039| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite6_Out891475039| ~x$w_buff1_used~0_In891475039) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In891475039, ~x$w_buff1_used~0=~x$w_buff1_used~0_In891475039, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In891475039, ~x$w_buff0_used~0=~x$w_buff0_used~0_In891475039} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out891475039|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In891475039, ~x$w_buff1_used~0=~x$w_buff1_used~0_In891475039, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In891475039, ~x$w_buff0_used~0=~x$w_buff0_used~0_In891475039} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:36:01,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= ~x$r_buff0_thd1~0_In343263277 ~x$r_buff0_thd1~0_Out343263277)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In343263277 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In343263277 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse1) (= 0 ~x$r_buff0_thd1~0_Out343263277) (not .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In343263277, ~x$w_buff0_used~0=~x$w_buff0_used~0_In343263277} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out343263277, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out343263277|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In343263277} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 17:36:01,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-1653299599 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In-1653299599 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd1~0_In-1653299599 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1653299599 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1653299599| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out-1653299599| ~x$r_buff1_thd1~0_In-1653299599)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1653299599, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1653299599, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1653299599, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1653299599} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1653299599, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1653299599|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1653299599, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1653299599, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1653299599} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:36:01,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~x$r_buff1_thd1~0_128 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_128} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-07 17:36:01,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-43351937 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_In-43351937| |P1Thread1of1ForFork1_#t~ite17_Out-43351937|) (= ~x$w_buff1~0_In-43351937 |P1Thread1of1ForFork1_#t~ite18_Out-43351937|) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite18_Out-43351937| |P1Thread1of1ForFork1_#t~ite17_Out-43351937|) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-43351937 256) 0))) (or (= (mod ~x$w_buff0_used~0_In-43351937 256) 0) (and (= 0 (mod ~x$r_buff1_thd2~0_In-43351937 256)) .cse1) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-43351937 256))))) (= ~x$w_buff1~0_In-43351937 |P1Thread1of1ForFork1_#t~ite17_Out-43351937|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-43351937, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-43351937, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-43351937, ~weak$$choice2~0=~weak$$choice2~0_In-43351937, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-43351937, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-43351937|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-43351937} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-43351937|, ~x$w_buff1~0=~x$w_buff1~0_In-43351937, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-43351937, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-43351937, ~weak$$choice2~0=~weak$$choice2~0_In-43351937, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-43351937, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-43351937|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-43351937} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 17:36:01,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1248105103 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_Out1248105103| |P1Thread1of1ForFork1_#t~ite21_Out1248105103|) (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1248105103 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In1248105103 256)) (and (= 0 (mod ~x$w_buff1_used~0_In1248105103 256)) .cse0) (and .cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1248105103 256))))) .cse1 (= |P1Thread1of1ForFork1_#t~ite20_Out1248105103| ~x$w_buff0_used~0_In1248105103)) (and (= |P1Thread1of1ForFork1_#t~ite20_In1248105103| |P1Thread1of1ForFork1_#t~ite20_Out1248105103|) (= ~x$w_buff0_used~0_In1248105103 |P1Thread1of1ForFork1_#t~ite21_Out1248105103|) (not .cse1)))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1248105103|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1248105103, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1248105103, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1248105103, ~weak$$choice2~0=~weak$$choice2~0_In1248105103, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1248105103} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1248105103|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1248105103, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1248105103, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1248105103|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1248105103, ~weak$$choice2~0=~weak$$choice2~0_In1248105103, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1248105103} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 17:36:01,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd2~0_135 v_~x$r_buff0_thd2~0_134)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_27, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 17:36:01,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L768-->L768-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-969945301 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-969945301 256)))) (or (= (mod ~x$w_buff0_used~0_In-969945301 256) 0) (and (= 0 (mod ~x$r_buff1_thd2~0_In-969945301 256)) .cse0) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-969945301 256))))) (= |P1Thread1of1ForFork1_#t~ite29_Out-969945301| ~x$r_buff1_thd2~0_In-969945301) (= |P1Thread1of1ForFork1_#t~ite29_Out-969945301| |P1Thread1of1ForFork1_#t~ite30_Out-969945301|) .cse1) (and (= ~x$r_buff1_thd2~0_In-969945301 |P1Thread1of1ForFork1_#t~ite30_Out-969945301|) (= |P1Thread1of1ForFork1_#t~ite29_In-969945301| |P1Thread1of1ForFork1_#t~ite29_Out-969945301|) (not .cse1)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-969945301|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-969945301, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-969945301, ~weak$$choice2~0=~weak$$choice2~0_In-969945301, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-969945301, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-969945301} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-969945301|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-969945301|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-969945301, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-969945301, ~weak$$choice2~0=~weak$$choice2~0_In-969945301, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-969945301, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-969945301} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 17:36:01,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-07 17:36:01,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In583179783 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In583179783 256)))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In583179783 |P1Thread1of1ForFork1_#t~ite32_Out583179783|)) (and (= ~x~0_In583179783 |P1Thread1of1ForFork1_#t~ite32_Out583179783|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In583179783, ~x$w_buff1_used~0=~x$w_buff1_used~0_In583179783, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In583179783, ~x~0=~x~0_In583179783} OutVars{~x$w_buff1~0=~x$w_buff1~0_In583179783, ~x$w_buff1_used~0=~x$w_buff1_used~0_In583179783, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In583179783, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out583179783|, ~x~0=~x~0_In583179783} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 17:36:01,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 17:36:01,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In2120818471 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In2120818471 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out2120818471|)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In2120818471 |P1Thread1of1ForFork1_#t~ite34_Out2120818471|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2120818471, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2120818471} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out2120818471|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2120818471, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2120818471} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:36:01,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In2070422756 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In2070422756 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In2070422756 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In2070422756 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In2070422756 |P1Thread1of1ForFork1_#t~ite35_Out2070422756|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out2070422756|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2070422756, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2070422756, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2070422756, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2070422756} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In2070422756, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2070422756, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out2070422756|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2070422756, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2070422756} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:36:01,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-2107952848 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2107952848 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-2107952848|)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-2107952848| ~x$r_buff0_thd2~0_In-2107952848) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2107952848, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2107952848} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2107952848, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-2107952848|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2107952848} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:36:01,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-168825926 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-168825926 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-168825926 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-168825926 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite37_Out-168825926| ~x$r_buff1_thd2~0_In-168825926)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-168825926| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-168825926, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-168825926, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-168825926, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-168825926} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-168825926, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-168825926, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-168825926, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-168825926|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-168825926} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:36:01,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L778-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_269 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:36:01,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_64 256)) (= (mod v_~x$w_buff0_used~0_301 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:36:01,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In183422257 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In183422257 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out183422257| ~x~0_In183422257)) (and (= |ULTIMATE.start_main_#t~ite40_Out183422257| ~x$w_buff1~0_In183422257) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In183422257, ~x$w_buff1_used~0=~x$w_buff1_used~0_In183422257, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In183422257, ~x~0=~x~0_In183422257} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out183422257|, ~x$w_buff1~0=~x$w_buff1~0_In183422257, ~x$w_buff1_used~0=~x$w_buff1_used~0_In183422257, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In183422257, ~x~0=~x~0_In183422257} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:36:01,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_46 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-07 17:36:01,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1157600186 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1157600186 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-1157600186| ~x$w_buff0_used~0_In-1157600186) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-1157600186| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1157600186, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1157600186} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1157600186, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1157600186|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1157600186} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:36:01,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1092865336 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1092865336 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1092865336 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1092865336 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1092865336| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite43_Out-1092865336| ~x$w_buff1_used~0_In-1092865336) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1092865336, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1092865336, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1092865336, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1092865336} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1092865336, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1092865336, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1092865336|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1092865336, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1092865336} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:36:01,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In629680203 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In629680203 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out629680203| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In629680203 |ULTIMATE.start_main_#t~ite44_Out629680203|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In629680203, ~x$w_buff0_used~0=~x$w_buff0_used~0_In629680203} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In629680203, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out629680203|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In629680203} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:36:01,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In641181355 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In641181355 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In641181355 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In641181355 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out641181355| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In641181355 |ULTIMATE.start_main_#t~ite45_Out641181355|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In641181355, ~x$w_buff1_used~0=~x$w_buff1_used~0_In641181355, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In641181355, ~x$w_buff0_used~0=~x$w_buff0_used~0_In641181355} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In641181355, ~x$w_buff1_used~0=~x$w_buff1_used~0_In641181355, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In641181355, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out641181355|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In641181355} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:36:01,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~y~0_126 2) (= 2 v_~__unbuffered_p1_EAX~0_27))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite45_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (mod v_~main$tmp_guard1~0_20 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y~0=v_~y~0_126, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, 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, ~x$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:36:01,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:36:01 BasicIcfg [2019-12-07 17:36:01,188 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:36:01,188 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:36:01,189 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:36:01,189 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:36:01,189 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:35:53" (3/4) ... [2019-12-07 17:36:01,191 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:36:01,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x~0_148) (= v_~x$r_buff0_thd0~0_133 0) (= v_~x$r_buff0_thd1~0_227 0) (= v_~weak$$choice2~0_120 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_40 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1705~0.base_24|) (= 0 |v_ULTIMATE.start_main_~#t1705~0.offset_18|) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1705~0.base_24| 1)) (= 0 v_~__unbuffered_cnt~0_63) (= v_~main$tmp_guard1~0_41 0) (= v_~y~0_147 0) (= 0 |v_#NULL.base_6|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_24 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1705~0.base_24|)) (= 0 v_~x$w_buff1_used~0_507) (= 0 v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd0~0_183 0) (= 0 v_~x$w_buff1~0_317) (= 0 v_~x$w_buff0~0_542) (= 0 v_~x$r_buff0_thd2~0_359) (= 0 v_~x$read_delayed_var~0.offset_7) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1705~0.base_24| 4) |v_#length_13|) (= 0 v_~x$w_buff0_used~0_792) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1705~0.base_24| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1705~0.base_24|) |v_ULTIMATE.start_main_~#t1705~0.offset_18| 0)) |v_#memory_int_13|) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x$r_buff1_thd2~0_331) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_542, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, ULTIMATE.start_main_~#t1706~0.base=|v_ULTIMATE.start_main_~#t1706~0.base_16|, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, #length=|v_#length_13|, ~y~0=v_~y~0_147, ULTIMATE.start_main_~#t1705~0.offset=|v_ULTIMATE.start_main_~#t1705~0.offset_18|, ULTIMATE.start_main_~#t1705~0.base=|v_ULTIMATE.start_main_~#t1705~0.base_24|, ULTIMATE.start_main_~#t1706~0.offset=|v_ULTIMATE.start_main_~#t1706~0.offset_14|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_507, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_331, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_359, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_792, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_148, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1706~0.base, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t1705~0.offset, ULTIMATE.start_main_~#t1705~0.base, ULTIMATE.start_main_~#t1706~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 17:36:01,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= 1 v_~x$r_buff0_thd1~0_40) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72 0)) (= v_~x$r_buff1_thd1~0_23 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd2~0_64 v_~x$r_buff0_thd2~0_110) (= v_~y~0_18 1) (= v_~x$r_buff1_thd0~0_37 v_~x$r_buff0_thd0~0_53)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~y~0=v_~y~0_18, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_37} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 17:36:01,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-1-->L799: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1706~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t1706~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t1706~0.base_12| 0)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1706~0.base_12| 1) |v_#valid_27|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1706~0.base_12|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1706~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1706~0.base_12|) |v_ULTIMATE.start_main_~#t1706~0.offset_10| 1)) |v_#memory_int_9|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1706~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1706~0.offset=|v_ULTIMATE.start_main_~#t1706~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1706~0.base=|v_ULTIMATE.start_main_~#t1706~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1706~0.offset, ULTIMATE.start_main_~#t1706~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 17:36:01,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1714366664 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1714366664 256)))) (or (and (= ~x$w_buff0_used~0_In-1714366664 |P0Thread1of1ForFork0_#t~ite5_Out-1714366664|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1714366664|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1714366664, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1714366664} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1714366664|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1714366664, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1714366664} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:36:01,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1379247409 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out1379247409| ~x$w_buff0~0_In1379247409) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In1379247409| |P1Thread1of1ForFork1_#t~ite14_Out1379247409|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite14_Out1379247409| |P1Thread1of1ForFork1_#t~ite15_Out1379247409|) (= |P1Thread1of1ForFork1_#t~ite14_Out1379247409| ~x$w_buff0~0_In1379247409) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1379247409 256) 0))) (or (and (= (mod ~x$r_buff1_thd2~0_In1379247409 256) 0) .cse1) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1379247409 256))) (= 0 (mod ~x$w_buff0_used~0_In1379247409 256))))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1379247409, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1379247409, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1379247409, ~weak$$choice2~0=~weak$$choice2~0_In1379247409, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1379247409, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1379247409|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1379247409} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1379247409, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1379247409, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1379247409, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1379247409|, ~weak$$choice2~0=~weak$$choice2~0_In1379247409, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1379247409, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1379247409|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1379247409} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 17:36:01,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In891475039 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In891475039 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In891475039 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In891475039 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out891475039| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite6_Out891475039| ~x$w_buff1_used~0_In891475039) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In891475039, ~x$w_buff1_used~0=~x$w_buff1_used~0_In891475039, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In891475039, ~x$w_buff0_used~0=~x$w_buff0_used~0_In891475039} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out891475039|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In891475039, ~x$w_buff1_used~0=~x$w_buff1_used~0_In891475039, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In891475039, ~x$w_buff0_used~0=~x$w_buff0_used~0_In891475039} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:36:01,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= ~x$r_buff0_thd1~0_In343263277 ~x$r_buff0_thd1~0_Out343263277)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In343263277 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In343263277 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse1) (= 0 ~x$r_buff0_thd1~0_Out343263277) (not .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In343263277, ~x$w_buff0_used~0=~x$w_buff0_used~0_In343263277} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out343263277, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out343263277|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In343263277} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 17:36:01,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-1653299599 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In-1653299599 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd1~0_In-1653299599 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1653299599 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1653299599| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out-1653299599| ~x$r_buff1_thd1~0_In-1653299599)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1653299599, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1653299599, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1653299599, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1653299599} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1653299599, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1653299599|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1653299599, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1653299599, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1653299599} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:36:01,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~x$r_buff1_thd1~0_128 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_128} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-07 17:36:01,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-43351937 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_In-43351937| |P1Thread1of1ForFork1_#t~ite17_Out-43351937|) (= ~x$w_buff1~0_In-43351937 |P1Thread1of1ForFork1_#t~ite18_Out-43351937|) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite18_Out-43351937| |P1Thread1of1ForFork1_#t~ite17_Out-43351937|) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-43351937 256) 0))) (or (= (mod ~x$w_buff0_used~0_In-43351937 256) 0) (and (= 0 (mod ~x$r_buff1_thd2~0_In-43351937 256)) .cse1) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-43351937 256))))) (= ~x$w_buff1~0_In-43351937 |P1Thread1of1ForFork1_#t~ite17_Out-43351937|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-43351937, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-43351937, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-43351937, ~weak$$choice2~0=~weak$$choice2~0_In-43351937, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-43351937, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-43351937|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-43351937} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-43351937|, ~x$w_buff1~0=~x$w_buff1~0_In-43351937, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-43351937, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-43351937, ~weak$$choice2~0=~weak$$choice2~0_In-43351937, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-43351937, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-43351937|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-43351937} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 17:36:01,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1248105103 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_Out1248105103| |P1Thread1of1ForFork1_#t~ite21_Out1248105103|) (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1248105103 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In1248105103 256)) (and (= 0 (mod ~x$w_buff1_used~0_In1248105103 256)) .cse0) (and .cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1248105103 256))))) .cse1 (= |P1Thread1of1ForFork1_#t~ite20_Out1248105103| ~x$w_buff0_used~0_In1248105103)) (and (= |P1Thread1of1ForFork1_#t~ite20_In1248105103| |P1Thread1of1ForFork1_#t~ite20_Out1248105103|) (= ~x$w_buff0_used~0_In1248105103 |P1Thread1of1ForFork1_#t~ite21_Out1248105103|) (not .cse1)))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1248105103|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1248105103, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1248105103, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1248105103, ~weak$$choice2~0=~weak$$choice2~0_In1248105103, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1248105103} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1248105103|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1248105103, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1248105103, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1248105103|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1248105103, ~weak$$choice2~0=~weak$$choice2~0_In1248105103, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1248105103} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 17:36:01,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd2~0_135 v_~x$r_buff0_thd2~0_134)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_27, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 17:36:01,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L768-->L768-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-969945301 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-969945301 256)))) (or (= (mod ~x$w_buff0_used~0_In-969945301 256) 0) (and (= 0 (mod ~x$r_buff1_thd2~0_In-969945301 256)) .cse0) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-969945301 256))))) (= |P1Thread1of1ForFork1_#t~ite29_Out-969945301| ~x$r_buff1_thd2~0_In-969945301) (= |P1Thread1of1ForFork1_#t~ite29_Out-969945301| |P1Thread1of1ForFork1_#t~ite30_Out-969945301|) .cse1) (and (= ~x$r_buff1_thd2~0_In-969945301 |P1Thread1of1ForFork1_#t~ite30_Out-969945301|) (= |P1Thread1of1ForFork1_#t~ite29_In-969945301| |P1Thread1of1ForFork1_#t~ite29_Out-969945301|) (not .cse1)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-969945301|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-969945301, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-969945301, ~weak$$choice2~0=~weak$$choice2~0_In-969945301, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-969945301, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-969945301} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-969945301|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-969945301|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-969945301, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-969945301, ~weak$$choice2~0=~weak$$choice2~0_In-969945301, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-969945301, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-969945301} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 17:36:01,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-07 17:36:01,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In583179783 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In583179783 256)))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In583179783 |P1Thread1of1ForFork1_#t~ite32_Out583179783|)) (and (= ~x~0_In583179783 |P1Thread1of1ForFork1_#t~ite32_Out583179783|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In583179783, ~x$w_buff1_used~0=~x$w_buff1_used~0_In583179783, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In583179783, ~x~0=~x~0_In583179783} OutVars{~x$w_buff1~0=~x$w_buff1~0_In583179783, ~x$w_buff1_used~0=~x$w_buff1_used~0_In583179783, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In583179783, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out583179783|, ~x~0=~x~0_In583179783} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 17:36:01,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 17:36:01,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In2120818471 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In2120818471 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out2120818471|)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In2120818471 |P1Thread1of1ForFork1_#t~ite34_Out2120818471|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2120818471, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2120818471} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out2120818471|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2120818471, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2120818471} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:36:01,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In2070422756 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In2070422756 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In2070422756 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In2070422756 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In2070422756 |P1Thread1of1ForFork1_#t~ite35_Out2070422756|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out2070422756|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2070422756, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2070422756, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2070422756, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2070422756} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In2070422756, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2070422756, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out2070422756|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2070422756, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2070422756} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:36:01,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-2107952848 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2107952848 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-2107952848|)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-2107952848| ~x$r_buff0_thd2~0_In-2107952848) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2107952848, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2107952848} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2107952848, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-2107952848|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2107952848} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:36:01,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-168825926 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-168825926 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-168825926 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-168825926 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite37_Out-168825926| ~x$r_buff1_thd2~0_In-168825926)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-168825926| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-168825926, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-168825926, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-168825926, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-168825926} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-168825926, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-168825926, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-168825926, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-168825926|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-168825926} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:36:01,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L778-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_269 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:36:01,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_64 256)) (= (mod v_~x$w_buff0_used~0_301 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:36:01,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In183422257 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In183422257 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out183422257| ~x~0_In183422257)) (and (= |ULTIMATE.start_main_#t~ite40_Out183422257| ~x$w_buff1~0_In183422257) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In183422257, ~x$w_buff1_used~0=~x$w_buff1_used~0_In183422257, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In183422257, ~x~0=~x~0_In183422257} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out183422257|, ~x$w_buff1~0=~x$w_buff1~0_In183422257, ~x$w_buff1_used~0=~x$w_buff1_used~0_In183422257, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In183422257, ~x~0=~x~0_In183422257} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:36:01,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_46 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-07 17:36:01,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1157600186 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1157600186 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-1157600186| ~x$w_buff0_used~0_In-1157600186) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-1157600186| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1157600186, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1157600186} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1157600186, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1157600186|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1157600186} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:36:01,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1092865336 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1092865336 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1092865336 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1092865336 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1092865336| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite43_Out-1092865336| ~x$w_buff1_used~0_In-1092865336) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1092865336, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1092865336, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1092865336, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1092865336} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1092865336, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1092865336, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1092865336|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1092865336, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1092865336} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:36:01,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In629680203 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In629680203 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out629680203| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In629680203 |ULTIMATE.start_main_#t~ite44_Out629680203|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In629680203, ~x$w_buff0_used~0=~x$w_buff0_used~0_In629680203} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In629680203, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out629680203|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In629680203} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:36:01,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In641181355 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In641181355 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In641181355 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In641181355 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out641181355| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In641181355 |ULTIMATE.start_main_#t~ite45_Out641181355|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In641181355, ~x$w_buff1_used~0=~x$w_buff1_used~0_In641181355, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In641181355, ~x$w_buff0_used~0=~x$w_buff0_used~0_In641181355} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In641181355, ~x$w_buff1_used~0=~x$w_buff1_used~0_In641181355, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In641181355, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out641181355|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In641181355} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:36:01,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~y~0_126 2) (= 2 v_~__unbuffered_p1_EAX~0_27))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite45_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (mod v_~main$tmp_guard1~0_20 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y~0=v_~y~0_126, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, 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, ~x$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:36:01,257 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b7c60acb-db2b-4791-8206-ca5268e5ac28/bin/uautomizer/witness.graphml [2019-12-07 17:36:01,257 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:36:01,258 INFO L168 Benchmark]: Toolchain (without parser) took 8963.45 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 420.0 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -257.5 MB). Peak memory consumption was 162.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:36:01,259 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:36:01,259 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -135.7 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:36:01,259 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.76 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:36:01,260 INFO L168 Benchmark]: Boogie Preprocessor took 26.58 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:36:01,260 INFO L168 Benchmark]: RCFGBuilder took 382.20 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: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:36:01,260 INFO L168 Benchmark]: TraceAbstraction took 8071.93 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 316.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -200.8 MB). Peak memory consumption was 115.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:36:01,261 INFO L168 Benchmark]: Witness Printer took 68.66 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:36:01,263 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 372.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -135.7 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.76 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 26.58 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 382.20 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: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8071.93 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 316.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -200.8 MB). Peak memory consumption was 115.9 MB. Max. memory is 11.5 GB. * Witness Printer took 68.66 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.0s, 147 ProgramPointsBefore, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 29 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 26 ChoiceCompositions, 4894 VarBasedMoverChecksPositive, 354 VarBasedMoverChecksNegative, 269 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 76691 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1705, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] FCALL, FORK 0 pthread_create(&t1706, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 7.9s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1576 SDtfs, 1738 SDslu, 2986 SDs, 0 SdLazy, 1265 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17725occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 10801 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 251 ConstructedInterpolants, 0 QuantifiedInterpolants, 37081 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...