./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix035_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0223c396-719d-44b4-89c8-532210e493c3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0223c396-719d-44b4-89c8-532210e493c3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0223c396-719d-44b4-89c8-532210e493c3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0223c396-719d-44b4-89c8-532210e493c3/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix035_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0223c396-719d-44b4-89c8-532210e493c3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0223c396-719d-44b4-89c8-532210e493c3/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 3aabc9e9654ad4a63396f8e7131c3791fb9a722b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:36:40,387 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:36:40,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:36:40,396 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:36:40,396 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:36:40,397 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:36:40,398 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:36:40,399 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:36:40,400 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:36:40,401 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:36:40,401 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:36:40,402 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:36:40,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:36:40,403 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:36:40,404 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:36:40,405 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:36:40,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:36:40,406 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:36:40,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:36:40,408 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:36:40,410 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:36:40,410 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:36:40,411 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:36:40,411 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:36:40,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:36:40,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:36:40,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:36:40,414 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:36:40,414 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:36:40,415 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:36:40,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:36:40,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:36:40,416 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:36:40,416 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:36:40,417 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:36:40,417 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:36:40,417 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:36:40,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:36:40,418 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:36:40,418 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:36:40,419 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:36:40,419 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0223c396-719d-44b4-89c8-532210e493c3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:36:40,429 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:36:40,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:36:40,430 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:36:40,430 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:36:40,430 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:36:40,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:36:40,430 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:36:40,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:36:40,431 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:36:40,431 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:36:40,431 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:36:40,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:36:40,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:36:40,431 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:36:40,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:36:40,431 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:36:40,432 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:36:40,432 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:36:40,432 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:36:40,432 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:36:40,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:36:40,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:36:40,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:36:40,433 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:36:40,433 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:36:40,433 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:36:40,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:36:40,433 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:36:40,433 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:36:40,433 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_0223c396-719d-44b4-89c8-532210e493c3/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 -> 3aabc9e9654ad4a63396f8e7131c3791fb9a722b [2019-12-07 17:36:40,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:36:40,542 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:36:40,545 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:36:40,546 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:36:40,547 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:36:40,547 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0223c396-719d-44b4-89c8-532210e493c3/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix035_power.opt.i [2019-12-07 17:36:40,587 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0223c396-719d-44b4-89c8-532210e493c3/bin/uautomizer/data/ba8c89d71/cd97b425b36540699eff524d0b47f1f2/FLAGe66451f32 [2019-12-07 17:36:40,989 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:36:40,989 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0223c396-719d-44b4-89c8-532210e493c3/sv-benchmarks/c/pthread-wmm/mix035_power.opt.i [2019-12-07 17:36:41,000 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0223c396-719d-44b4-89c8-532210e493c3/bin/uautomizer/data/ba8c89d71/cd97b425b36540699eff524d0b47f1f2/FLAGe66451f32 [2019-12-07 17:36:41,009 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0223c396-719d-44b4-89c8-532210e493c3/bin/uautomizer/data/ba8c89d71/cd97b425b36540699eff524d0b47f1f2 [2019-12-07 17:36:41,011 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:36:41,012 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:36:41,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:36:41,013 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:36:41,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:36:41,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:36:41" (1/1) ... [2019-12-07 17:36:41,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd1e142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:36:41, skipping insertion in model container [2019-12-07 17:36:41,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:36:41" (1/1) ... [2019-12-07 17:36:41,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:36:41,053 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:36:41,300 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:36:41,309 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:36:41,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:36:41,395 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:36:41,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:36:41 WrapperNode [2019-12-07 17:36:41,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:36:41,396 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:36:41,396 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:36:41,396 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:36:41,402 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:36:41" (1/1) ... [2019-12-07 17:36:41,414 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:36:41" (1/1) ... [2019-12-07 17:36:41,434 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:36:41,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:36:41,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:36:41,434 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:36:41,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:36:41" (1/1) ... [2019-12-07 17:36:41,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:36:41" (1/1) ... [2019-12-07 17:36:41,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:36:41" (1/1) ... [2019-12-07 17:36:41,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:36:41" (1/1) ... [2019-12-07 17:36:41,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:36:41" (1/1) ... [2019-12-07 17:36:41,453 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:36:41" (1/1) ... [2019-12-07 17:36:41,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:36:41" (1/1) ... [2019-12-07 17:36:41,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:36:41,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:36:41,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:36:41,459 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:36:41,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:36:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0223c396-719d-44b4-89c8-532210e493c3/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:36:41,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:36:41,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:36:41,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:36:41,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:36:41,503 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:36:41,503 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:36:41,503 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:36:41,503 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:36:41,503 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 17:36:41,504 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 17:36:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:36:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:36:41,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:36:41,505 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:36:41,849 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:36:41,850 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:36:41,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:36:41 BoogieIcfgContainer [2019-12-07 17:36:41,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:36:41,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:36:41,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:36:41,853 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:36:41,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:36:41" (1/3) ... [2019-12-07 17:36:41,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b12f8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:36:41, skipping insertion in model container [2019-12-07 17:36:41,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:36:41" (2/3) ... [2019-12-07 17:36:41,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b12f8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:36:41, skipping insertion in model container [2019-12-07 17:36:41,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:36:41" (3/3) ... [2019-12-07 17:36:41,855 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_power.opt.i [2019-12-07 17:36:41,862 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:36:41,862 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:36:41,867 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:36:41,867 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:36:41,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,891 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,891 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,901 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,902 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,902 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,902 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,902 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,905 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,905 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:36:41,919 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 17:36:41,931 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:36:41,931 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:36:41,931 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:36:41,931 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:36:41,932 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:36:41,932 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:36:41,932 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:36:41,932 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:36:41,942 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 197 transitions [2019-12-07 17:36:41,944 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-07 17:36:41,996 INFO L134 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-07 17:36:41,996 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:36:42,006 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 724 event pairs. 9/160 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 17:36:42,020 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-07 17:36:42,047 INFO L134 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-07 17:36:42,048 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:36:42,053 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 724 event pairs. 9/160 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 17:36:42,069 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-07 17:36:42,069 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:36:45,099 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-07 17:36:45,229 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66821 [2019-12-07 17:36:45,229 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-07 17:36:45,232 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 91 transitions [2019-12-07 17:36:54,321 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-07 17:36:54,323 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-07 17:36:54,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 17:36:54,326 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:36:54,327 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 17:36:54,327 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:36:54,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:36:54,331 INFO L82 PathProgramCache]: Analyzing trace with hash 802094366, now seen corresponding path program 1 times [2019-12-07 17:36:54,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:36:54,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758696367] [2019-12-07 17:36:54,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:36:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:36:54,477 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:54,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758696367] [2019-12-07 17:36:54,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:36:54,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:36:54,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530479818] [2019-12-07 17:36:54,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:36:54,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:36:54,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:36:54,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:36:54,491 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-07 17:36:55,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:36:55,176 INFO L93 Difference]: Finished difference Result 87938 states and 378592 transitions. [2019-12-07 17:36:55,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:36:55,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 17:36:55,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:36:55,536 INFO L225 Difference]: With dead ends: 87938 [2019-12-07 17:36:55,536 INFO L226 Difference]: Without dead ends: 82842 [2019-12-07 17:36:55,536 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:36:58,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82842 states. [2019-12-07 17:36:59,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82842 to 82842. [2019-12-07 17:36:59,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82842 states. [2019-12-07 17:37:00,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82842 states to 82842 states and 356178 transitions. [2019-12-07 17:37:00,283 INFO L78 Accepts]: Start accepts. Automaton has 82842 states and 356178 transitions. Word has length 5 [2019-12-07 17:37:00,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:00,283 INFO L462 AbstractCegarLoop]: Abstraction has 82842 states and 356178 transitions. [2019-12-07 17:37:00,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:37:00,284 INFO L276 IsEmpty]: Start isEmpty. Operand 82842 states and 356178 transitions. [2019-12-07 17:37:00,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 17:37:00,289 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:00,289 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:00,289 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:00,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:00,290 INFO L82 PathProgramCache]: Analyzing trace with hash -136321435, now seen corresponding path program 1 times [2019-12-07 17:37:00,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:00,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521458310] [2019-12-07 17:37:00,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:00,338 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:37:00,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521458310] [2019-12-07 17:37:00,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:00,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:37:00,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598114087] [2019-12-07 17:37:00,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:37:00,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:00,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:37:00,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:37:00,341 INFO L87 Difference]: Start difference. First operand 82842 states and 356178 transitions. Second operand 3 states. [2019-12-07 17:37:01,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:01,584 INFO L93 Difference]: Finished difference Result 21610 states and 74688 transitions. [2019-12-07 17:37:01,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:37:01,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 17:37:01,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:01,637 INFO L225 Difference]: With dead ends: 21610 [2019-12-07 17:37:01,637 INFO L226 Difference]: Without dead ends: 21610 [2019-12-07 17:37:01,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:37:01,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21610 states. [2019-12-07 17:37:01,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21610 to 21610. [2019-12-07 17:37:01,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21610 states. [2019-12-07 17:37:02,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21610 states to 21610 states and 74688 transitions. [2019-12-07 17:37:02,020 INFO L78 Accepts]: Start accepts. Automaton has 21610 states and 74688 transitions. Word has length 13 [2019-12-07 17:37:02,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:02,021 INFO L462 AbstractCegarLoop]: Abstraction has 21610 states and 74688 transitions. [2019-12-07 17:37:02,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:37:02,021 INFO L276 IsEmpty]: Start isEmpty. Operand 21610 states and 74688 transitions. [2019-12-07 17:37:02,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 17:37:02,022 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:02,022 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:02,022 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:02,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:02,022 INFO L82 PathProgramCache]: Analyzing trace with hash -120546049, now seen corresponding path program 1 times [2019-12-07 17:37:02,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:02,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067329822] [2019-12-07 17:37:02,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:02,080 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:37:02,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067329822] [2019-12-07 17:37:02,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:02,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:37:02,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553205369] [2019-12-07 17:37:02,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:37:02,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:02,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:37:02,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:37:02,082 INFO L87 Difference]: Start difference. First operand 21610 states and 74688 transitions. Second operand 4 states. [2019-12-07 17:37:02,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:02,314 INFO L93 Difference]: Finished difference Result 31986 states and 107232 transitions. [2019-12-07 17:37:02,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:37:02,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 17:37:02,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:02,365 INFO L225 Difference]: With dead ends: 31986 [2019-12-07 17:37:02,365 INFO L226 Difference]: Without dead ends: 31972 [2019-12-07 17:37:02,366 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:37:02,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31972 states. [2019-12-07 17:37:02,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31972 to 28300. [2019-12-07 17:37:02,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28300 states. [2019-12-07 17:37:02,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28300 states to 28300 states and 95848 transitions. [2019-12-07 17:37:02,945 INFO L78 Accepts]: Start accepts. Automaton has 28300 states and 95848 transitions. Word has length 13 [2019-12-07 17:37:02,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:02,946 INFO L462 AbstractCegarLoop]: Abstraction has 28300 states and 95848 transitions. [2019-12-07 17:37:02,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:37:02,946 INFO L276 IsEmpty]: Start isEmpty. Operand 28300 states and 95848 transitions. [2019-12-07 17:37:02,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:37:02,947 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:02,947 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:02,948 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:02,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:02,948 INFO L82 PathProgramCache]: Analyzing trace with hash 2051868705, now seen corresponding path program 1 times [2019-12-07 17:37:02,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:02,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048616052] [2019-12-07 17:37:02,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:03,001 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:37:03,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048616052] [2019-12-07 17:37:03,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:03,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:37:03,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406866320] [2019-12-07 17:37:03,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:37:03,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:03,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:37:03,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:37:03,002 INFO L87 Difference]: Start difference. First operand 28300 states and 95848 transitions. Second operand 5 states. [2019-12-07 17:37:03,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:03,359 INFO L93 Difference]: Finished difference Result 42745 states and 142288 transitions. [2019-12-07 17:37:03,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:37:03,359 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 17:37:03,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:03,424 INFO L225 Difference]: With dead ends: 42745 [2019-12-07 17:37:03,424 INFO L226 Difference]: Without dead ends: 42727 [2019-12-07 17:37:03,424 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:37:03,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42727 states. [2019-12-07 17:37:04,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42727 to 34163. [2019-12-07 17:37:04,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34163 states. [2019-12-07 17:37:04,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34163 states to 34163 states and 114786 transitions. [2019-12-07 17:37:04,075 INFO L78 Accepts]: Start accepts. Automaton has 34163 states and 114786 transitions. Word has length 14 [2019-12-07 17:37:04,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:04,076 INFO L462 AbstractCegarLoop]: Abstraction has 34163 states and 114786 transitions. [2019-12-07 17:37:04,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:37:04,076 INFO L276 IsEmpty]: Start isEmpty. Operand 34163 states and 114786 transitions. [2019-12-07 17:37:04,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:37:04,083 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:04,083 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:04,083 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:04,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:04,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1808091808, now seen corresponding path program 1 times [2019-12-07 17:37:04,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:04,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746813745] [2019-12-07 17:37:04,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:04,163 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:37:04,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746813745] [2019-12-07 17:37:04,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:04,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:37:04,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220332380] [2019-12-07 17:37:04,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:37:04,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:04,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:37:04,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:37:04,165 INFO L87 Difference]: Start difference. First operand 34163 states and 114786 transitions. Second operand 6 states. [2019-12-07 17:37:04,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:04,802 INFO L93 Difference]: Finished difference Result 52347 states and 172257 transitions. [2019-12-07 17:37:04,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:37:04,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 17:37:04,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:04,888 INFO L225 Difference]: With dead ends: 52347 [2019-12-07 17:37:04,888 INFO L226 Difference]: Without dead ends: 52317 [2019-12-07 17:37:04,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:37:05,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52317 states. [2019-12-07 17:37:05,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52317 to 34394. [2019-12-07 17:37:05,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34394 states. [2019-12-07 17:37:05,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34394 states to 34394 states and 114647 transitions. [2019-12-07 17:37:05,799 INFO L78 Accepts]: Start accepts. Automaton has 34394 states and 114647 transitions. Word has length 22 [2019-12-07 17:37:05,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:05,799 INFO L462 AbstractCegarLoop]: Abstraction has 34394 states and 114647 transitions. [2019-12-07 17:37:05,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:37:05,799 INFO L276 IsEmpty]: Start isEmpty. Operand 34394 states and 114647 transitions. [2019-12-07 17:37:05,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 17:37:05,809 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:05,809 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:37:05,810 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:05,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:05,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1844565345, now seen corresponding path program 1 times [2019-12-07 17:37:05,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:05,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509456248] [2019-12-07 17:37:05,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:05,843 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:37:05,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509456248] [2019-12-07 17:37:05,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:05,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:37:05,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709879451] [2019-12-07 17:37:05,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:37:05,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:05,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:37:05,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:37:05,844 INFO L87 Difference]: Start difference. First operand 34394 states and 114647 transitions. Second operand 4 states. [2019-12-07 17:37:05,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:05,905 INFO L93 Difference]: Finished difference Result 13523 states and 41801 transitions. [2019-12-07 17:37:05,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:37:05,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 17:37:05,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:05,928 INFO L225 Difference]: With dead ends: 13523 [2019-12-07 17:37:05,928 INFO L226 Difference]: Without dead ends: 13523 [2019-12-07 17:37:05,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:37:05,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13523 states. [2019-12-07 17:37:06,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13523 to 13303. [2019-12-07 17:37:06,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13303 states. [2019-12-07 17:37:06,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13303 states to 13303 states and 41151 transitions. [2019-12-07 17:37:06,122 INFO L78 Accepts]: Start accepts. Automaton has 13303 states and 41151 transitions. Word has length 25 [2019-12-07 17:37:06,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:06,122 INFO L462 AbstractCegarLoop]: Abstraction has 13303 states and 41151 transitions. [2019-12-07 17:37:06,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:37:06,122 INFO L276 IsEmpty]: Start isEmpty. Operand 13303 states and 41151 transitions. [2019-12-07 17:37:06,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 17:37:06,140 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:06,140 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] [2019-12-07 17:37:06,140 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:06,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:06,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1639479592, now seen corresponding path program 1 times [2019-12-07 17:37:06,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:06,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100507075] [2019-12-07 17:37:06,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:06,198 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:37:06,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100507075] [2019-12-07 17:37:06,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:06,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:37:06,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415881769] [2019-12-07 17:37:06,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:37:06,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:06,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:37:06,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:37:06,199 INFO L87 Difference]: Start difference. First operand 13303 states and 41151 transitions. Second operand 3 states. [2019-12-07 17:37:06,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:06,246 INFO L93 Difference]: Finished difference Result 12716 states and 38855 transitions. [2019-12-07 17:37:06,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:37:06,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 17:37:06,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:06,262 INFO L225 Difference]: With dead ends: 12716 [2019-12-07 17:37:06,262 INFO L226 Difference]: Without dead ends: 12716 [2019-12-07 17:37:06,263 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:37:06,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12716 states. [2019-12-07 17:37:06,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12716 to 12700. [2019-12-07 17:37:06,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12700 states. [2019-12-07 17:37:06,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12700 states to 12700 states and 38815 transitions. [2019-12-07 17:37:06,441 INFO L78 Accepts]: Start accepts. Automaton has 12700 states and 38815 transitions. Word has length 39 [2019-12-07 17:37:06,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:06,441 INFO L462 AbstractCegarLoop]: Abstraction has 12700 states and 38815 transitions. [2019-12-07 17:37:06,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:37:06,441 INFO L276 IsEmpty]: Start isEmpty. Operand 12700 states and 38815 transitions. [2019-12-07 17:37:06,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 17:37:06,457 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:06,457 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] [2019-12-07 17:37:06,457 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:06,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:06,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1144095462, now seen corresponding path program 1 times [2019-12-07 17:37:06,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:06,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548842693] [2019-12-07 17:37:06,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:06,520 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:37:06,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548842693] [2019-12-07 17:37:06,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:06,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:37:06,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900041707] [2019-12-07 17:37:06,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:37:06,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:06,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:37:06,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:37:06,521 INFO L87 Difference]: Start difference. First operand 12700 states and 38815 transitions. Second operand 5 states. [2019-12-07 17:37:06,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:06,824 INFO L93 Difference]: Finished difference Result 17919 states and 54342 transitions. [2019-12-07 17:37:06,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:37:06,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-07 17:37:06,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:06,845 INFO L225 Difference]: With dead ends: 17919 [2019-12-07 17:37:06,845 INFO L226 Difference]: Without dead ends: 17919 [2019-12-07 17:37:06,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:37:06,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17919 states. [2019-12-07 17:37:07,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17919 to 16320. [2019-12-07 17:37:07,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16320 states. [2019-12-07 17:37:07,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16320 states to 16320 states and 49873 transitions. [2019-12-07 17:37:07,082 INFO L78 Accepts]: Start accepts. Automaton has 16320 states and 49873 transitions. Word has length 40 [2019-12-07 17:37:07,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:07,082 INFO L462 AbstractCegarLoop]: Abstraction has 16320 states and 49873 transitions. [2019-12-07 17:37:07,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:37:07,082 INFO L276 IsEmpty]: Start isEmpty. Operand 16320 states and 49873 transitions. [2019-12-07 17:37:07,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 17:37:07,102 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:07,103 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] [2019-12-07 17:37:07,103 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:07,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:07,103 INFO L82 PathProgramCache]: Analyzing trace with hash 2007286560, now seen corresponding path program 2 times [2019-12-07 17:37:07,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:07,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503369139] [2019-12-07 17:37:07,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:07,167 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:37:07,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503369139] [2019-12-07 17:37:07,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:07,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:37:07,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933721948] [2019-12-07 17:37:07,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:37:07,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:07,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:37:07,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:37:07,169 INFO L87 Difference]: Start difference. First operand 16320 states and 49873 transitions. Second operand 3 states. [2019-12-07 17:37:07,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:07,216 INFO L93 Difference]: Finished difference Result 16237 states and 49585 transitions. [2019-12-07 17:37:07,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:37:07,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 17:37:07,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:07,234 INFO L225 Difference]: With dead ends: 16237 [2019-12-07 17:37:07,235 INFO L226 Difference]: Without dead ends: 16237 [2019-12-07 17:37:07,235 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:37:07,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16237 states. [2019-12-07 17:37:07,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16237 to 13529. [2019-12-07 17:37:07,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13529 states. [2019-12-07 17:37:07,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13529 states to 13529 states and 41543 transitions. [2019-12-07 17:37:07,443 INFO L78 Accepts]: Start accepts. Automaton has 13529 states and 41543 transitions. Word has length 40 [2019-12-07 17:37:07,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:07,443 INFO L462 AbstractCegarLoop]: Abstraction has 13529 states and 41543 transitions. [2019-12-07 17:37:07,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:37:07,443 INFO L276 IsEmpty]: Start isEmpty. Operand 13529 states and 41543 transitions. [2019-12-07 17:37:07,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 17:37:07,461 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:07,461 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] [2019-12-07 17:37:07,461 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:07,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:07,462 INFO L82 PathProgramCache]: Analyzing trace with hash -942593898, now seen corresponding path program 1 times [2019-12-07 17:37:07,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:07,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438118215] [2019-12-07 17:37:07,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:07,505 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:37:07,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438118215] [2019-12-07 17:37:07,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:07,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:37:07,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635047121] [2019-12-07 17:37:07,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:37:07,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:07,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:37:07,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:37:07,506 INFO L87 Difference]: Start difference. First operand 13529 states and 41543 transitions. Second operand 5 states. [2019-12-07 17:37:07,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:07,552 INFO L93 Difference]: Finished difference Result 12320 states and 38583 transitions. [2019-12-07 17:37:07,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:37:07,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-07 17:37:07,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:07,567 INFO L225 Difference]: With dead ends: 12320 [2019-12-07 17:37:07,567 INFO L226 Difference]: Without dead ends: 12320 [2019-12-07 17:37:07,568 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:37:07,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12320 states. [2019-12-07 17:37:07,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12320 to 12320. [2019-12-07 17:37:07,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12320 states. [2019-12-07 17:37:07,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12320 states to 12320 states and 38583 transitions. [2019-12-07 17:37:07,742 INFO L78 Accepts]: Start accepts. Automaton has 12320 states and 38583 transitions. Word has length 40 [2019-12-07 17:37:07,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:07,742 INFO L462 AbstractCegarLoop]: Abstraction has 12320 states and 38583 transitions. [2019-12-07 17:37:07,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:37:07,742 INFO L276 IsEmpty]: Start isEmpty. Operand 12320 states and 38583 transitions. [2019-12-07 17:37:07,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:37:07,754 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:07,754 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:07,755 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:07,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:07,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1695349201, now seen corresponding path program 1 times [2019-12-07 17:37:07,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:07,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891326199] [2019-12-07 17:37:07,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:07,796 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:37:07,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891326199] [2019-12-07 17:37:07,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:07,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:37:07,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620885235] [2019-12-07 17:37:07,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:37:07,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:07,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:37:07,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:37:07,798 INFO L87 Difference]: Start difference. First operand 12320 states and 38583 transitions. Second operand 3 states. [2019-12-07 17:37:07,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:07,855 INFO L93 Difference]: Finished difference Result 16410 states and 50395 transitions. [2019-12-07 17:37:07,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:37:07,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-07 17:37:07,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:07,873 INFO L225 Difference]: With dead ends: 16410 [2019-12-07 17:37:07,873 INFO L226 Difference]: Without dead ends: 16410 [2019-12-07 17:37:07,874 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:37:07,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16410 states. [2019-12-07 17:37:08,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16410 to 12040. [2019-12-07 17:37:08,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12040 states. [2019-12-07 17:37:08,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12040 states to 12040 states and 37899 transitions. [2019-12-07 17:37:08,080 INFO L78 Accepts]: Start accepts. Automaton has 12040 states and 37899 transitions. Word has length 56 [2019-12-07 17:37:08,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:08,080 INFO L462 AbstractCegarLoop]: Abstraction has 12040 states and 37899 transitions. [2019-12-07 17:37:08,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:37:08,080 INFO L276 IsEmpty]: Start isEmpty. Operand 12040 states and 37899 transitions. [2019-12-07 17:37:08,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:37:08,090 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:08,090 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:08,090 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:08,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:08,091 INFO L82 PathProgramCache]: Analyzing trace with hash 378310324, now seen corresponding path program 1 times [2019-12-07 17:37:08,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:08,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905668208] [2019-12-07 17:37:08,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:08,513 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:37:08,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905668208] [2019-12-07 17:37:08,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:08,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 17:37:08,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206777265] [2019-12-07 17:37:08,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 17:37:08,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:08,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 17:37:08,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:37:08,514 INFO L87 Difference]: Start difference. First operand 12040 states and 37899 transitions. Second operand 15 states. [2019-12-07 17:37:11,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:11,772 INFO L93 Difference]: Finished difference Result 26723 states and 82512 transitions. [2019-12-07 17:37:11,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-07 17:37:11,773 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-07 17:37:11,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:11,794 INFO L225 Difference]: With dead ends: 26723 [2019-12-07 17:37:11,794 INFO L226 Difference]: Without dead ends: 19470 [2019-12-07 17:37:11,795 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=208, Invalid=1052, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 17:37:11,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19470 states. [2019-12-07 17:37:12,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19470 to 14390. [2019-12-07 17:37:12,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14390 states. [2019-12-07 17:37:12,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14390 states to 14390 states and 45261 transitions. [2019-12-07 17:37:12,036 INFO L78 Accepts]: Start accepts. Automaton has 14390 states and 45261 transitions. Word has length 56 [2019-12-07 17:37:12,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:12,036 INFO L462 AbstractCegarLoop]: Abstraction has 14390 states and 45261 transitions. [2019-12-07 17:37:12,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 17:37:12,036 INFO L276 IsEmpty]: Start isEmpty. Operand 14390 states and 45261 transitions. [2019-12-07 17:37:12,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:37:12,051 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:12,051 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:12,051 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:12,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:12,052 INFO L82 PathProgramCache]: Analyzing trace with hash -686382568, now seen corresponding path program 2 times [2019-12-07 17:37:12,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:12,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26294742] [2019-12-07 17:37:12,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:12,382 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:37:12,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26294742] [2019-12-07 17:37:12,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:12,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 17:37:12,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067137980] [2019-12-07 17:37:12,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 17:37:12,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:12,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 17:37:12,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:37:12,384 INFO L87 Difference]: Start difference. First operand 14390 states and 45261 transitions. Second operand 15 states. [2019-12-07 17:37:16,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:16,807 INFO L93 Difference]: Finished difference Result 33989 states and 104528 transitions. [2019-12-07 17:37:16,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-07 17:37:16,808 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-07 17:37:16,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:16,837 INFO L225 Difference]: With dead ends: 33989 [2019-12-07 17:37:16,837 INFO L226 Difference]: Without dead ends: 26813 [2019-12-07 17:37:16,838 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=395, Invalid=2055, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 17:37:16,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26813 states. [2019-12-07 17:37:17,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26813 to 15922. [2019-12-07 17:37:17,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15922 states. [2019-12-07 17:37:17,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15922 states to 15922 states and 50144 transitions. [2019-12-07 17:37:17,126 INFO L78 Accepts]: Start accepts. Automaton has 15922 states and 50144 transitions. Word has length 56 [2019-12-07 17:37:17,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:17,127 INFO L462 AbstractCegarLoop]: Abstraction has 15922 states and 50144 transitions. [2019-12-07 17:37:17,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 17:37:17,127 INFO L276 IsEmpty]: Start isEmpty. Operand 15922 states and 50144 transitions. [2019-12-07 17:37:17,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:37:17,143 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:17,143 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:17,144 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:17,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:17,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1984765538, now seen corresponding path program 3 times [2019-12-07 17:37:17,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:17,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169144341] [2019-12-07 17:37:17,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:17,733 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:37:17,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169144341] [2019-12-07 17:37:17,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:17,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 17:37:17,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862487339] [2019-12-07 17:37:17,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 17:37:17,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:17,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 17:37:17,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:37:17,735 INFO L87 Difference]: Start difference. First operand 15922 states and 50144 transitions. Second operand 16 states. [2019-12-07 17:37:18,486 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2019-12-07 17:37:19,265 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-12-07 17:37:26,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:26,370 INFO L93 Difference]: Finished difference Result 36465 states and 112962 transitions. [2019-12-07 17:37:26,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-12-07 17:37:26,372 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-07 17:37:26,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:26,431 INFO L225 Difference]: With dead ends: 36465 [2019-12-07 17:37:26,431 INFO L226 Difference]: Without dead ends: 34485 [2019-12-07 17:37:26,433 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2153 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=922, Invalid=5720, Unknown=0, NotChecked=0, Total=6642 [2019-12-07 17:37:26,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34485 states. [2019-12-07 17:37:26,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34485 to 18325. [2019-12-07 17:37:26,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18325 states. [2019-12-07 17:37:26,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18325 states to 18325 states and 57879 transitions. [2019-12-07 17:37:26,825 INFO L78 Accepts]: Start accepts. Automaton has 18325 states and 57879 transitions. Word has length 56 [2019-12-07 17:37:26,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:26,825 INFO L462 AbstractCegarLoop]: Abstraction has 18325 states and 57879 transitions. [2019-12-07 17:37:26,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 17:37:26,826 INFO L276 IsEmpty]: Start isEmpty. Operand 18325 states and 57879 transitions. [2019-12-07 17:37:26,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:37:26,843 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:26,843 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:26,843 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:26,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:26,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1143854054, now seen corresponding path program 4 times [2019-12-07 17:37:26,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:26,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382987063] [2019-12-07 17:37:26,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:27,422 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:37:27,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382987063] [2019-12-07 17:37:27,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:27,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 17:37:27,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250770420] [2019-12-07 17:37:27,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 17:37:27,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:27,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 17:37:27,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:37:27,423 INFO L87 Difference]: Start difference. First operand 18325 states and 57879 transitions. Second operand 16 states. [2019-12-07 17:37:30,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:30,149 INFO L93 Difference]: Finished difference Result 32668 states and 100641 transitions. [2019-12-07 17:37:30,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-07 17:37:30,149 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-07 17:37:30,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:30,186 INFO L225 Difference]: With dead ends: 32668 [2019-12-07 17:37:30,186 INFO L226 Difference]: Without dead ends: 27351 [2019-12-07 17:37:30,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=491, Invalid=2479, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 17:37:30,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27351 states. [2019-12-07 17:37:30,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27351 to 15691. [2019-12-07 17:37:30,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15691 states. [2019-12-07 17:37:30,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15691 states to 15691 states and 49386 transitions. [2019-12-07 17:37:30,493 INFO L78 Accepts]: Start accepts. Automaton has 15691 states and 49386 transitions. Word has length 56 [2019-12-07 17:37:30,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:30,493 INFO L462 AbstractCegarLoop]: Abstraction has 15691 states and 49386 transitions. [2019-12-07 17:37:30,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 17:37:30,493 INFO L276 IsEmpty]: Start isEmpty. Operand 15691 states and 49386 transitions. [2019-12-07 17:37:30,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:37:30,508 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:30,508 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:30,509 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:30,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:30,509 INFO L82 PathProgramCache]: Analyzing trace with hash -346705582, now seen corresponding path program 5 times [2019-12-07 17:37:30,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:30,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749970164] [2019-12-07 17:37:30,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:30,931 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:37:30,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749970164] [2019-12-07 17:37:30,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:30,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 17:37:30,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092529309] [2019-12-07 17:37:30,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 17:37:30,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:30,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 17:37:30,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:37:30,932 INFO L87 Difference]: Start difference. First operand 15691 states and 49386 transitions. Second operand 16 states. [2019-12-07 17:37:34,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:34,837 INFO L93 Difference]: Finished difference Result 21579 states and 66700 transitions. [2019-12-07 17:37:34,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-07 17:37:34,838 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-07 17:37:34,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:34,861 INFO L225 Difference]: With dead ends: 21579 [2019-12-07 17:37:34,861 INFO L226 Difference]: Without dead ends: 21281 [2019-12-07 17:37:34,862 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=273, Invalid=1367, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 17:37:34,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21281 states. [2019-12-07 17:37:35,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21281 to 15677. [2019-12-07 17:37:35,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15677 states. [2019-12-07 17:37:35,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15677 states to 15677 states and 49349 transitions. [2019-12-07 17:37:35,139 INFO L78 Accepts]: Start accepts. Automaton has 15677 states and 49349 transitions. Word has length 56 [2019-12-07 17:37:35,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:35,139 INFO L462 AbstractCegarLoop]: Abstraction has 15677 states and 49349 transitions. [2019-12-07 17:37:35,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 17:37:35,139 INFO L276 IsEmpty]: Start isEmpty. Operand 15677 states and 49349 transitions. [2019-12-07 17:37:35,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:37:35,154 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:35,154 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:35,154 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:35,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:35,154 INFO L82 PathProgramCache]: Analyzing trace with hash 833161364, now seen corresponding path program 6 times [2019-12-07 17:37:35,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:35,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341051895] [2019-12-07 17:37:35,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:35,298 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:37:35,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341051895] [2019-12-07 17:37:35,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:35,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:37:35,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359235493] [2019-12-07 17:37:35,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:37:35,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:35,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:37:35,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:37:35,299 INFO L87 Difference]: Start difference. First operand 15677 states and 49349 transitions. Second operand 10 states. [2019-12-07 17:37:36,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:36,252 INFO L93 Difference]: Finished difference Result 30779 states and 95488 transitions. [2019-12-07 17:37:36,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 17:37:36,252 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-12-07 17:37:36,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:36,279 INFO L225 Difference]: With dead ends: 30779 [2019-12-07 17:37:36,279 INFO L226 Difference]: Without dead ends: 23828 [2019-12-07 17:37:36,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2019-12-07 17:37:36,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23828 states. [2019-12-07 17:37:36,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23828 to 16573. [2019-12-07 17:37:36,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16573 states. [2019-12-07 17:37:36,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16573 states to 16573 states and 51743 transitions. [2019-12-07 17:37:36,562 INFO L78 Accepts]: Start accepts. Automaton has 16573 states and 51743 transitions. Word has length 56 [2019-12-07 17:37:36,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:36,562 INFO L462 AbstractCegarLoop]: Abstraction has 16573 states and 51743 transitions. [2019-12-07 17:37:36,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:37:36,562 INFO L276 IsEmpty]: Start isEmpty. Operand 16573 states and 51743 transitions. [2019-12-07 17:37:36,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:37:36,577 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:36,577 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:36,578 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:36,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:36,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1211542094, now seen corresponding path program 7 times [2019-12-07 17:37:36,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:36,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742772724] [2019-12-07 17:37:36,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:36,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:37:36,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742772724] [2019-12-07 17:37:36,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:36,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:37:36,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103430944] [2019-12-07 17:37:36,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:37:36,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:36,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:37:36,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:37:36,808 INFO L87 Difference]: Start difference. First operand 16573 states and 51743 transitions. Second operand 11 states. [2019-12-07 17:37:37,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:37,559 INFO L93 Difference]: Finished difference Result 32050 states and 99340 transitions. [2019-12-07 17:37:37,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 17:37:37,560 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-07 17:37:37,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:37,597 INFO L225 Difference]: With dead ends: 32050 [2019-12-07 17:37:37,597 INFO L226 Difference]: Without dead ends: 30524 [2019-12-07 17:37:37,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=254, Invalid=1006, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 17:37:37,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30524 states. [2019-12-07 17:37:37,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30524 to 19334. [2019-12-07 17:37:37,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19334 states. [2019-12-07 17:37:37,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19334 states to 19334 states and 60331 transitions. [2019-12-07 17:37:37,961 INFO L78 Accepts]: Start accepts. Automaton has 19334 states and 60331 transitions. Word has length 56 [2019-12-07 17:37:37,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:37,961 INFO L462 AbstractCegarLoop]: Abstraction has 19334 states and 60331 transitions. [2019-12-07 17:37:37,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:37:37,962 INFO L276 IsEmpty]: Start isEmpty. Operand 19334 states and 60331 transitions. [2019-12-07 17:37:37,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:37:37,979 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:37,979 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:37,979 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:37,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:37,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1696832882, now seen corresponding path program 8 times [2019-12-07 17:37:37,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:37,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414482099] [2019-12-07 17:37:37,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:38,122 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:37:38,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414482099] [2019-12-07 17:37:38,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:38,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 17:37:38,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190956928] [2019-12-07 17:37:38,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:37:38,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:38,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:37:38,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:37:38,124 INFO L87 Difference]: Start difference. First operand 19334 states and 60331 transitions. Second operand 12 states. [2019-12-07 17:37:40,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:40,201 INFO L93 Difference]: Finished difference Result 25955 states and 80071 transitions. [2019-12-07 17:37:40,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 17:37:40,201 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-07 17:37:40,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:40,228 INFO L225 Difference]: With dead ends: 25955 [2019-12-07 17:37:40,228 INFO L226 Difference]: Without dead ends: 23877 [2019-12-07 17:37:40,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2019-12-07 17:37:40,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23877 states. [2019-12-07 17:37:40,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23877 to 19268. [2019-12-07 17:37:40,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19268 states. [2019-12-07 17:37:40,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19268 states to 19268 states and 59997 transitions. [2019-12-07 17:37:40,531 INFO L78 Accepts]: Start accepts. Automaton has 19268 states and 59997 transitions. Word has length 56 [2019-12-07 17:37:40,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:40,531 INFO L462 AbstractCegarLoop]: Abstraction has 19268 states and 59997 transitions. [2019-12-07 17:37:40,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:37:40,531 INFO L276 IsEmpty]: Start isEmpty. Operand 19268 states and 59997 transitions. [2019-12-07 17:37:40,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:37:40,549 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:40,549 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:40,549 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:40,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:40,549 INFO L82 PathProgramCache]: Analyzing trace with hash -274348836, now seen corresponding path program 9 times [2019-12-07 17:37:40,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:40,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918835955] [2019-12-07 17:37:40,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:40,699 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:37:40,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918835955] [2019-12-07 17:37:40,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:40,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:37:40,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630124255] [2019-12-07 17:37:40,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:37:40,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:40,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:37:40,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:37:40,700 INFO L87 Difference]: Start difference. First operand 19268 states and 59997 transitions. Second operand 10 states. [2019-12-07 17:37:41,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:41,188 INFO L93 Difference]: Finished difference Result 32783 states and 100626 transitions. [2019-12-07 17:37:41,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 17:37:41,188 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-12-07 17:37:41,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:41,221 INFO L225 Difference]: With dead ends: 32783 [2019-12-07 17:37:41,221 INFO L226 Difference]: Without dead ends: 26453 [2019-12-07 17:37:41,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-07 17:37:41,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26453 states. [2019-12-07 17:37:41,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26453 to 17911. [2019-12-07 17:37:41,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17911 states. [2019-12-07 17:37:41,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17911 states to 17911 states and 55484 transitions. [2019-12-07 17:37:41,580 INFO L78 Accepts]: Start accepts. Automaton has 17911 states and 55484 transitions. Word has length 56 [2019-12-07 17:37:41,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:41,580 INFO L462 AbstractCegarLoop]: Abstraction has 17911 states and 55484 transitions. [2019-12-07 17:37:41,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:37:41,580 INFO L276 IsEmpty]: Start isEmpty. Operand 17911 states and 55484 transitions. [2019-12-07 17:37:41,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:37:41,596 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:41,596 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:41,597 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:41,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:41,597 INFO L82 PathProgramCache]: Analyzing trace with hash 802342730, now seen corresponding path program 10 times [2019-12-07 17:37:41,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:41,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811619411] [2019-12-07 17:37:41,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:42,033 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:37:42,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811619411] [2019-12-07 17:37:42,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:42,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 17:37:42,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400520386] [2019-12-07 17:37:42,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 17:37:42,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:42,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 17:37:42,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:37:42,034 INFO L87 Difference]: Start difference. First operand 17911 states and 55484 transitions. Second operand 16 states. [2019-12-07 17:37:44,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:44,416 INFO L93 Difference]: Finished difference Result 29384 states and 89251 transitions. [2019-12-07 17:37:44,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-07 17:37:44,416 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-07 17:37:44,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:44,461 INFO L225 Difference]: With dead ends: 29384 [2019-12-07 17:37:44,461 INFO L226 Difference]: Without dead ends: 28038 [2019-12-07 17:37:44,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=443, Invalid=2209, Unknown=0, NotChecked=0, Total=2652 [2019-12-07 17:37:44,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28038 states. [2019-12-07 17:37:44,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28038 to 17911. [2019-12-07 17:37:44,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17911 states. [2019-12-07 17:37:44,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17911 states to 17911 states and 55454 transitions. [2019-12-07 17:37:44,802 INFO L78 Accepts]: Start accepts. Automaton has 17911 states and 55454 transitions. Word has length 56 [2019-12-07 17:37:44,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:44,802 INFO L462 AbstractCegarLoop]: Abstraction has 17911 states and 55454 transitions. [2019-12-07 17:37:44,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 17:37:44,803 INFO L276 IsEmpty]: Start isEmpty. Operand 17911 states and 55454 transitions. [2019-12-07 17:37:44,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:37:44,818 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:44,818 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:44,818 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:44,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:44,818 INFO L82 PathProgramCache]: Analyzing trace with hash 630449824, now seen corresponding path program 11 times [2019-12-07 17:37:44,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:44,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855137361] [2019-12-07 17:37:44,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:44,998 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:37:44,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855137361] [2019-12-07 17:37:44,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:44,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:37:44,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441901726] [2019-12-07 17:37:44,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:37:44,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:44,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:37:44,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:37:45,000 INFO L87 Difference]: Start difference. First operand 17911 states and 55454 transitions. Second operand 11 states. [2019-12-07 17:37:45,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:45,608 INFO L93 Difference]: Finished difference Result 26001 states and 79552 transitions. [2019-12-07 17:37:45,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 17:37:45,609 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-07 17:37:45,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:45,633 INFO L225 Difference]: With dead ends: 26001 [2019-12-07 17:37:45,633 INFO L226 Difference]: Without dead ends: 22475 [2019-12-07 17:37:45,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-07 17:37:45,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22475 states. [2019-12-07 17:37:45,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22475 to 14734. [2019-12-07 17:37:45,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14734 states. [2019-12-07 17:37:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14734 states to 14734 states and 45803 transitions. [2019-12-07 17:37:45,894 INFO L78 Accepts]: Start accepts. Automaton has 14734 states and 45803 transitions. Word has length 56 [2019-12-07 17:37:45,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:45,894 INFO L462 AbstractCegarLoop]: Abstraction has 14734 states and 45803 transitions. [2019-12-07 17:37:45,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:37:45,894 INFO L276 IsEmpty]: Start isEmpty. Operand 14734 states and 45803 transitions. [2019-12-07 17:37:45,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:37:45,908 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:45,908 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:45,908 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:45,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:45,908 INFO L82 PathProgramCache]: Analyzing trace with hash -196673722, now seen corresponding path program 12 times [2019-12-07 17:37:45,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:45,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507735014] [2019-12-07 17:37:45,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:37:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:37:45,981 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:37:45,981 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:37:45,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] ULTIMATE.startENTRY-->L828: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= 0 v_~x$r_buff1_thd2~0_202) (= v_~weak$$choice2~0_155 0) (= v_~z~0_13 0) (= v_~__unbuffered_cnt~0_148 0) (= 0 v_~__unbuffered_p0_EAX~0_46) (= v_~x$r_buff0_thd1~0_322 0) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t916~0.base_21| 1)) (= 0 v_~x$r_buff0_thd2~0_247) (= v_~x$flush_delayed~0_68 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t916~0.base_21| 4)) (< 0 |v_#StackHeapBarrier_17|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t916~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t916~0.base_21|) |v_ULTIMATE.start_main_~#t916~0.offset_16| 0)) |v_#memory_int_23|) (= 0 v_~x$w_buff1_used~0_539) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~weak$$choice0~0_35) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t916~0.base_21|) (= v_~x$r_buff1_thd1~0_293 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t916~0.base_21|) 0) (= v_~x$r_buff0_thd0~0_140 0) (= 0 |v_#NULL.base_4|) (= v_~__unbuffered_p2_EBX~0_33 0) (= 0 v_~x$w_buff0~0_441) (= 0 v_~x$read_delayed~0_7) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 0 v_~x~0_192) (= v_~main$tmp_guard0~0_20 0) (= v_~y~0_44 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~x$w_buff1~0_298) (= 0 |v_ULTIMATE.start_main_~#t916~0.offset_16|) (= |v_#NULL.offset_4| 0) (= 0 v_~x$r_buff1_thd3~0_209) (= v_~__unbuffered_p1_EAX~0_150 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff0_used~0_964) (= v_~x$r_buff1_thd0~0_215 0) (= v_~x$mem_tmp~0_38 0) (= v_~a~0_41 0) (= 0 v_~x$r_buff0_thd3~0_132))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_441, ~x$flush_delayed~0=v_~x$flush_delayed~0_68, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_293, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_132, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_270|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ~a~0=v_~a~0_41, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_150, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_~#t916~0.offset=|v_ULTIMATE.start_main_~#t916~0.offset_16|, ULTIMATE.start_main_~#t917~0.offset=|v_ULTIMATE.start_main_~#t917~0.offset_16|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_140, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_298, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_539, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_202, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_35, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_148, ~x~0=v_~x~0_192, ULTIMATE.start_main_~#t918~0.offset=|v_ULTIMATE.start_main_~#t918~0.offset_15|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_322, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_72|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_209, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_38, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_32|, ULTIMATE.start_main_~#t918~0.base=|v_ULTIMATE.start_main_~#t918~0.base_19|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y~0=v_~y~0_44, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ULTIMATE.start_main_~#t917~0.base=|v_ULTIMATE.start_main_~#t917~0.base_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_215, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_247, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_964, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_44|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_13, ~weak$$choice2~0=v_~weak$$choice2~0_155, ULTIMATE.start_main_~#t916~0.base=|v_ULTIMATE.start_main_~#t916~0.base_21|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t916~0.offset, ULTIMATE.start_main_~#t917~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t918~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t918~0.base, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t917~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t916~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 17:37:45,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L828-1-->L830: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t917~0.base_13|)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t917~0.base_13|)) (= |v_ULTIMATE.start_main_~#t917~0.offset_11| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t917~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t917~0.base_13|) |v_ULTIMATE.start_main_~#t917~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t917~0.base_13| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t917~0.base_13|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t917~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t917~0.offset=|v_ULTIMATE.start_main_~#t917~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t917~0.base=|v_ULTIMATE.start_main_~#t917~0.base_13|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t917~0.offset, ULTIMATE.start_main_~#t917~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 17:37:45,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L830-1-->L832: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t918~0.base_13| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t918~0.base_13|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t918~0.base_13| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t918~0.base_13|) (= |v_ULTIMATE.start_main_~#t918~0.offset_11| 0) (not (= |v_ULTIMATE.start_main_~#t918~0.base_13| 0)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t918~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t918~0.base_13|) |v_ULTIMATE.start_main_~#t918~0.offset_11| 2)) |v_#memory_int_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t918~0.base=|v_ULTIMATE.start_main_~#t918~0.base_13|, ULTIMATE.start_main_~#t918~0.offset=|v_ULTIMATE.start_main_~#t918~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t918~0.base, ULTIMATE.start_main_~#t918~0.offset] because there is no mapped edge [2019-12-07 17:37:45,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] P1ENTRY-->L5-3: Formula: (and (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| (ite (not (and (not (= 0 (mod v_~x$w_buff1_used~0_44 256))) (not (= (mod v_~x$w_buff0_used~0_73 256) 0)))) 1 0)) (= 1 v_~x$w_buff0~0_19) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_~x$w_buff0~0_20 v_~x$w_buff1~0_15) (= v_~x$w_buff1_used~0_44 v_~x$w_buff0_used~0_74) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 0)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= 1 v_~x$w_buff0_used~0_73)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_74} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_19, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_44, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_73} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 17:37:45,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L805-2-->L805-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In2118879748 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In2118879748 256) 0))) (or (and (= ~x~0_In2118879748 |P2Thread1of1ForFork2_#t~ite32_Out2118879748|) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite32_Out2118879748| ~x$w_buff1~0_In2118879748) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In2118879748, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2118879748, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2118879748, ~x~0=~x~0_In2118879748} OutVars{P2Thread1of1ForFork2_#t~ite32=|P2Thread1of1ForFork2_#t~ite32_Out2118879748|, ~x$w_buff1~0=~x$w_buff1~0_In2118879748, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2118879748, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2118879748, ~x~0=~x~0_In2118879748} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-07 17:37:45,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1695670153 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1695670153 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite28_Out-1695670153|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-1695670153 |P1Thread1of1ForFork1_#t~ite28_Out-1695670153|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1695670153, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1695670153} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1695670153, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1695670153|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1695670153} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 17:37:45,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L805-4-->L806: Formula: (= v_~x~0_35 |v_P2Thread1of1ForFork2_#t~ite32_10|) InVars {P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_10|} OutVars{P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_15|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~x~0] because there is no mapped edge [2019-12-07 17:37:45,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1523647223 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1523647223 256)))) (or (and (= ~x$w_buff0_used~0_In1523647223 |P2Thread1of1ForFork2_#t~ite34_Out1523647223|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite34_Out1523647223|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1523647223, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1523647223} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out1523647223|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1523647223, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1523647223} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34] because there is no mapped edge [2019-12-07 17:37:45,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L807-->L807-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In995975540 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In995975540 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In995975540 256))) (.cse2 (= (mod ~x$r_buff1_thd3~0_In995975540 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite35_Out995975540|)) (and (= ~x$w_buff1_used~0_In995975540 |P2Thread1of1ForFork2_#t~ite35_Out995975540|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In995975540, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In995975540, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In995975540, ~x$w_buff0_used~0=~x$w_buff0_used~0_In995975540} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out995975540|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In995975540, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In995975540, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In995975540, ~x$w_buff0_used~0=~x$w_buff0_used~0_In995975540} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35] because there is no mapped edge [2019-12-07 17:37:45,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1948702040 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-1948702040 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-1948702040 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1948702040 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite29_Out-1948702040| ~x$w_buff1_used~0_In-1948702040)) (and (= 0 |P1Thread1of1ForFork1_#t~ite29_Out-1948702040|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1948702040, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1948702040, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1948702040, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1948702040} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1948702040|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1948702040, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1948702040, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1948702040, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1948702040} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 17:37:45,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L782-->L783: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1197202945 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1197202945 256))) (.cse2 (= ~x$r_buff0_thd2~0_Out-1197202945 ~x$r_buff0_thd2~0_In-1197202945))) (or (and (= ~x$r_buff0_thd2~0_Out-1197202945 0) (not .cse0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1197202945, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1197202945} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1197202945|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1197202945, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1197202945} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 17:37:45,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-1900026074 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1900026074 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1900026074 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-1900026074 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In-1900026074 |P1Thread1of1ForFork1_#t~ite31_Out-1900026074|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite31_Out-1900026074|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1900026074, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1900026074, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1900026074, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1900026074} OutVars{P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-1900026074|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1900026074, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1900026074, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1900026074, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1900026074} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 17:37:45,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L783-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd2~0_113 |v_P1Thread1of1ForFork1_#t~ite31_40|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_39|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 17:37:45,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2000764492 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite12_Out-2000764492| |P0Thread1of1ForFork0_#t~ite11_Out-2000764492|) (= ~x$w_buff1~0_In-2000764492 |P0Thread1of1ForFork0_#t~ite11_Out-2000764492|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-2000764492 256)))) (or (and (= (mod ~x$w_buff1_used~0_In-2000764492 256) 0) .cse1) (and (= 0 (mod ~x$r_buff1_thd1~0_In-2000764492 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-2000764492 256))))) (and (not .cse0) (= ~x$w_buff1~0_In-2000764492 |P0Thread1of1ForFork0_#t~ite12_Out-2000764492|) (= |P0Thread1of1ForFork0_#t~ite11_In-2000764492| |P0Thread1of1ForFork0_#t~ite11_Out-2000764492|)))) InVars {P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_In-2000764492|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2000764492, ~x$w_buff1~0=~x$w_buff1~0_In-2000764492, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2000764492, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2000764492, ~weak$$choice2~0=~weak$$choice2~0_In-2000764492, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2000764492} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out-2000764492|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2000764492, ~x$w_buff1~0=~x$w_buff1~0_In-2000764492, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2000764492, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2000764492, ~weak$$choice2~0=~weak$$choice2~0_In-2000764492, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out-2000764492|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2000764492} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11, P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 17:37:45,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L746-->L746-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-473260587 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite14_In-473260587| |P0Thread1of1ForFork0_#t~ite14_Out-473260587|) (= ~x$w_buff0_used~0_In-473260587 |P0Thread1of1ForFork0_#t~ite15_Out-473260587|) (not .cse0)) (and .cse0 (= |P0Thread1of1ForFork0_#t~ite14_Out-473260587| |P0Thread1of1ForFork0_#t~ite15_Out-473260587|) (= ~x$w_buff0_used~0_In-473260587 |P0Thread1of1ForFork0_#t~ite14_Out-473260587|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-473260587 256) 0))) (or (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-473260587 256) 0)) (= (mod ~x$w_buff0_used~0_In-473260587 256) 0) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-473260587 256)))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-473260587, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-473260587, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-473260587, ~weak$$choice2~0=~weak$$choice2~0_In-473260587, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_In-473260587|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-473260587} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-473260587, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-473260587, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-473260587, P0Thread1of1ForFork0_#t~ite15=|P0Thread1of1ForFork0_#t~ite15_Out-473260587|, ~weak$$choice2~0=~weak$$choice2~0_In-473260587, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_Out-473260587|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-473260587} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite15, P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-07 17:37:45,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L748-->L749: Formula: (and (= v_~x$r_buff0_thd1~0_65 v_~x$r_buff0_thd1~0_64) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_5|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_64, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_5|, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_5|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, ~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite20, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-07 17:37:45,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L751-->L759: Formula: (and (= v_~x$flush_delayed~0_20 0) (= v_~x~0_54 v_~x$mem_tmp~0_15) (not (= (mod v_~x$flush_delayed~0_21 256) 0)) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_15} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_13|, ~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 17:37:45,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2126615773 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-2126615773 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite36_Out-2126615773|)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd3~0_In-2126615773 |P2Thread1of1ForFork2_#t~ite36_Out-2126615773|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2126615773, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2126615773} OutVars{P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out-2126615773|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2126615773, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2126615773} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-07 17:37:45,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1882904978 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1882904978 256))) (.cse3 (= (mod ~x$r_buff1_thd3~0_In-1882904978 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1882904978 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite37_Out-1882904978|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd3~0_In-1882904978 |P2Thread1of1ForFork2_#t~ite37_Out-1882904978|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1882904978, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1882904978, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1882904978, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1882904978} OutVars{P2Thread1of1ForFork2_#t~ite37=|P2Thread1of1ForFork2_#t~ite37_Out-1882904978|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1882904978, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1882904978, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1882904978, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1882904978} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37] because there is no mapped edge [2019-12-07 17:37:45,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L809-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite37_44| v_~x$r_buff1_thd3~0_117)) InVars {P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_43|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_117, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 17:37:45,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L832-1-->L838: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 17:37:45,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L838-2-->L838-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In336859383 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In336859383 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out336859383| ~x$w_buff1~0_In336859383) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In336859383 |ULTIMATE.start_main_#t~ite41_Out336859383|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In336859383, ~x$w_buff1_used~0=~x$w_buff1_used~0_In336859383, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In336859383, ~x~0=~x~0_In336859383} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out336859383|, ~x$w_buff1~0=~x$w_buff1~0_In336859383, ~x$w_buff1_used~0=~x$w_buff1_used~0_In336859383, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In336859383, ~x~0=~x~0_In336859383} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 17:37:45,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L838-4-->L839: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_9|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 17:37:45,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L839-->L839-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In748627533 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In748627533 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out748627533| ~x$w_buff0_used~0_In748627533) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out748627533|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In748627533, ~x$w_buff0_used~0=~x$w_buff0_used~0_In748627533} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In748627533, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out748627533|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In748627533} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:37:45,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L840-->L840-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-1322055236 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1322055236 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1322055236 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1322055236 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1322055236 |ULTIMATE.start_main_#t~ite44_Out-1322055236|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1322055236|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1322055236, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1322055236, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1322055236, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1322055236} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1322055236, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1322055236, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1322055236, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1322055236|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1322055236} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:37:45,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L841-->L841-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-59248682 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-59248682 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-59248682| 0) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In-59248682 |ULTIMATE.start_main_#t~ite45_Out-59248682|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-59248682, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-59248682} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-59248682, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-59248682|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-59248682} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:37:45,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L842-->L842-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd0~0_In2060011283 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In2060011283 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In2060011283 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In2060011283 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out2060011283|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd0~0_In2060011283 |ULTIMATE.start_main_#t~ite46_Out2060011283|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2060011283, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2060011283, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2060011283, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2060011283} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2060011283, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out2060011283|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2060011283, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2060011283, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2060011283} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 17:37:45,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L842-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_139 0) (= v_~__unbuffered_p2_EBX~0_22 0) (= 1 v_~__unbuffered_p2_EAX~0_22) (= 0 v_~__unbuffered_p0_EAX~0_34))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_25) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_25 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~x$r_buff1_thd0~0_203 |v_ULTIMATE.start_main_#t~ite46_54|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_139, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_54|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_139, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_53|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_203, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:37:46,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:37:46 BasicIcfg [2019-12-07 17:37:46,040 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:37:46,040 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:37:46,040 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:37:46,040 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:37:46,040 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:36:41" (3/4) ... [2019-12-07 17:37:46,042 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:37:46,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] ULTIMATE.startENTRY-->L828: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= 0 v_~x$r_buff1_thd2~0_202) (= v_~weak$$choice2~0_155 0) (= v_~z~0_13 0) (= v_~__unbuffered_cnt~0_148 0) (= 0 v_~__unbuffered_p0_EAX~0_46) (= v_~x$r_buff0_thd1~0_322 0) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t916~0.base_21| 1)) (= 0 v_~x$r_buff0_thd2~0_247) (= v_~x$flush_delayed~0_68 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t916~0.base_21| 4)) (< 0 |v_#StackHeapBarrier_17|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t916~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t916~0.base_21|) |v_ULTIMATE.start_main_~#t916~0.offset_16| 0)) |v_#memory_int_23|) (= 0 v_~x$w_buff1_used~0_539) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~weak$$choice0~0_35) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t916~0.base_21|) (= v_~x$r_buff1_thd1~0_293 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t916~0.base_21|) 0) (= v_~x$r_buff0_thd0~0_140 0) (= 0 |v_#NULL.base_4|) (= v_~__unbuffered_p2_EBX~0_33 0) (= 0 v_~x$w_buff0~0_441) (= 0 v_~x$read_delayed~0_7) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 0 v_~x~0_192) (= v_~main$tmp_guard0~0_20 0) (= v_~y~0_44 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~x$w_buff1~0_298) (= 0 |v_ULTIMATE.start_main_~#t916~0.offset_16|) (= |v_#NULL.offset_4| 0) (= 0 v_~x$r_buff1_thd3~0_209) (= v_~__unbuffered_p1_EAX~0_150 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff0_used~0_964) (= v_~x$r_buff1_thd0~0_215 0) (= v_~x$mem_tmp~0_38 0) (= v_~a~0_41 0) (= 0 v_~x$r_buff0_thd3~0_132))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_441, ~x$flush_delayed~0=v_~x$flush_delayed~0_68, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_293, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_132, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_270|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ~a~0=v_~a~0_41, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_150, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_~#t916~0.offset=|v_ULTIMATE.start_main_~#t916~0.offset_16|, ULTIMATE.start_main_~#t917~0.offset=|v_ULTIMATE.start_main_~#t917~0.offset_16|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_140, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_298, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_539, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_202, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_35, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_148, ~x~0=v_~x~0_192, ULTIMATE.start_main_~#t918~0.offset=|v_ULTIMATE.start_main_~#t918~0.offset_15|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_322, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_72|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_209, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_38, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_32|, ULTIMATE.start_main_~#t918~0.base=|v_ULTIMATE.start_main_~#t918~0.base_19|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y~0=v_~y~0_44, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ULTIMATE.start_main_~#t917~0.base=|v_ULTIMATE.start_main_~#t917~0.base_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_215, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_247, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_964, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_44|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_13, ~weak$$choice2~0=v_~weak$$choice2~0_155, ULTIMATE.start_main_~#t916~0.base=|v_ULTIMATE.start_main_~#t916~0.base_21|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t916~0.offset, ULTIMATE.start_main_~#t917~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t918~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t918~0.base, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t917~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t916~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 17:37:46,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L828-1-->L830: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t917~0.base_13|)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t917~0.base_13|)) (= |v_ULTIMATE.start_main_~#t917~0.offset_11| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t917~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t917~0.base_13|) |v_ULTIMATE.start_main_~#t917~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t917~0.base_13| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t917~0.base_13|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t917~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t917~0.offset=|v_ULTIMATE.start_main_~#t917~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t917~0.base=|v_ULTIMATE.start_main_~#t917~0.base_13|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t917~0.offset, ULTIMATE.start_main_~#t917~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 17:37:46,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L830-1-->L832: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t918~0.base_13| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t918~0.base_13|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t918~0.base_13| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t918~0.base_13|) (= |v_ULTIMATE.start_main_~#t918~0.offset_11| 0) (not (= |v_ULTIMATE.start_main_~#t918~0.base_13| 0)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t918~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t918~0.base_13|) |v_ULTIMATE.start_main_~#t918~0.offset_11| 2)) |v_#memory_int_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t918~0.base=|v_ULTIMATE.start_main_~#t918~0.base_13|, ULTIMATE.start_main_~#t918~0.offset=|v_ULTIMATE.start_main_~#t918~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t918~0.base, ULTIMATE.start_main_~#t918~0.offset] because there is no mapped edge [2019-12-07 17:37:46,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] P1ENTRY-->L5-3: Formula: (and (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| (ite (not (and (not (= 0 (mod v_~x$w_buff1_used~0_44 256))) (not (= (mod v_~x$w_buff0_used~0_73 256) 0)))) 1 0)) (= 1 v_~x$w_buff0~0_19) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_~x$w_buff0~0_20 v_~x$w_buff1~0_15) (= v_~x$w_buff1_used~0_44 v_~x$w_buff0_used~0_74) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 0)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= 1 v_~x$w_buff0_used~0_73)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_74} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_19, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_44, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_73} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 17:37:46,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L805-2-->L805-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In2118879748 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In2118879748 256) 0))) (or (and (= ~x~0_In2118879748 |P2Thread1of1ForFork2_#t~ite32_Out2118879748|) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite32_Out2118879748| ~x$w_buff1~0_In2118879748) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In2118879748, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2118879748, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2118879748, ~x~0=~x~0_In2118879748} OutVars{P2Thread1of1ForFork2_#t~ite32=|P2Thread1of1ForFork2_#t~ite32_Out2118879748|, ~x$w_buff1~0=~x$w_buff1~0_In2118879748, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2118879748, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2118879748, ~x~0=~x~0_In2118879748} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-07 17:37:46,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1695670153 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1695670153 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite28_Out-1695670153|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-1695670153 |P1Thread1of1ForFork1_#t~ite28_Out-1695670153|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1695670153, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1695670153} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1695670153, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1695670153|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1695670153} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 17:37:46,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L805-4-->L806: Formula: (= v_~x~0_35 |v_P2Thread1of1ForFork2_#t~ite32_10|) InVars {P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_10|} OutVars{P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_15|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~x~0] because there is no mapped edge [2019-12-07 17:37:46,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1523647223 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1523647223 256)))) (or (and (= ~x$w_buff0_used~0_In1523647223 |P2Thread1of1ForFork2_#t~ite34_Out1523647223|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite34_Out1523647223|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1523647223, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1523647223} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out1523647223|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1523647223, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1523647223} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34] because there is no mapped edge [2019-12-07 17:37:46,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L807-->L807-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In995975540 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In995975540 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In995975540 256))) (.cse2 (= (mod ~x$r_buff1_thd3~0_In995975540 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite35_Out995975540|)) (and (= ~x$w_buff1_used~0_In995975540 |P2Thread1of1ForFork2_#t~ite35_Out995975540|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In995975540, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In995975540, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In995975540, ~x$w_buff0_used~0=~x$w_buff0_used~0_In995975540} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out995975540|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In995975540, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In995975540, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In995975540, ~x$w_buff0_used~0=~x$w_buff0_used~0_In995975540} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35] because there is no mapped edge [2019-12-07 17:37:46,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1948702040 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-1948702040 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-1948702040 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1948702040 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite29_Out-1948702040| ~x$w_buff1_used~0_In-1948702040)) (and (= 0 |P1Thread1of1ForFork1_#t~ite29_Out-1948702040|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1948702040, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1948702040, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1948702040, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1948702040} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1948702040|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1948702040, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1948702040, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1948702040, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1948702040} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 17:37:46,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L782-->L783: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1197202945 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1197202945 256))) (.cse2 (= ~x$r_buff0_thd2~0_Out-1197202945 ~x$r_buff0_thd2~0_In-1197202945))) (or (and (= ~x$r_buff0_thd2~0_Out-1197202945 0) (not .cse0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1197202945, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1197202945} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1197202945|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1197202945, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1197202945} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 17:37:46,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-1900026074 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1900026074 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1900026074 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-1900026074 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In-1900026074 |P1Thread1of1ForFork1_#t~ite31_Out-1900026074|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite31_Out-1900026074|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1900026074, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1900026074, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1900026074, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1900026074} OutVars{P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-1900026074|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1900026074, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1900026074, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1900026074, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1900026074} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 17:37:46,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L783-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd2~0_113 |v_P1Thread1of1ForFork1_#t~ite31_40|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_39|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 17:37:46,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2000764492 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite12_Out-2000764492| |P0Thread1of1ForFork0_#t~ite11_Out-2000764492|) (= ~x$w_buff1~0_In-2000764492 |P0Thread1of1ForFork0_#t~ite11_Out-2000764492|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-2000764492 256)))) (or (and (= (mod ~x$w_buff1_used~0_In-2000764492 256) 0) .cse1) (and (= 0 (mod ~x$r_buff1_thd1~0_In-2000764492 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-2000764492 256))))) (and (not .cse0) (= ~x$w_buff1~0_In-2000764492 |P0Thread1of1ForFork0_#t~ite12_Out-2000764492|) (= |P0Thread1of1ForFork0_#t~ite11_In-2000764492| |P0Thread1of1ForFork0_#t~ite11_Out-2000764492|)))) InVars {P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_In-2000764492|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2000764492, ~x$w_buff1~0=~x$w_buff1~0_In-2000764492, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2000764492, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2000764492, ~weak$$choice2~0=~weak$$choice2~0_In-2000764492, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2000764492} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out-2000764492|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2000764492, ~x$w_buff1~0=~x$w_buff1~0_In-2000764492, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2000764492, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2000764492, ~weak$$choice2~0=~weak$$choice2~0_In-2000764492, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out-2000764492|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2000764492} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11, P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 17:37:46,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L746-->L746-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-473260587 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite14_In-473260587| |P0Thread1of1ForFork0_#t~ite14_Out-473260587|) (= ~x$w_buff0_used~0_In-473260587 |P0Thread1of1ForFork0_#t~ite15_Out-473260587|) (not .cse0)) (and .cse0 (= |P0Thread1of1ForFork0_#t~ite14_Out-473260587| |P0Thread1of1ForFork0_#t~ite15_Out-473260587|) (= ~x$w_buff0_used~0_In-473260587 |P0Thread1of1ForFork0_#t~ite14_Out-473260587|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-473260587 256) 0))) (or (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-473260587 256) 0)) (= (mod ~x$w_buff0_used~0_In-473260587 256) 0) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-473260587 256)))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-473260587, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-473260587, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-473260587, ~weak$$choice2~0=~weak$$choice2~0_In-473260587, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_In-473260587|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-473260587} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-473260587, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-473260587, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-473260587, P0Thread1of1ForFork0_#t~ite15=|P0Thread1of1ForFork0_#t~ite15_Out-473260587|, ~weak$$choice2~0=~weak$$choice2~0_In-473260587, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_Out-473260587|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-473260587} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite15, P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-07 17:37:46,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L748-->L749: Formula: (and (= v_~x$r_buff0_thd1~0_65 v_~x$r_buff0_thd1~0_64) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_5|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_64, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_5|, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_5|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, ~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite20, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-07 17:37:46,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L751-->L759: Formula: (and (= v_~x$flush_delayed~0_20 0) (= v_~x~0_54 v_~x$mem_tmp~0_15) (not (= (mod v_~x$flush_delayed~0_21 256) 0)) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_15} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_13|, ~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 17:37:46,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2126615773 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-2126615773 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite36_Out-2126615773|)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd3~0_In-2126615773 |P2Thread1of1ForFork2_#t~ite36_Out-2126615773|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2126615773, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2126615773} OutVars{P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out-2126615773|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2126615773, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2126615773} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-07 17:37:46,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1882904978 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1882904978 256))) (.cse3 (= (mod ~x$r_buff1_thd3~0_In-1882904978 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1882904978 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite37_Out-1882904978|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd3~0_In-1882904978 |P2Thread1of1ForFork2_#t~ite37_Out-1882904978|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1882904978, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1882904978, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1882904978, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1882904978} OutVars{P2Thread1of1ForFork2_#t~ite37=|P2Thread1of1ForFork2_#t~ite37_Out-1882904978|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1882904978, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1882904978, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1882904978, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1882904978} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37] because there is no mapped edge [2019-12-07 17:37:46,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L809-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite37_44| v_~x$r_buff1_thd3~0_117)) InVars {P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_43|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_117, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 17:37:46,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L832-1-->L838: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 17:37:46,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L838-2-->L838-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In336859383 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In336859383 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out336859383| ~x$w_buff1~0_In336859383) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In336859383 |ULTIMATE.start_main_#t~ite41_Out336859383|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In336859383, ~x$w_buff1_used~0=~x$w_buff1_used~0_In336859383, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In336859383, ~x~0=~x~0_In336859383} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out336859383|, ~x$w_buff1~0=~x$w_buff1~0_In336859383, ~x$w_buff1_used~0=~x$w_buff1_used~0_In336859383, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In336859383, ~x~0=~x~0_In336859383} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 17:37:46,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L838-4-->L839: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_9|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 17:37:46,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L839-->L839-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In748627533 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In748627533 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out748627533| ~x$w_buff0_used~0_In748627533) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out748627533|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In748627533, ~x$w_buff0_used~0=~x$w_buff0_used~0_In748627533} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In748627533, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out748627533|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In748627533} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:37:46,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L840-->L840-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-1322055236 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1322055236 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1322055236 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1322055236 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1322055236 |ULTIMATE.start_main_#t~ite44_Out-1322055236|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1322055236|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1322055236, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1322055236, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1322055236, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1322055236} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1322055236, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1322055236, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1322055236, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1322055236|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1322055236} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:37:46,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L841-->L841-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-59248682 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-59248682 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-59248682| 0) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In-59248682 |ULTIMATE.start_main_#t~ite45_Out-59248682|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-59248682, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-59248682} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-59248682, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-59248682|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-59248682} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:37:46,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L842-->L842-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd0~0_In2060011283 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In2060011283 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In2060011283 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In2060011283 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out2060011283|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd0~0_In2060011283 |ULTIMATE.start_main_#t~ite46_Out2060011283|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2060011283, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2060011283, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2060011283, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2060011283} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2060011283, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out2060011283|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2060011283, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2060011283, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2060011283} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 17:37:46,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L842-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_139 0) (= v_~__unbuffered_p2_EBX~0_22 0) (= 1 v_~__unbuffered_p2_EAX~0_22) (= 0 v_~__unbuffered_p0_EAX~0_34))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_25) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_25 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~x$r_buff1_thd0~0_203 |v_ULTIMATE.start_main_#t~ite46_54|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_139, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_54|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_139, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_53|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_203, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:37:46,101 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0223c396-719d-44b4-89c8-532210e493c3/bin/uautomizer/witness.graphml [2019-12-07 17:37:46,101 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:37:46,102 INFO L168 Benchmark]: Toolchain (without parser) took 65090.07 ms. Allocated memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: 3.1 GB). Free memory was 935.5 MB in the beginning and 1.7 GB in the end (delta: -809.5 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-12-07 17:37:46,102 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 956.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:37:46,102 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -167.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:37:46,102 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.62 ms. Allocated memory is still 1.2 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:37:46,103 INFO L168 Benchmark]: Boogie Preprocessor took 24.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:37:46,103 INFO L168 Benchmark]: RCFGBuilder took 391.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.3 MB). Peak memory consumption was 55.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:37:46,103 INFO L168 Benchmark]: TraceAbstraction took 64188.54 ms. Allocated memory was 1.2 GB in the beginning and 4.1 GB in the end (delta: 2.9 GB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -756.8 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-12-07 17:37:46,103 INFO L168 Benchmark]: Witness Printer took 60.84 ms. Allocated memory is still 4.1 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 54.4 MB). Peak memory consumption was 54.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:37:46,105 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 956.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 383.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -167.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 391.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.3 MB). Peak memory consumption was 55.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 64188.54 ms. Allocated memory was 1.2 GB in the beginning and 4.1 GB in the end (delta: 2.9 GB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -756.8 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Witness Printer took 60.84 ms. Allocated memory is still 4.1 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 54.4 MB). Peak memory consumption was 54.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 166 ProgramPointsBefore, 83 ProgramPointsAfterwards, 197 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 6463 VarBasedMoverChecksPositive, 266 VarBasedMoverChecksNegative, 94 SemBasedMoverChecksPositive, 257 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 66821 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L828] FCALL, FORK 0 pthread_create(&t916, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L830] FCALL, FORK 0 pthread_create(&t917, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L832] FCALL, FORK 0 pthread_create(&t918, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L769] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L770] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L771] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L772] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L773] 2 x$r_buff0_thd2 = (_Bool)1 [L776] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=0, z=0] [L779] EXPR 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=0, z=0] [L793] 3 y = 1 [L796] 3 z = 1 [L799] 3 __unbuffered_p2_EAX = z [L802] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=1] [L805] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=1] [L779] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L806] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L807] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L736] 1 a = 1 [L739] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L740] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L741] 1 x$flush_delayed = weak$$choice2 [L742] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=1] [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 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 [L743] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1, z=1] [L743] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L744] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1, z=1] [L744] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L745] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L746] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L747] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1, z=1] [L747] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1, z=1] [L749] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1, z=1] [L808] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L838] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1, z=1] [L839] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L840] 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 [L841] 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 4 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 64.0s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 35.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5316 SDtfs, 9539 SDslu, 26834 SDs, 0 SdLazy, 24748 SolverSat, 492 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 509 GetRequests, 20 SyntacticMatches, 28 SemanticMatches, 461 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5584 ImplicationChecksByTransitivity, 10.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89098occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 137931 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 979 NumberOfCodeBlocks, 979 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 901 ConstructedInterpolants, 0 QuantifiedInterpolants, 368014 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...