./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix035_rmo.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_52822fd3-7f69-45ba-aa7b-18b72f0f5e6c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_52822fd3-7f69-45ba-aa7b-18b72f0f5e6c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_52822fd3-7f69-45ba-aa7b-18b72f0f5e6c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_52822fd3-7f69-45ba-aa7b-18b72f0f5e6c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix035_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_52822fd3-7f69-45ba-aa7b-18b72f0f5e6c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_52822fd3-7f69-45ba-aa7b-18b72f0f5e6c/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 70083d56ad1b7eeee4bd107654f34fad3ea760de .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 10:34:03,402 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:34:03,403 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:34:03,411 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:34:03,411 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:34:03,412 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:34:03,413 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:34:03,414 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:34:03,415 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:34:03,416 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:34:03,416 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:34:03,417 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:34:03,417 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:34:03,418 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:34:03,419 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:34:03,420 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:34:03,420 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:34:03,421 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:34:03,422 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:34:03,424 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:34:03,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:34:03,426 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:34:03,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:34:03,427 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:34:03,429 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:34:03,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:34:03,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:34:03,429 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:34:03,430 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:34:03,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:34:03,430 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:34:03,431 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:34:03,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:34:03,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:34:03,432 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:34:03,432 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:34:03,433 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:34:03,433 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:34:03,433 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:34:03,434 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:34:03,434 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:34:03,435 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_52822fd3-7f69-45ba-aa7b-18b72f0f5e6c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:34:03,444 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:34:03,444 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:34:03,445 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:34:03,445 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:34:03,445 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:34:03,446 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:34:03,446 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:34:03,446 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:34:03,446 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:34:03,446 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:34:03,446 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:34:03,446 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:34:03,447 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:34:03,447 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:34:03,447 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:34:03,447 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:34:03,447 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:34:03,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:34:03,447 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:34:03,447 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:34:03,448 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:34:03,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:34:03,448 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:34:03,448 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:34:03,448 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:34:03,448 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:34:03,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:34:03,448 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:34:03,448 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:34:03,449 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_52822fd3-7f69-45ba-aa7b-18b72f0f5e6c/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 -> 70083d56ad1b7eeee4bd107654f34fad3ea760de [2019-12-07 10:34:03,550 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:34:03,558 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:34:03,561 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:34:03,562 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:34:03,562 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:34:03,563 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_52822fd3-7f69-45ba-aa7b-18b72f0f5e6c/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix035_rmo.opt.i [2019-12-07 10:34:03,598 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_52822fd3-7f69-45ba-aa7b-18b72f0f5e6c/bin/uautomizer/data/e077c234a/0ba3df4b87af4b1db803c41b338e195f/FLAG8ec554033 [2019-12-07 10:34:04,045 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:34:04,045 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_52822fd3-7f69-45ba-aa7b-18b72f0f5e6c/sv-benchmarks/c/pthread-wmm/mix035_rmo.opt.i [2019-12-07 10:34:04,055 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_52822fd3-7f69-45ba-aa7b-18b72f0f5e6c/bin/uautomizer/data/e077c234a/0ba3df4b87af4b1db803c41b338e195f/FLAG8ec554033 [2019-12-07 10:34:04,064 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_52822fd3-7f69-45ba-aa7b-18b72f0f5e6c/bin/uautomizer/data/e077c234a/0ba3df4b87af4b1db803c41b338e195f [2019-12-07 10:34:04,066 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:34:04,066 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:34:04,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:34:04,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:34:04,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:34:04,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:34:04" (1/1) ... [2019-12-07 10:34:04,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2ff042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:04, skipping insertion in model container [2019-12-07 10:34:04,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:34:04" (1/1) ... [2019-12-07 10:34:04,076 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:34:04,104 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:34:04,341 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:34:04,348 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:34:04,391 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:34:04,437 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:34:04,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:04 WrapperNode [2019-12-07 10:34:04,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:34:04,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:34:04,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:34:04,438 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:34:04,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:04" (1/1) ... [2019-12-07 10:34:04,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:04" (1/1) ... [2019-12-07 10:34:04,475 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:34:04,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:34:04,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:34:04,476 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:34:04,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:04" (1/1) ... [2019-12-07 10:34:04,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:04" (1/1) ... [2019-12-07 10:34:04,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:04" (1/1) ... [2019-12-07 10:34:04,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:04" (1/1) ... [2019-12-07 10:34:04,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:04" (1/1) ... [2019-12-07 10:34:04,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:04" (1/1) ... [2019-12-07 10:34:04,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:04" (1/1) ... [2019-12-07 10:34:04,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:34:04,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:34:04,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:34:04,500 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:34:04,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_52822fd3-7f69-45ba-aa7b-18b72f0f5e6c/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 10:34:04,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:34:04,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:34:04,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:34:04,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:34:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:34:04,541 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:34:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:34:04,541 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:34:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 10:34:04,541 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 10:34:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:34:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:34:04,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:34:04,542 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 10:34:04,884 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:34:04,884 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:34:04,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:34:04 BoogieIcfgContainer [2019-12-07 10:34:04,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:34:04,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:34:04,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:34:04,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:34:04,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:34:04" (1/3) ... [2019-12-07 10:34:04,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd6e27b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:34:04, skipping insertion in model container [2019-12-07 10:34:04,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:04" (2/3) ... [2019-12-07 10:34:04,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd6e27b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:34:04, skipping insertion in model container [2019-12-07 10:34:04,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:34:04" (3/3) ... [2019-12-07 10:34:04,890 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_rmo.opt.i [2019-12-07 10:34:04,896 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:34:04,896 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:34:04,901 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:34:04,901 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:34:04,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,927 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,927 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,944 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,944 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,944 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,944 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,944 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,949 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,949 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:04,968 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 10:34:04,985 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:34:04,985 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:34:04,985 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:34:04,985 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:34:04,985 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:34:04,986 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:34:04,986 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:34:04,986 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:34:05,000 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 197 transitions [2019-12-07 10:34:05,002 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-07 10:34:05,056 INFO L134 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-07 10:34:05,057 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:34:05,067 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 10:34:05,082 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-07 10:34:05,110 INFO L134 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-07 10:34:05,110 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:34:05,115 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 10:34:05,129 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-07 10:34:05,130 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:34:08,129 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-07 10:34:08,276 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66821 [2019-12-07 10:34:08,276 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-07 10:34:08,279 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 91 transitions [2019-12-07 10:34:17,754 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-07 10:34:17,755 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-07 10:34:17,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 10:34:17,759 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:34:17,760 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 10:34:17,760 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 10:34:17,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:34:17,763 INFO L82 PathProgramCache]: Analyzing trace with hash 802094366, now seen corresponding path program 1 times [2019-12-07 10:34:17,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:34:17,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100474048] [2019-12-07 10:34:17,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:34:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:34:17,910 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 10:34:17,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100474048] [2019-12-07 10:34:17,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:34:17,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:34:17,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935716529] [2019-12-07 10:34:17,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:34:17,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:34:17,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:34:17,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:34:17,927 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-07 10:34:18,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:34:18,481 INFO L93 Difference]: Finished difference Result 87938 states and 378592 transitions. [2019-12-07 10:34:18,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:34:18,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 10:34:18,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:34:18,995 INFO L225 Difference]: With dead ends: 87938 [2019-12-07 10:34:18,995 INFO L226 Difference]: Without dead ends: 82842 [2019-12-07 10:34:18,996 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 10:34:22,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82842 states. [2019-12-07 10:34:23,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82842 to 82842. [2019-12-07 10:34:23,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82842 states. [2019-12-07 10:34:23,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82842 states to 82842 states and 356178 transitions. [2019-12-07 10:34:23,616 INFO L78 Accepts]: Start accepts. Automaton has 82842 states and 356178 transitions. Word has length 5 [2019-12-07 10:34:23,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:34:23,617 INFO L462 AbstractCegarLoop]: Abstraction has 82842 states and 356178 transitions. [2019-12-07 10:34:23,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:34:23,617 INFO L276 IsEmpty]: Start isEmpty. Operand 82842 states and 356178 transitions. [2019-12-07 10:34:23,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:34:23,623 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:34:23,623 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:34:23,624 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 10:34:23,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:34:23,624 INFO L82 PathProgramCache]: Analyzing trace with hash -136321435, now seen corresponding path program 1 times [2019-12-07 10:34:23,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:34:23,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505789635] [2019-12-07 10:34:23,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:34:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:34:23,685 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 10:34:23,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505789635] [2019-12-07 10:34:23,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:34:23,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:34:23,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010157428] [2019-12-07 10:34:23,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:34:23,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:34:23,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:34:23,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:34:23,687 INFO L87 Difference]: Start difference. First operand 82842 states and 356178 transitions. Second operand 4 states. [2019-12-07 10:34:25,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:34:25,955 INFO L93 Difference]: Finished difference Result 127576 states and 528234 transitions. [2019-12-07 10:34:25,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:34:25,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 10:34:25,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:34:26,305 INFO L225 Difference]: With dead ends: 127576 [2019-12-07 10:34:26,306 INFO L226 Difference]: Without dead ends: 127485 [2019-12-07 10:34:26,307 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 10:34:30,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127485 states. [2019-12-07 10:34:31,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127485 to 114069. [2019-12-07 10:34:31,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114069 states. [2019-12-07 10:34:32,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114069 states to 114069 states and 478222 transitions. [2019-12-07 10:34:32,027 INFO L78 Accepts]: Start accepts. Automaton has 114069 states and 478222 transitions. Word has length 13 [2019-12-07 10:34:32,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:34:32,028 INFO L462 AbstractCegarLoop]: Abstraction has 114069 states and 478222 transitions. [2019-12-07 10:34:32,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:34:32,028 INFO L276 IsEmpty]: Start isEmpty. Operand 114069 states and 478222 transitions. [2019-12-07 10:34:32,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:34:32,030 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:34:32,030 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:34:32,030 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 10:34:32,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:34:32,031 INFO L82 PathProgramCache]: Analyzing trace with hash -120546049, now seen corresponding path program 1 times [2019-12-07 10:34:32,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:34:32,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602321535] [2019-12-07 10:34:32,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:34:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:34:32,082 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 10:34:32,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602321535] [2019-12-07 10:34:32,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:34:32,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:34:32,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256885974] [2019-12-07 10:34:32,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:34:32,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:34:32,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:34:32,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:34:32,084 INFO L87 Difference]: Start difference. First operand 114069 states and 478222 transitions. Second operand 4 states. [2019-12-07 10:34:32,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:34:32,908 INFO L93 Difference]: Finished difference Result 160471 states and 658995 transitions. [2019-12-07 10:34:32,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:34:32,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 10:34:32,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:34:33,302 INFO L225 Difference]: With dead ends: 160471 [2019-12-07 10:34:33,303 INFO L226 Difference]: Without dead ends: 160367 [2019-12-07 10:34:33,303 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 10:34:37,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160367 states. [2019-12-07 10:34:41,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160367 to 134135. [2019-12-07 10:34:41,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134135 states. [2019-12-07 10:34:42,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134135 states to 134135 states and 559867 transitions. [2019-12-07 10:34:42,022 INFO L78 Accepts]: Start accepts. Automaton has 134135 states and 559867 transitions. Word has length 13 [2019-12-07 10:34:42,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:34:42,022 INFO L462 AbstractCegarLoop]: Abstraction has 134135 states and 559867 transitions. [2019-12-07 10:34:42,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:34:42,023 INFO L276 IsEmpty]: Start isEmpty. Operand 134135 states and 559867 transitions. [2019-12-07 10:34:42,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:34:42,026 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:34:42,026 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:34:42,026 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 10:34:42,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:34:42,026 INFO L82 PathProgramCache]: Analyzing trace with hash 2051868705, now seen corresponding path program 1 times [2019-12-07 10:34:42,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:34:42,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638793993] [2019-12-07 10:34:42,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:34:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:34:42,071 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 10:34:42,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638793993] [2019-12-07 10:34:42,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:34:42,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:34:42,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511293501] [2019-12-07 10:34:42,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:34:42,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:34:42,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:34:42,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:34:42,072 INFO L87 Difference]: Start difference. First operand 134135 states and 559867 transitions. Second operand 5 states. [2019-12-07 10:34:43,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:34:43,055 INFO L93 Difference]: Finished difference Result 189913 states and 778616 transitions. [2019-12-07 10:34:43,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:34:43,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 10:34:43,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:34:43,525 INFO L225 Difference]: With dead ends: 189913 [2019-12-07 10:34:43,525 INFO L226 Difference]: Without dead ends: 189761 [2019-12-07 10:34:43,525 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 10:34:48,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189761 states. [2019-12-07 10:34:50,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189761 to 158625. [2019-12-07 10:34:50,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158625 states. [2019-12-07 10:34:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158625 states to 158625 states and 659187 transitions. [2019-12-07 10:34:51,061 INFO L78 Accepts]: Start accepts. Automaton has 158625 states and 659187 transitions. Word has length 14 [2019-12-07 10:34:51,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:34:51,061 INFO L462 AbstractCegarLoop]: Abstraction has 158625 states and 659187 transitions. [2019-12-07 10:34:51,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:34:51,061 INFO L276 IsEmpty]: Start isEmpty. Operand 158625 states and 659187 transitions. [2019-12-07 10:34:51,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 10:34:51,075 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:34:51,075 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:34:51,075 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 10:34:51,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:34:51,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1028195498, now seen corresponding path program 1 times [2019-12-07 10:34:51,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:34:51,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204605531] [2019-12-07 10:34:51,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:34:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:34:51,126 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 10:34:51,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204605531] [2019-12-07 10:34:51,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:34:51,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:34:51,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494091895] [2019-12-07 10:34:51,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:34:51,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:34:51,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:34:51,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:34:51,127 INFO L87 Difference]: Start difference. First operand 158625 states and 659187 transitions. Second operand 3 states. [2019-12-07 10:34:51,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:34:51,814 INFO L93 Difference]: Finished difference Result 159291 states and 660750 transitions. [2019-12-07 10:34:51,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:34:51,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 10:34:51,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:34:52,201 INFO L225 Difference]: With dead ends: 159291 [2019-12-07 10:34:52,201 INFO L226 Difference]: Without dead ends: 159291 [2019-12-07 10:34:52,201 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 10:34:58,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159291 states. [2019-12-07 10:35:00,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159291 to 158526. [2019-12-07 10:35:00,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158526 states. [2019-12-07 10:35:00,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158526 states to 158526 states and 658762 transitions. [2019-12-07 10:35:00,933 INFO L78 Accepts]: Start accepts. Automaton has 158526 states and 658762 transitions. Word has length 18 [2019-12-07 10:35:00,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:00,934 INFO L462 AbstractCegarLoop]: Abstraction has 158526 states and 658762 transitions. [2019-12-07 10:35:00,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:35:00,934 INFO L276 IsEmpty]: Start isEmpty. Operand 158526 states and 658762 transitions. [2019-12-07 10:35:00,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 10:35:00,947 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:00,947 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:00,948 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 10:35:00,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:00,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1590428835, now seen corresponding path program 1 times [2019-12-07 10:35:00,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:00,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771426067] [2019-12-07 10:35:00,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:00,991 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 10:35:00,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771426067] [2019-12-07 10:35:00,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:00,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:35:00,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247246792] [2019-12-07 10:35:00,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:35:00,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:00,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:35:00,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:35:00,993 INFO L87 Difference]: Start difference. First operand 158526 states and 658762 transitions. Second operand 4 states. [2019-12-07 10:35:01,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:01,677 INFO L93 Difference]: Finished difference Result 158491 states and 657425 transitions. [2019-12-07 10:35:01,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:35:01,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 10:35:01,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:02,061 INFO L225 Difference]: With dead ends: 158491 [2019-12-07 10:35:02,061 INFO L226 Difference]: Without dead ends: 158491 [2019-12-07 10:35:02,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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 10:35:06,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158491 states. [2019-12-07 10:35:08,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158491 to 157738. [2019-12-07 10:35:08,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157738 states. [2019-12-07 10:35:09,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157738 states to 157738 states and 655465 transitions. [2019-12-07 10:35:09,125 INFO L78 Accepts]: Start accepts. Automaton has 157738 states and 655465 transitions. Word has length 19 [2019-12-07 10:35:09,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:09,125 INFO L462 AbstractCegarLoop]: Abstraction has 157738 states and 655465 transitions. [2019-12-07 10:35:09,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:35:09,125 INFO L276 IsEmpty]: Start isEmpty. Operand 157738 states and 655465 transitions. [2019-12-07 10:35:09,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 10:35:09,139 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:09,139 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:09,139 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 10:35:09,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:09,140 INFO L82 PathProgramCache]: Analyzing trace with hash 236764452, now seen corresponding path program 1 times [2019-12-07 10:35:09,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:09,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148284479] [2019-12-07 10:35:09,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:09,171 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 10:35:09,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148284479] [2019-12-07 10:35:09,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:09,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:35:09,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181931065] [2019-12-07 10:35:09,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:35:09,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:09,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:35:09,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:35:09,172 INFO L87 Difference]: Start difference. First operand 157738 states and 655465 transitions. Second operand 3 states. [2019-12-07 10:35:10,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:10,141 INFO L93 Difference]: Finished difference Result 148899 states and 612303 transitions. [2019-12-07 10:35:10,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:35:10,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 10:35:10,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:10,492 INFO L225 Difference]: With dead ends: 148899 [2019-12-07 10:35:10,492 INFO L226 Difference]: Without dead ends: 148899 [2019-12-07 10:35:10,493 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 10:35:14,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148899 states. [2019-12-07 10:35:18,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148899 to 145621. [2019-12-07 10:35:18,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145621 states. [2019-12-07 10:35:18,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145621 states to 145621 states and 599467 transitions. [2019-12-07 10:35:18,512 INFO L78 Accepts]: Start accepts. Automaton has 145621 states and 599467 transitions. Word has length 19 [2019-12-07 10:35:18,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:18,512 INFO L462 AbstractCegarLoop]: Abstraction has 145621 states and 599467 transitions. [2019-12-07 10:35:18,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:35:18,512 INFO L276 IsEmpty]: Start isEmpty. Operand 145621 states and 599467 transitions. [2019-12-07 10:35:18,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 10:35:18,523 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:18,523 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:18,523 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 10:35:18,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:18,524 INFO L82 PathProgramCache]: Analyzing trace with hash -2004363160, now seen corresponding path program 1 times [2019-12-07 10:35:18,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:18,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929604963] [2019-12-07 10:35:18,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:18,544 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 10:35:18,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929604963] [2019-12-07 10:35:18,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:18,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:35:18,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128051785] [2019-12-07 10:35:18,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:35:18,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:18,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:35:18,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:35:18,545 INFO L87 Difference]: Start difference. First operand 145621 states and 599467 transitions. Second operand 3 states. [2019-12-07 10:35:18,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:18,640 INFO L93 Difference]: Finished difference Result 30445 states and 101323 transitions. [2019-12-07 10:35:18,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:35:18,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 10:35:18,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:18,687 INFO L225 Difference]: With dead ends: 30445 [2019-12-07 10:35:18,687 INFO L226 Difference]: Without dead ends: 30445 [2019-12-07 10:35:18,688 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 10:35:18,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30445 states. [2019-12-07 10:35:19,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30445 to 30445. [2019-12-07 10:35:19,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30445 states. [2019-12-07 10:35:19,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30445 states to 30445 states and 101323 transitions. [2019-12-07 10:35:19,206 INFO L78 Accepts]: Start accepts. Automaton has 30445 states and 101323 transitions. Word has length 19 [2019-12-07 10:35:19,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:19,206 INFO L462 AbstractCegarLoop]: Abstraction has 30445 states and 101323 transitions. [2019-12-07 10:35:19,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:35:19,206 INFO L276 IsEmpty]: Start isEmpty. Operand 30445 states and 101323 transitions. [2019-12-07 10:35:19,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:35:19,211 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:19,211 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 10:35:19,212 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 10:35:19,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:19,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1808091808, now seen corresponding path program 1 times [2019-12-07 10:35:19,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:19,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008228062] [2019-12-07 10:35:19,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:19,253 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 10:35:19,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008228062] [2019-12-07 10:35:19,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:19,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:35:19,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137689335] [2019-12-07 10:35:19,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:35:19,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:19,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:35:19,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:35:19,255 INFO L87 Difference]: Start difference. First operand 30445 states and 101323 transitions. Second operand 6 states. [2019-12-07 10:35:20,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:20,052 INFO L93 Difference]: Finished difference Result 48131 states and 157197 transitions. [2019-12-07 10:35:20,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:35:20,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 10:35:20,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:20,121 INFO L225 Difference]: With dead ends: 48131 [2019-12-07 10:35:20,121 INFO L226 Difference]: Without dead ends: 48101 [2019-12-07 10:35:20,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 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 10:35:20,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48101 states. [2019-12-07 10:35:20,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48101 to 30716. [2019-12-07 10:35:20,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30716 states. [2019-12-07 10:35:20,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30716 states to 30716 states and 101391 transitions. [2019-12-07 10:35:20,770 INFO L78 Accepts]: Start accepts. Automaton has 30716 states and 101391 transitions. Word has length 22 [2019-12-07 10:35:20,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:20,770 INFO L462 AbstractCegarLoop]: Abstraction has 30716 states and 101391 transitions. [2019-12-07 10:35:20,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:35:20,770 INFO L276 IsEmpty]: Start isEmpty. Operand 30716 states and 101391 transitions. [2019-12-07 10:35:20,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 10:35:20,779 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:20,779 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 10:35:20,779 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 10:35:20,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:20,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1844565345, now seen corresponding path program 1 times [2019-12-07 10:35:20,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:20,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844195951] [2019-12-07 10:35:20,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:20,825 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 10:35:20,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844195951] [2019-12-07 10:35:20,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:20,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:35:20,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592721662] [2019-12-07 10:35:20,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:35:20,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:20,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:35:20,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:35:20,826 INFO L87 Difference]: Start difference. First operand 30716 states and 101391 transitions. Second operand 5 states. [2019-12-07 10:35:21,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:21,182 INFO L93 Difference]: Finished difference Result 42950 states and 139907 transitions. [2019-12-07 10:35:21,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:35:21,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 10:35:21,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:21,245 INFO L225 Difference]: With dead ends: 42950 [2019-12-07 10:35:21,245 INFO L226 Difference]: Without dead ends: 42925 [2019-12-07 10:35:21,245 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:35:21,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42925 states. [2019-12-07 10:35:21,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42925 to 35753. [2019-12-07 10:35:21,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35753 states. [2019-12-07 10:35:21,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35753 states to 35753 states and 117270 transitions. [2019-12-07 10:35:21,916 INFO L78 Accepts]: Start accepts. Automaton has 35753 states and 117270 transitions. Word has length 25 [2019-12-07 10:35:21,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:21,916 INFO L462 AbstractCegarLoop]: Abstraction has 35753 states and 117270 transitions. [2019-12-07 10:35:21,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:35:21,916 INFO L276 IsEmpty]: Start isEmpty. Operand 35753 states and 117270 transitions. [2019-12-07 10:35:21,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 10:35:21,931 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:21,931 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:21,931 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 10:35:21,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:21,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1424915674, now seen corresponding path program 1 times [2019-12-07 10:35:21,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:21,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628963347] [2019-12-07 10:35:21,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:21,976 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 10:35:21,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628963347] [2019-12-07 10:35:21,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:21,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:35:21,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899506406] [2019-12-07 10:35:21,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:35:21,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:21,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:35:21,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:35:21,978 INFO L87 Difference]: Start difference. First operand 35753 states and 117270 transitions. Second operand 6 states. [2019-12-07 10:35:22,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:22,371 INFO L93 Difference]: Finished difference Result 55000 states and 179547 transitions. [2019-12-07 10:35:22,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:35:22,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-07 10:35:22,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:22,459 INFO L225 Difference]: With dead ends: 55000 [2019-12-07 10:35:22,459 INFO L226 Difference]: Without dead ends: 54954 [2019-12-07 10:35:22,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:35:22,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54954 states. [2019-12-07 10:35:23,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54954 to 38277. [2019-12-07 10:35:23,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38277 states. [2019-12-07 10:35:23,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38277 states to 38277 states and 125484 transitions. [2019-12-07 10:35:23,230 INFO L78 Accepts]: Start accepts. Automaton has 38277 states and 125484 transitions. Word has length 28 [2019-12-07 10:35:23,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:23,230 INFO L462 AbstractCegarLoop]: Abstraction has 38277 states and 125484 transitions. [2019-12-07 10:35:23,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:35:23,230 INFO L276 IsEmpty]: Start isEmpty. Operand 38277 states and 125484 transitions. [2019-12-07 10:35:23,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 10:35:23,248 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:23,248 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:23,248 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 10:35:23,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:23,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1041372561, now seen corresponding path program 1 times [2019-12-07 10:35:23,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:23,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639480411] [2019-12-07 10:35:23,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:23,278 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 10:35:23,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639480411] [2019-12-07 10:35:23,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:23,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:35:23,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952886270] [2019-12-07 10:35:23,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:35:23,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:23,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:35:23,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:35:23,280 INFO L87 Difference]: Start difference. First operand 38277 states and 125484 transitions. Second operand 4 states. [2019-12-07 10:35:23,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:23,329 INFO L93 Difference]: Finished difference Result 14114 states and 43540 transitions. [2019-12-07 10:35:23,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:35:23,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-12-07 10:35:23,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:23,345 INFO L225 Difference]: With dead ends: 14114 [2019-12-07 10:35:23,345 INFO L226 Difference]: Without dead ends: 14114 [2019-12-07 10:35:23,346 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 10:35:23,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14114 states. [2019-12-07 10:35:23,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14114 to 13386. [2019-12-07 10:35:23,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13386 states. [2019-12-07 10:35:23,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13386 states to 13386 states and 41278 transitions. [2019-12-07 10:35:23,765 INFO L78 Accepts]: Start accepts. Automaton has 13386 states and 41278 transitions. Word has length 30 [2019-12-07 10:35:23,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:23,766 INFO L462 AbstractCegarLoop]: Abstraction has 13386 states and 41278 transitions. [2019-12-07 10:35:23,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:35:23,766 INFO L276 IsEmpty]: Start isEmpty. Operand 13386 states and 41278 transitions. [2019-12-07 10:35:23,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 10:35:23,778 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:23,778 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 10:35:23,778 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 10:35:23,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:23,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1586693927, now seen corresponding path program 1 times [2019-12-07 10:35:23,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:23,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709527923] [2019-12-07 10:35:23,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:23,835 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 10:35:23,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709527923] [2019-12-07 10:35:23,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:23,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:35:23,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806663415] [2019-12-07 10:35:23,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:35:23,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:23,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:35:23,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:35:23,836 INFO L87 Difference]: Start difference. First operand 13386 states and 41278 transitions. Second operand 3 states. [2019-12-07 10:35:23,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:23,883 INFO L93 Difference]: Finished difference Result 12891 states and 39265 transitions. [2019-12-07 10:35:23,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:35:23,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 10:35:23,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:23,898 INFO L225 Difference]: With dead ends: 12891 [2019-12-07 10:35:23,898 INFO L226 Difference]: Without dead ends: 12891 [2019-12-07 10:35:23,899 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 10:35:23,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12891 states. [2019-12-07 10:35:24,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12891 to 12493. [2019-12-07 10:35:24,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12493 states. [2019-12-07 10:35:24,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12493 states to 12493 states and 38082 transitions. [2019-12-07 10:35:24,069 INFO L78 Accepts]: Start accepts. Automaton has 12493 states and 38082 transitions. Word has length 40 [2019-12-07 10:35:24,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:24,069 INFO L462 AbstractCegarLoop]: Abstraction has 12493 states and 38082 transitions. [2019-12-07 10:35:24,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:35:24,069 INFO L276 IsEmpty]: Start isEmpty. Operand 12493 states and 38082 transitions. [2019-12-07 10:35:24,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 10:35:24,078 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:24,078 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 10:35:24,078 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 10:35:24,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:24,079 INFO L82 PathProgramCache]: Analyzing trace with hash -942593898, now seen corresponding path program 1 times [2019-12-07 10:35:24,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:24,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474931306] [2019-12-07 10:35:24,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:24,119 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 10:35:24,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474931306] [2019-12-07 10:35:24,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:24,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:35:24,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695608352] [2019-12-07 10:35:24,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:35:24,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:24,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:35:24,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:35:24,120 INFO L87 Difference]: Start difference. First operand 12493 states and 38082 transitions. Second operand 5 states. [2019-12-07 10:35:24,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:24,171 INFO L93 Difference]: Finished difference Result 11085 states and 34670 transitions. [2019-12-07 10:35:24,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:35:24,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-07 10:35:24,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:24,184 INFO L225 Difference]: With dead ends: 11085 [2019-12-07 10:35:24,184 INFO L226 Difference]: Without dead ends: 11085 [2019-12-07 10:35:24,184 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 10:35:24,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11085 states. [2019-12-07 10:35:24,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11085 to 9755. [2019-12-07 10:35:24,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9755 states. [2019-12-07 10:35:24,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9755 states to 9755 states and 30658 transitions. [2019-12-07 10:35:24,333 INFO L78 Accepts]: Start accepts. Automaton has 9755 states and 30658 transitions. Word has length 40 [2019-12-07 10:35:24,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:24,333 INFO L462 AbstractCegarLoop]: Abstraction has 9755 states and 30658 transitions. [2019-12-07 10:35:24,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:35:24,333 INFO L276 IsEmpty]: Start isEmpty. Operand 9755 states and 30658 transitions. [2019-12-07 10:35:24,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:35:24,341 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:24,341 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 10:35:24,341 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 10:35:24,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:24,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1695349201, now seen corresponding path program 1 times [2019-12-07 10:35:24,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:24,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95162152] [2019-12-07 10:35:24,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:24,378 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 10:35:24,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95162152] [2019-12-07 10:35:24,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:24,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:35:24,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299719658] [2019-12-07 10:35:24,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:35:24,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:24,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:35:24,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:35:24,379 INFO L87 Difference]: Start difference. First operand 9755 states and 30658 transitions. Second operand 3 states. [2019-12-07 10:35:24,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:24,445 INFO L93 Difference]: Finished difference Result 13030 states and 40161 transitions. [2019-12-07 10:35:24,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:35:24,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-07 10:35:24,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:24,463 INFO L225 Difference]: With dead ends: 13030 [2019-12-07 10:35:24,464 INFO L226 Difference]: Without dead ends: 13030 [2019-12-07 10:35:24,464 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 10:35:24,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13030 states. [2019-12-07 10:35:24,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13030 to 10004. [2019-12-07 10:35:24,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10004 states. [2019-12-07 10:35:24,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10004 states to 10004 states and 31564 transitions. [2019-12-07 10:35:24,620 INFO L78 Accepts]: Start accepts. Automaton has 10004 states and 31564 transitions. Word has length 56 [2019-12-07 10:35:24,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:24,620 INFO L462 AbstractCegarLoop]: Abstraction has 10004 states and 31564 transitions. [2019-12-07 10:35:24,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:35:24,620 INFO L276 IsEmpty]: Start isEmpty. Operand 10004 states and 31564 transitions. [2019-12-07 10:35:24,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:35:24,629 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:24,629 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 10:35:24,630 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 10:35:24,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:24,630 INFO L82 PathProgramCache]: Analyzing trace with hash 378310324, now seen corresponding path program 1 times [2019-12-07 10:35:24,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:24,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855493149] [2019-12-07 10:35:24,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:24,779 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 10:35:24,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855493149] [2019-12-07 10:35:24,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:24,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 10:35:24,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898085847] [2019-12-07 10:35:24,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 10:35:24,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:24,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:35:24,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:35:24,780 INFO L87 Difference]: Start difference. First operand 10004 states and 31564 transitions. Second operand 10 states. [2019-12-07 10:35:25,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:25,503 INFO L93 Difference]: Finished difference Result 18760 states and 58943 transitions. [2019-12-07 10:35:25,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 10:35:25,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-12-07 10:35:25,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:25,519 INFO L225 Difference]: With dead ends: 18760 [2019-12-07 10:35:25,519 INFO L226 Difference]: Without dead ends: 14730 [2019-12-07 10:35:25,520 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-07 10:35:25,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14730 states. [2019-12-07 10:35:25,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14730 to 12623. [2019-12-07 10:35:25,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12623 states. [2019-12-07 10:35:25,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12623 states to 12623 states and 39642 transitions. [2019-12-07 10:35:25,709 INFO L78 Accepts]: Start accepts. Automaton has 12623 states and 39642 transitions. Word has length 56 [2019-12-07 10:35:25,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:25,709 INFO L462 AbstractCegarLoop]: Abstraction has 12623 states and 39642 transitions. [2019-12-07 10:35:25,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 10:35:25,709 INFO L276 IsEmpty]: Start isEmpty. Operand 12623 states and 39642 transitions. [2019-12-07 10:35:25,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:35:25,722 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:25,722 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 10:35:25,722 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 10:35:25,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:25,722 INFO L82 PathProgramCache]: Analyzing trace with hash 991384472, now seen corresponding path program 2 times [2019-12-07 10:35:25,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:25,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18217023] [2019-12-07 10:35:25,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:26,011 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 10:35:26,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18217023] [2019-12-07 10:35:26,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:26,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:35:26,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376558423] [2019-12-07 10:35:26,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:35:26,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:26,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:35:26,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:35:26,012 INFO L87 Difference]: Start difference. First operand 12623 states and 39642 transitions. Second operand 16 states. [2019-12-07 10:35:28,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:28,282 INFO L93 Difference]: Finished difference Result 21452 states and 65279 transitions. [2019-12-07 10:35:28,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-07 10:35:28,282 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-07 10:35:28,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:28,303 INFO L225 Difference]: With dead ends: 21452 [2019-12-07 10:35:28,303 INFO L226 Difference]: Without dead ends: 19554 [2019-12-07 10:35:28,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=394, Invalid=2258, Unknown=0, NotChecked=0, Total=2652 [2019-12-07 10:35:28,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19554 states. [2019-12-07 10:35:28,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19554 to 14744. [2019-12-07 10:35:28,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14744 states. [2019-12-07 10:35:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14744 states to 14744 states and 45707 transitions. [2019-12-07 10:35:28,543 INFO L78 Accepts]: Start accepts. Automaton has 14744 states and 45707 transitions. Word has length 56 [2019-12-07 10:35:28,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:28,544 INFO L462 AbstractCegarLoop]: Abstraction has 14744 states and 45707 transitions. [2019-12-07 10:35:28,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:35:28,544 INFO L276 IsEmpty]: Start isEmpty. Operand 14744 states and 45707 transitions. [2019-12-07 10:35:28,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:35:28,557 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:28,557 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 10:35:28,557 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 10:35:28,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:28,557 INFO L82 PathProgramCache]: Analyzing trace with hash 681087788, now seen corresponding path program 3 times [2019-12-07 10:35:28,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:28,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624234879] [2019-12-07 10:35:28,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:28,661 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 10:35:28,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624234879] [2019-12-07 10:35:28,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:28,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 10:35:28,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647226439] [2019-12-07 10:35:28,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 10:35:28,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:28,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:35:28,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:35:28,663 INFO L87 Difference]: Start difference. First operand 14744 states and 45707 transitions. Second operand 10 states. [2019-12-07 10:35:29,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:29,683 INFO L93 Difference]: Finished difference Result 20716 states and 63292 transitions. [2019-12-07 10:35:29,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 10:35:29,683 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-12-07 10:35:29,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:29,713 INFO L225 Difference]: With dead ends: 20716 [2019-12-07 10:35:29,713 INFO L226 Difference]: Without dead ends: 18013 [2019-12-07 10:35:29,713 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-07 10:35:29,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18013 states. [2019-12-07 10:35:29,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18013 to 14507. [2019-12-07 10:35:29,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14507 states. [2019-12-07 10:35:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14507 states to 14507 states and 44968 transitions. [2019-12-07 10:35:29,937 INFO L78 Accepts]: Start accepts. Automaton has 14507 states and 44968 transitions. Word has length 56 [2019-12-07 10:35:29,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:29,937 INFO L462 AbstractCegarLoop]: Abstraction has 14507 states and 44968 transitions. [2019-12-07 10:35:29,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 10:35:29,937 INFO L276 IsEmpty]: Start isEmpty. Operand 14507 states and 44968 transitions. [2019-12-07 10:35:29,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:35:29,951 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:29,951 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 10:35:29,951 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 10:35:29,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:29,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1211542094, now seen corresponding path program 4 times [2019-12-07 10:35:29,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:29,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416705799] [2019-12-07 10:35:29,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:30,211 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 10:35:30,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416705799] [2019-12-07 10:35:30,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:30,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 10:35:30,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287369252] [2019-12-07 10:35:30,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 10:35:30,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:30,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 10:35:30,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-12-07 10:35:30,213 INFO L87 Difference]: Start difference. First operand 14507 states and 44968 transitions. Second operand 18 states. [2019-12-07 10:35:33,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:33,563 INFO L93 Difference]: Finished difference Result 20867 states and 63136 transitions. [2019-12-07 10:35:33,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-07 10:35:33,564 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-12-07 10:35:33,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:33,595 INFO L225 Difference]: With dead ends: 20867 [2019-12-07 10:35:33,595 INFO L226 Difference]: Without dead ends: 18761 [2019-12-07 10:35:33,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=469, Invalid=2611, Unknown=0, NotChecked=0, Total=3080 [2019-12-07 10:35:33,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18761 states. [2019-12-07 10:35:33,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18761 to 15837. [2019-12-07 10:35:33,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15837 states. [2019-12-07 10:35:33,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15837 states to 15837 states and 48830 transitions. [2019-12-07 10:35:33,833 INFO L78 Accepts]: Start accepts. Automaton has 15837 states and 48830 transitions. Word has length 56 [2019-12-07 10:35:33,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:33,834 INFO L462 AbstractCegarLoop]: Abstraction has 15837 states and 48830 transitions. [2019-12-07 10:35:33,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 10:35:33,834 INFO L276 IsEmpty]: Start isEmpty. Operand 15837 states and 48830 transitions. [2019-12-07 10:35:33,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:35:33,848 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:33,848 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 10:35:33,848 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 10:35:33,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:33,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1112243484, now seen corresponding path program 5 times [2019-12-07 10:35:33,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:33,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131583161] [2019-12-07 10:35:33,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:33,954 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 10:35:33,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131583161] [2019-12-07 10:35:33,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:33,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 10:35:33,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299816613] [2019-12-07 10:35:33,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 10:35:33,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:33,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:35:33,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:35:33,955 INFO L87 Difference]: Start difference. First operand 15837 states and 48830 transitions. Second operand 10 states. [2019-12-07 10:35:35,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:35,340 INFO L93 Difference]: Finished difference Result 23240 states and 70694 transitions. [2019-12-07 10:35:35,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 10:35:35,341 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-12-07 10:35:35,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:35,376 INFO L225 Difference]: With dead ends: 23240 [2019-12-07 10:35:35,376 INFO L226 Difference]: Without dead ends: 20674 [2019-12-07 10:35:35,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:35:35,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20674 states. [2019-12-07 10:35:35,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20674 to 16071. [2019-12-07 10:35:35,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16071 states. [2019-12-07 10:35:35,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16071 states to 16071 states and 49422 transitions. [2019-12-07 10:35:35,628 INFO L78 Accepts]: Start accepts. Automaton has 16071 states and 49422 transitions. Word has length 56 [2019-12-07 10:35:35,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:35,628 INFO L462 AbstractCegarLoop]: Abstraction has 16071 states and 49422 transitions. [2019-12-07 10:35:35,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 10:35:35,629 INFO L276 IsEmpty]: Start isEmpty. Operand 16071 states and 49422 transitions. [2019-12-07 10:35:35,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:35:35,643 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:35,643 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 10:35:35,643 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 10:35:35,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:35,644 INFO L82 PathProgramCache]: Analyzing trace with hash -2106032246, now seen corresponding path program 6 times [2019-12-07 10:35:35,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:35,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974321357] [2019-12-07 10:35:35,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:35,788 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 10:35:35,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974321357] [2019-12-07 10:35:35,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:35,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 10:35:35,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360551948] [2019-12-07 10:35:35,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 10:35:35,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:35,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 10:35:35,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:35:35,789 INFO L87 Difference]: Start difference. First operand 16071 states and 49422 transitions. Second operand 12 states. [2019-12-07 10:35:37,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:37,697 INFO L93 Difference]: Finished difference Result 22290 states and 67810 transitions. [2019-12-07 10:35:37,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 10:35:37,698 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-07 10:35:37,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:37,719 INFO L225 Difference]: With dead ends: 22290 [2019-12-07 10:35:37,720 INFO L226 Difference]: Without dead ends: 19540 [2019-12-07 10:35:37,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2019-12-07 10:35:37,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19540 states. [2019-12-07 10:35:37,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19540 to 14229. [2019-12-07 10:35:37,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14229 states. [2019-12-07 10:35:37,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14229 states to 14229 states and 44025 transitions. [2019-12-07 10:35:37,951 INFO L78 Accepts]: Start accepts. Automaton has 14229 states and 44025 transitions. Word has length 56 [2019-12-07 10:35:37,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:37,952 INFO L462 AbstractCegarLoop]: Abstraction has 14229 states and 44025 transitions. [2019-12-07 10:35:37,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 10:35:37,952 INFO L276 IsEmpty]: Start isEmpty. Operand 14229 states and 44025 transitions. [2019-12-07 10:35:37,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:35:37,965 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:37,965 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 10:35:37,965 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 10:35:37,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:37,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1886942222, now seen corresponding path program 7 times [2019-12-07 10:35:37,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:37,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295467709] [2019-12-07 10:35:37,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:38,368 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 10:35:38,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295467709] [2019-12-07 10:35:38,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:38,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-07 10:35:38,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826794754] [2019-12-07 10:35:38,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 10:35:38,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:38,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 10:35:38,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-12-07 10:35:38,370 INFO L87 Difference]: Start difference. First operand 14229 states and 44025 transitions. Second operand 19 states. [2019-12-07 10:35:42,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:42,814 INFO L93 Difference]: Finished difference Result 24671 states and 73443 transitions. [2019-12-07 10:35:42,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-12-07 10:35:42,814 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2019-12-07 10:35:42,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:42,837 INFO L225 Difference]: With dead ends: 24671 [2019-12-07 10:35:42,838 INFO L226 Difference]: Without dead ends: 22463 [2019-12-07 10:35:42,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1477 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=745, Invalid=4225, Unknown=0, NotChecked=0, Total=4970 [2019-12-07 10:35:42,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22463 states. [2019-12-07 10:35:43,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22463 to 14911. [2019-12-07 10:35:43,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14911 states. [2019-12-07 10:35:43,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14911 states to 14911 states and 45807 transitions. [2019-12-07 10:35:43,090 INFO L78 Accepts]: Start accepts. Automaton has 14911 states and 45807 transitions. Word has length 56 [2019-12-07 10:35:43,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:43,091 INFO L462 AbstractCegarLoop]: Abstraction has 14911 states and 45807 transitions. [2019-12-07 10:35:43,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 10:35:43,091 INFO L276 IsEmpty]: Start isEmpty. Operand 14911 states and 45807 transitions. [2019-12-07 10:35:43,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:35:43,104 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:43,104 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:43,104 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 10:35:43,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:43,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1655686983, now seen corresponding path program 1 times [2019-12-07 10:35:43,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:43,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901360406] [2019-12-07 10:35:43,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:43,138 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 10:35:43,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901360406] [2019-12-07 10:35:43,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:43,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:35:43,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663501381] [2019-12-07 10:35:43,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:35:43,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:43,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:35:43,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:35:43,140 INFO L87 Difference]: Start difference. First operand 14911 states and 45807 transitions. Second operand 3 states. [2019-12-07 10:35:43,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:43,194 INFO L93 Difference]: Finished difference Result 15919 states and 47190 transitions. [2019-12-07 10:35:43,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:35:43,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-07 10:35:43,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:43,210 INFO L225 Difference]: With dead ends: 15919 [2019-12-07 10:35:43,210 INFO L226 Difference]: Without dead ends: 15919 [2019-12-07 10:35:43,210 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 10:35:43,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15919 states. [2019-12-07 10:35:43,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15919 to 14581. [2019-12-07 10:35:43,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14581 states. [2019-12-07 10:35:43,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14581 states to 14581 states and 43391 transitions. [2019-12-07 10:35:43,410 INFO L78 Accepts]: Start accepts. Automaton has 14581 states and 43391 transitions. Word has length 56 [2019-12-07 10:35:43,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:43,410 INFO L462 AbstractCegarLoop]: Abstraction has 14581 states and 43391 transitions. [2019-12-07 10:35:43,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:35:43,410 INFO L276 IsEmpty]: Start isEmpty. Operand 14581 states and 43391 transitions. [2019-12-07 10:35:43,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:35:43,422 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:43,422 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 10:35:43,422 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:43,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:43,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1684966898, now seen corresponding path program 8 times [2019-12-07 10:35:43,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:43,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211190935] [2019-12-07 10:35:43,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:43,630 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 10:35:43,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211190935] [2019-12-07 10:35:43,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:43,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:35:43,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354426776] [2019-12-07 10:35:43,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:35:43,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:43,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:35:43,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:35:43,632 INFO L87 Difference]: Start difference. First operand 14581 states and 43391 transitions. Second operand 16 states. [2019-12-07 10:35:44,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:44,789 INFO L93 Difference]: Finished difference Result 18496 states and 53967 transitions. [2019-12-07 10:35:44,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 10:35:44,790 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-07 10:35:44,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:44,807 INFO L225 Difference]: With dead ends: 18496 [2019-12-07 10:35:44,808 INFO L226 Difference]: Without dead ends: 17618 [2019-12-07 10:35:44,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=1096, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 10:35:44,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17618 states. [2019-12-07 10:35:44,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17618 to 14571. [2019-12-07 10:35:44,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14571 states. [2019-12-07 10:35:45,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14571 states to 14571 states and 43339 transitions. [2019-12-07 10:35:45,018 INFO L78 Accepts]: Start accepts. Automaton has 14571 states and 43339 transitions. Word has length 56 [2019-12-07 10:35:45,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:45,019 INFO L462 AbstractCegarLoop]: Abstraction has 14571 states and 43339 transitions. [2019-12-07 10:35:45,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:35:45,019 INFO L276 IsEmpty]: Start isEmpty. Operand 14571 states and 43339 transitions. [2019-12-07 10:35:45,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:35:45,031 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:45,031 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 10:35:45,031 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:45,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:45,031 INFO L82 PathProgramCache]: Analyzing trace with hash 237085668, now seen corresponding path program 9 times [2019-12-07 10:35:45,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:45,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976147690] [2019-12-07 10:35:45,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:45,196 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 10:35:45,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976147690] [2019-12-07 10:35:45,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:45,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 10:35:45,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531575742] [2019-12-07 10:35:45,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 10:35:45,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:45,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 10:35:45,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:35:45,197 INFO L87 Difference]: Start difference. First operand 14571 states and 43339 transitions. Second operand 14 states. [2019-12-07 10:35:46,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:46,328 INFO L93 Difference]: Finished difference Result 19527 states and 57339 transitions. [2019-12-07 10:35:46,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 10:35:46,328 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-07 10:35:46,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:46,351 INFO L225 Difference]: With dead ends: 19527 [2019-12-07 10:35:46,351 INFO L226 Difference]: Without dead ends: 17530 [2019-12-07 10:35:46,352 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=237, Invalid=1023, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 10:35:46,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17530 states. [2019-12-07 10:35:46,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17530 to 13989. [2019-12-07 10:35:46,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13989 states. [2019-12-07 10:35:46,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13989 states to 13989 states and 41721 transitions. [2019-12-07 10:35:46,590 INFO L78 Accepts]: Start accepts. Automaton has 13989 states and 41721 transitions. Word has length 56 [2019-12-07 10:35:46,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:46,590 INFO L462 AbstractCegarLoop]: Abstraction has 13989 states and 41721 transitions. [2019-12-07 10:35:46,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 10:35:46,590 INFO L276 IsEmpty]: Start isEmpty. Operand 13989 states and 41721 transitions. [2019-12-07 10:35:46,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:35:46,601 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:46,601 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 10:35:46,601 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:46,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:46,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1094758462, now seen corresponding path program 10 times [2019-12-07 10:35:46,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:46,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499225040] [2019-12-07 10:35:46,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:46,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 10:35:46,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499225040] [2019-12-07 10:35:46,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:46,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 10:35:46,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536031990] [2019-12-07 10:35:46,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 10:35:46,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:46,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 10:35:46,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:35:46,700 INFO L87 Difference]: Start difference. First operand 13989 states and 41721 transitions. Second operand 11 states. [2019-12-07 10:35:47,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:47,536 INFO L93 Difference]: Finished difference Result 18114 states and 53525 transitions. [2019-12-07 10:35:47,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 10:35:47,537 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-07 10:35:47,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:47,555 INFO L225 Difference]: With dead ends: 18114 [2019-12-07 10:35:47,555 INFO L226 Difference]: Without dead ends: 17436 [2019-12-07 10:35:47,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-07 10:35:47,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17436 states. [2019-12-07 10:35:47,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17436 to 13887. [2019-12-07 10:35:47,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13887 states. [2019-12-07 10:35:47,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13887 states to 13887 states and 41438 transitions. [2019-12-07 10:35:47,763 INFO L78 Accepts]: Start accepts. Automaton has 13887 states and 41438 transitions. Word has length 56 [2019-12-07 10:35:47,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:47,764 INFO L462 AbstractCegarLoop]: Abstraction has 13887 states and 41438 transitions. [2019-12-07 10:35:47,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 10:35:47,764 INFO L276 IsEmpty]: Start isEmpty. Operand 13887 states and 41438 transitions. [2019-12-07 10:35:47,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 10:35:47,776 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:47,776 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 10:35:47,776 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:47,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:47,776 INFO L82 PathProgramCache]: Analyzing trace with hash -196673722, now seen corresponding path program 11 times [2019-12-07 10:35:47,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:47,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734565188] [2019-12-07 10:35:47,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:35:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:35:47,838 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:35:47,838 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:35:47,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] ULTIMATE.startENTRY-->L828: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t928~0.base_21| 4)) (= 0 v_~x$r_buff1_thd2~0_202) (= v_~weak$$choice2~0_155 0) (= |v_ULTIMATE.start_main_~#t928~0.offset_16| 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t928~0.base_21|) (= 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) (= 0 v_~x$r_buff0_thd2~0_247) (= v_~x$flush_delayed~0_68 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~x$w_buff1_used~0_539) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~weak$$choice0~0_35) (= v_~x$r_buff1_thd1~0_293 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_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t928~0.base_21| 1)) (= v_~y~0_44 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~x$w_buff1~0_298) (= |v_#NULL.offset_4| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t928~0.base_21|)) (= 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) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t928~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t928~0.base_21|) |v_ULTIMATE.start_main_~#t928~0.offset_16| 0)) |v_#memory_int_23|) (= 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, ULTIMATE.start_main_~#t929~0.offset=|v_ULTIMATE.start_main_~#t929~0.offset_16|, #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_~#t929~0.base=|v_ULTIMATE.start_main_~#t929~0.base_20|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_140, ULTIMATE.start_main_~#t930~0.offset=|v_ULTIMATE.start_main_~#t930~0.offset_15|, ~__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_~#t928~0.offset=|v_ULTIMATE.start_main_~#t928~0.offset_16|, 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, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_322, ULTIMATE.start_main_~#t930~0.base=|v_ULTIMATE.start_main_~#t930~0.base_19|, 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_#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|, ~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_~#t928~0.base=|v_ULTIMATE.start_main_~#t928~0.base_21|, 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, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t929~0.offset, #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_~#t929~0.base, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t930~0.offset, ~__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_~#t928~0.offset, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t930~0.base, 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_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ~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_~#t928~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 10:35:47,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L828-1-->L830: Formula: (and (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t929~0.base_13|) 0) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t929~0.base_13| 1) |v_#valid_36|) (= |v_ULTIMATE.start_main_~#t929~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t929~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t929~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t929~0.base_13|) |v_ULTIMATE.start_main_~#t929~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t929~0.base_13| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t929~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t929~0.offset=|v_ULTIMATE.start_main_~#t929~0.offset_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t929~0.base=|v_ULTIMATE.start_main_~#t929~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t929~0.offset, #length, ULTIMATE.start_main_~#t929~0.base] because there is no mapped edge [2019-12-07 10:35:47,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L830-1-->L832: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t930~0.offset_11|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t930~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t930~0.base_13|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t930~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t930~0.base_13|) |v_ULTIMATE.start_main_~#t930~0.offset_11| 2)) |v_#memory_int_17|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t930~0.base_13| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t930~0.base_13|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t930~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t930~0.offset=|v_ULTIMATE.start_main_~#t930~0.offset_11|, ULTIMATE.start_main_~#t930~0.base=|v_ULTIMATE.start_main_~#t930~0.base_13|, #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|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t930~0.offset, ULTIMATE.start_main_~#t930~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 10:35:47,842 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 10:35:47,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In1625752868 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1625752868 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite32_Out1625752868| ~x~0_In1625752868)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite32_Out1625752868| ~x$w_buff1~0_In1625752868)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1625752868, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1625752868, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1625752868, ~x~0=~x~0_In1625752868} OutVars{P2Thread1of1ForFork2_#t~ite32=|P2Thread1of1ForFork2_#t~ite32_Out1625752868|, ~x$w_buff1~0=~x$w_buff1~0_In1625752868, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1625752868, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1625752868, ~x~0=~x~0_In1625752868} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-07 10:35:47,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-2004948316 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-2004948316 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out-2004948316| 0)) (and (= |P1Thread1of1ForFork1_#t~ite28_Out-2004948316| ~x$w_buff0_used~0_In-2004948316) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2004948316, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2004948316} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2004948316, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-2004948316|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2004948316} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 10:35:47,844 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 10:35:47,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In179325246 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In179325246 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite34_Out179325246| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite34_Out179325246| ~x$w_buff0_used~0_In179325246) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In179325246, ~x$w_buff0_used~0=~x$w_buff0_used~0_In179325246} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out179325246|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In179325246, ~x$w_buff0_used~0=~x$w_buff0_used~0_In179325246} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34] because there is no mapped edge [2019-12-07 10:35:47,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L807-->L807-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In733469695 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In733469695 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In733469695 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In733469695 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite35_Out733469695|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In733469695 |P2Thread1of1ForFork2_#t~ite35_Out733469695|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In733469695, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In733469695, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In733469695, ~x$w_buff0_used~0=~x$w_buff0_used~0_In733469695} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out733469695|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In733469695, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In733469695, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In733469695, ~x$w_buff0_used~0=~x$w_buff0_used~0_In733469695} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35] because there is no mapped edge [2019-12-07 10:35:47,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In-998509035 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-998509035 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-998509035 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-998509035 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out-998509035| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite29_Out-998509035| ~x$w_buff1_used~0_In-998509035) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-998509035, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-998509035, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-998509035, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-998509035} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-998509035|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-998509035, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-998509035, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-998509035, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-998509035} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 10:35:47,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L782-->L783: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In203778712 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In203778712 256) 0)) (.cse1 (= ~x$r_buff0_thd2~0_In203778712 ~x$r_buff0_thd2~0_Out203778712))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out203778712)) (and .cse2 .cse1))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In203778712, ~x$w_buff0_used~0=~x$w_buff0_used~0_In203778712} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out203778712|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out203778712, ~x$w_buff0_used~0=~x$w_buff0_used~0_In203778712} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 10:35:47,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L783-->L783-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In89039659 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In89039659 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In89039659 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In89039659 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite31_Out89039659|)) (and (= ~x$r_buff1_thd2~0_In89039659 |P1Thread1of1ForFork1_#t~ite31_Out89039659|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In89039659, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In89039659, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In89039659, ~x$w_buff0_used~0=~x$w_buff0_used~0_In89039659} OutVars{P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out89039659|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In89039659, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In89039659, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In89039659, ~x$w_buff0_used~0=~x$w_buff0_used~0_In89039659} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 10:35:47,846 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 10:35:47,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1825427612 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite11_Out1825427612| ~x$w_buff1~0_In1825427612) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1825427612 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In1825427612 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1825427612 256))) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In1825427612 256) 0)))) (= |P0Thread1of1ForFork0_#t~ite11_Out1825427612| |P0Thread1of1ForFork0_#t~ite12_Out1825427612|)) (and (= |P0Thread1of1ForFork0_#t~ite11_In1825427612| |P0Thread1of1ForFork0_#t~ite11_Out1825427612|) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite12_Out1825427612| ~x$w_buff1~0_In1825427612)))) InVars {P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_In1825427612|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1825427612, ~x$w_buff1~0=~x$w_buff1~0_In1825427612, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1825427612, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1825427612, ~weak$$choice2~0=~weak$$choice2~0_In1825427612, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1825427612} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out1825427612|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1825427612, ~x$w_buff1~0=~x$w_buff1~0_In1825427612, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1825427612, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1825427612, ~weak$$choice2~0=~weak$$choice2~0_In1825427612, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out1825427612|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1825427612} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11, P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 10:35:47,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L746-->L746-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-531740168 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite15_Out-531740168| ~x$w_buff0_used~0_In-531740168) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite14_In-531740168| |P0Thread1of1ForFork0_#t~ite14_Out-531740168|)) (and (= |P0Thread1of1ForFork0_#t~ite14_Out-531740168| |P0Thread1of1ForFork0_#t~ite15_Out-531740168|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-531740168 256)))) (or (and (= (mod ~x$w_buff1_used~0_In-531740168 256) 0) .cse1) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-531740168 256) 0)) (= (mod ~x$w_buff0_used~0_In-531740168 256) 0))) (= |P0Thread1of1ForFork0_#t~ite14_Out-531740168| ~x$w_buff0_used~0_In-531740168)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-531740168, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-531740168, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-531740168, ~weak$$choice2~0=~weak$$choice2~0_In-531740168, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_In-531740168|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-531740168} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-531740168, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-531740168, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-531740168, P0Thread1of1ForFork0_#t~ite15=|P0Thread1of1ForFork0_#t~ite15_Out-531740168|, ~weak$$choice2~0=~weak$$choice2~0_In-531740168, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_Out-531740168|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-531740168} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite15, P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-07 10:35:47,849 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 10:35:47,850 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 10:35:47,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1574994956 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In1574994956 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite36_Out1574994956|) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd3~0_In1574994956 |P2Thread1of1ForFork2_#t~ite36_Out1574994956|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1574994956, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1574994956} OutVars{P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out1574994956|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1574994956, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1574994956} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-07 10:35:47,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd3~0_In908169825 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In908169825 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In908169825 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In908169825 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite37_Out908169825| ~x$r_buff1_thd3~0_In908169825) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite37_Out908169825| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In908169825, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In908169825, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In908169825, ~x$w_buff0_used~0=~x$w_buff0_used~0_In908169825} OutVars{P2Thread1of1ForFork2_#t~ite37=|P2Thread1of1ForFork2_#t~ite37_Out908169825|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In908169825, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In908169825, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In908169825, ~x$w_buff0_used~0=~x$w_buff0_used~0_In908169825} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37] because there is no mapped edge [2019-12-07 10:35:47,850 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 10:35:47,850 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 10:35:47,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L838-2-->L838-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1693961452 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1693961452 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out1693961452| ~x~0_In1693961452) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite41_Out1693961452| ~x$w_buff1~0_In1693961452)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1693961452, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1693961452, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1693961452, ~x~0=~x~0_In1693961452} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1693961452|, ~x$w_buff1~0=~x$w_buff1~0_In1693961452, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1693961452, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1693961452, ~x~0=~x~0_In1693961452} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 10:35:47,851 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 10:35:47,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L839-->L839-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-2140763264 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-2140763264 256)))) (or (and (= ~x$w_buff0_used~0_In-2140763264 |ULTIMATE.start_main_#t~ite43_Out-2140763264|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite43_Out-2140763264| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2140763264, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2140763264} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2140763264, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-2140763264|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2140763264} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 10:35:47,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L840-->L840-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In195378260 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In195378260 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In195378260 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In195378260 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out195378260| ~x$w_buff1_used~0_In195378260) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite44_Out195378260| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In195378260, ~x$w_buff1_used~0=~x$w_buff1_used~0_In195378260, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In195378260, ~x$w_buff0_used~0=~x$w_buff0_used~0_In195378260} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In195378260, ~x$w_buff1_used~0=~x$w_buff1_used~0_In195378260, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In195378260, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out195378260|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In195378260} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 10:35:47,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L841-->L841-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-1701741168 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1701741168 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1701741168| ~x$r_buff0_thd0~0_In-1701741168) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-1701741168| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1701741168, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1701741168} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1701741168, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1701741168|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1701741168} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 10:35:47,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L842-->L842-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-978369152 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-978369152 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-978369152 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-978369152 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out-978369152| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite46_Out-978369152| ~x$r_buff1_thd0~0_In-978369152)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-978369152, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-978369152, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-978369152, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-978369152} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-978369152, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-978369152|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-978369152, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-978369152, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-978369152} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 10:35:47,852 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 10:35:47,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:35:47 BasicIcfg [2019-12-07 10:35:47,899 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:35:47,899 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:35:47,899 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:35:47,900 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:35:47,900 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:34:04" (3/4) ... [2019-12-07 10:35:47,902 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:35:47,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] ULTIMATE.startENTRY-->L828: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t928~0.base_21| 4)) (= 0 v_~x$r_buff1_thd2~0_202) (= v_~weak$$choice2~0_155 0) (= |v_ULTIMATE.start_main_~#t928~0.offset_16| 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t928~0.base_21|) (= 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) (= 0 v_~x$r_buff0_thd2~0_247) (= v_~x$flush_delayed~0_68 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~x$w_buff1_used~0_539) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~weak$$choice0~0_35) (= v_~x$r_buff1_thd1~0_293 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_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t928~0.base_21| 1)) (= v_~y~0_44 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~x$w_buff1~0_298) (= |v_#NULL.offset_4| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t928~0.base_21|)) (= 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) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t928~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t928~0.base_21|) |v_ULTIMATE.start_main_~#t928~0.offset_16| 0)) |v_#memory_int_23|) (= 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, ULTIMATE.start_main_~#t929~0.offset=|v_ULTIMATE.start_main_~#t929~0.offset_16|, #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_~#t929~0.base=|v_ULTIMATE.start_main_~#t929~0.base_20|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_140, ULTIMATE.start_main_~#t930~0.offset=|v_ULTIMATE.start_main_~#t930~0.offset_15|, ~__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_~#t928~0.offset=|v_ULTIMATE.start_main_~#t928~0.offset_16|, 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, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_322, ULTIMATE.start_main_~#t930~0.base=|v_ULTIMATE.start_main_~#t930~0.base_19|, 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_#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|, ~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_~#t928~0.base=|v_ULTIMATE.start_main_~#t928~0.base_21|, 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, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t929~0.offset, #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_~#t929~0.base, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t930~0.offset, ~__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_~#t928~0.offset, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t930~0.base, 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_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ~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_~#t928~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 10:35:47,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L828-1-->L830: Formula: (and (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t929~0.base_13|) 0) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t929~0.base_13| 1) |v_#valid_36|) (= |v_ULTIMATE.start_main_~#t929~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t929~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t929~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t929~0.base_13|) |v_ULTIMATE.start_main_~#t929~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t929~0.base_13| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t929~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t929~0.offset=|v_ULTIMATE.start_main_~#t929~0.offset_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t929~0.base=|v_ULTIMATE.start_main_~#t929~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t929~0.offset, #length, ULTIMATE.start_main_~#t929~0.base] because there is no mapped edge [2019-12-07 10:35:47,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L830-1-->L832: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t930~0.offset_11|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t930~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t930~0.base_13|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t930~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t930~0.base_13|) |v_ULTIMATE.start_main_~#t930~0.offset_11| 2)) |v_#memory_int_17|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t930~0.base_13| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t930~0.base_13|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t930~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t930~0.offset=|v_ULTIMATE.start_main_~#t930~0.offset_11|, ULTIMATE.start_main_~#t930~0.base=|v_ULTIMATE.start_main_~#t930~0.base_13|, #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|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t930~0.offset, ULTIMATE.start_main_~#t930~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 10:35:47,903 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 10:35:47,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In1625752868 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1625752868 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite32_Out1625752868| ~x~0_In1625752868)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite32_Out1625752868| ~x$w_buff1~0_In1625752868)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1625752868, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1625752868, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1625752868, ~x~0=~x~0_In1625752868} OutVars{P2Thread1of1ForFork2_#t~ite32=|P2Thread1of1ForFork2_#t~ite32_Out1625752868|, ~x$w_buff1~0=~x$w_buff1~0_In1625752868, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1625752868, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1625752868, ~x~0=~x~0_In1625752868} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-07 10:35:47,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-2004948316 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-2004948316 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out-2004948316| 0)) (and (= |P1Thread1of1ForFork1_#t~ite28_Out-2004948316| ~x$w_buff0_used~0_In-2004948316) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2004948316, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2004948316} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2004948316, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-2004948316|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2004948316} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 10:35:47,905 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 10:35:47,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In179325246 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In179325246 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite34_Out179325246| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite34_Out179325246| ~x$w_buff0_used~0_In179325246) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In179325246, ~x$w_buff0_used~0=~x$w_buff0_used~0_In179325246} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out179325246|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In179325246, ~x$w_buff0_used~0=~x$w_buff0_used~0_In179325246} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34] because there is no mapped edge [2019-12-07 10:35:47,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L807-->L807-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In733469695 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In733469695 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In733469695 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In733469695 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite35_Out733469695|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In733469695 |P2Thread1of1ForFork2_#t~ite35_Out733469695|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In733469695, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In733469695, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In733469695, ~x$w_buff0_used~0=~x$w_buff0_used~0_In733469695} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out733469695|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In733469695, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In733469695, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In733469695, ~x$w_buff0_used~0=~x$w_buff0_used~0_In733469695} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35] because there is no mapped edge [2019-12-07 10:35:47,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In-998509035 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-998509035 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-998509035 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-998509035 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out-998509035| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite29_Out-998509035| ~x$w_buff1_used~0_In-998509035) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-998509035, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-998509035, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-998509035, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-998509035} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-998509035|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-998509035, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-998509035, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-998509035, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-998509035} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 10:35:47,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L782-->L783: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In203778712 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In203778712 256) 0)) (.cse1 (= ~x$r_buff0_thd2~0_In203778712 ~x$r_buff0_thd2~0_Out203778712))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out203778712)) (and .cse2 .cse1))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In203778712, ~x$w_buff0_used~0=~x$w_buff0_used~0_In203778712} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out203778712|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out203778712, ~x$w_buff0_used~0=~x$w_buff0_used~0_In203778712} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 10:35:47,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L783-->L783-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In89039659 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In89039659 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In89039659 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In89039659 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite31_Out89039659|)) (and (= ~x$r_buff1_thd2~0_In89039659 |P1Thread1of1ForFork1_#t~ite31_Out89039659|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In89039659, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In89039659, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In89039659, ~x$w_buff0_used~0=~x$w_buff0_used~0_In89039659} OutVars{P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out89039659|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In89039659, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In89039659, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In89039659, ~x$w_buff0_used~0=~x$w_buff0_used~0_In89039659} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 10:35:47,907 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 10:35:47,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1825427612 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite11_Out1825427612| ~x$w_buff1~0_In1825427612) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1825427612 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In1825427612 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1825427612 256))) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In1825427612 256) 0)))) (= |P0Thread1of1ForFork0_#t~ite11_Out1825427612| |P0Thread1of1ForFork0_#t~ite12_Out1825427612|)) (and (= |P0Thread1of1ForFork0_#t~ite11_In1825427612| |P0Thread1of1ForFork0_#t~ite11_Out1825427612|) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite12_Out1825427612| ~x$w_buff1~0_In1825427612)))) InVars {P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_In1825427612|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1825427612, ~x$w_buff1~0=~x$w_buff1~0_In1825427612, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1825427612, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1825427612, ~weak$$choice2~0=~weak$$choice2~0_In1825427612, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1825427612} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out1825427612|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1825427612, ~x$w_buff1~0=~x$w_buff1~0_In1825427612, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1825427612, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1825427612, ~weak$$choice2~0=~weak$$choice2~0_In1825427612, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out1825427612|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1825427612} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11, P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 10:35:47,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L746-->L746-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-531740168 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite15_Out-531740168| ~x$w_buff0_used~0_In-531740168) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite14_In-531740168| |P0Thread1of1ForFork0_#t~ite14_Out-531740168|)) (and (= |P0Thread1of1ForFork0_#t~ite14_Out-531740168| |P0Thread1of1ForFork0_#t~ite15_Out-531740168|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-531740168 256)))) (or (and (= (mod ~x$w_buff1_used~0_In-531740168 256) 0) .cse1) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-531740168 256) 0)) (= (mod ~x$w_buff0_used~0_In-531740168 256) 0))) (= |P0Thread1of1ForFork0_#t~ite14_Out-531740168| ~x$w_buff0_used~0_In-531740168)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-531740168, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-531740168, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-531740168, ~weak$$choice2~0=~weak$$choice2~0_In-531740168, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_In-531740168|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-531740168} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-531740168, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-531740168, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-531740168, P0Thread1of1ForFork0_#t~ite15=|P0Thread1of1ForFork0_#t~ite15_Out-531740168|, ~weak$$choice2~0=~weak$$choice2~0_In-531740168, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_Out-531740168|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-531740168} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite15, P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-07 10:35:47,909 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 10:35:47,910 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 10:35:47,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1574994956 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In1574994956 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite36_Out1574994956|) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd3~0_In1574994956 |P2Thread1of1ForFork2_#t~ite36_Out1574994956|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1574994956, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1574994956} OutVars{P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out1574994956|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1574994956, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1574994956} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-07 10:35:47,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd3~0_In908169825 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In908169825 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In908169825 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In908169825 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite37_Out908169825| ~x$r_buff1_thd3~0_In908169825) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite37_Out908169825| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In908169825, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In908169825, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In908169825, ~x$w_buff0_used~0=~x$w_buff0_used~0_In908169825} OutVars{P2Thread1of1ForFork2_#t~ite37=|P2Thread1of1ForFork2_#t~ite37_Out908169825|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In908169825, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In908169825, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In908169825, ~x$w_buff0_used~0=~x$w_buff0_used~0_In908169825} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37] because there is no mapped edge [2019-12-07 10:35:47,911 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 10:35:47,911 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 10:35:47,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L838-2-->L838-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1693961452 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1693961452 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out1693961452| ~x~0_In1693961452) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite41_Out1693961452| ~x$w_buff1~0_In1693961452)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1693961452, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1693961452, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1693961452, ~x~0=~x~0_In1693961452} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1693961452|, ~x$w_buff1~0=~x$w_buff1~0_In1693961452, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1693961452, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1693961452, ~x~0=~x~0_In1693961452} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 10:35:47,911 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 10:35:47,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L839-->L839-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-2140763264 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-2140763264 256)))) (or (and (= ~x$w_buff0_used~0_In-2140763264 |ULTIMATE.start_main_#t~ite43_Out-2140763264|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite43_Out-2140763264| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2140763264, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2140763264} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2140763264, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-2140763264|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2140763264} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 10:35:47,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L840-->L840-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In195378260 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In195378260 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In195378260 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In195378260 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out195378260| ~x$w_buff1_used~0_In195378260) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite44_Out195378260| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In195378260, ~x$w_buff1_used~0=~x$w_buff1_used~0_In195378260, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In195378260, ~x$w_buff0_used~0=~x$w_buff0_used~0_In195378260} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In195378260, ~x$w_buff1_used~0=~x$w_buff1_used~0_In195378260, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In195378260, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out195378260|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In195378260} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 10:35:47,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L841-->L841-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-1701741168 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1701741168 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1701741168| ~x$r_buff0_thd0~0_In-1701741168) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-1701741168| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1701741168, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1701741168} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1701741168, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1701741168|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1701741168} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 10:35:47,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L842-->L842-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-978369152 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-978369152 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-978369152 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-978369152 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out-978369152| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite46_Out-978369152| ~x$r_buff1_thd0~0_In-978369152)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-978369152, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-978369152, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-978369152, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-978369152} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-978369152, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-978369152|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-978369152, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-978369152, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-978369152} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 10:35:47,913 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 10:35:47,961 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_52822fd3-7f69-45ba-aa7b-18b72f0f5e6c/bin/uautomizer/witness.graphml [2019-12-07 10:35:47,961 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:35:47,963 INFO L168 Benchmark]: Toolchain (without parser) took 103896.16 ms. Allocated memory was 1.0 GB in the beginning and 7.0 GB in the end (delta: 5.9 GB). Free memory was 939.4 MB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-12-07 10:35:47,963 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:35:47,963 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -123.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:35:47,963 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:35:47,964 INFO L168 Benchmark]: Boogie Preprocessor took 24.51 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:35:47,964 INFO L168 Benchmark]: RCFGBuilder took 384.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. [2019-12-07 10:35:47,964 INFO L168 Benchmark]: TraceAbstraction took 103013.69 ms. Allocated memory was 1.1 GB in the beginning and 7.0 GB in the end (delta: 5.8 GB). Free memory was 1.0 GB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2019-12-07 10:35:47,964 INFO L168 Benchmark]: Witness Printer took 62.08 ms. Allocated memory is still 7.0 GB. Free memory was 4.4 GB in the beginning and 4.4 GB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:35:47,966 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 370.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -123.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.51 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 384.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 103013.69 ms. Allocated memory was 1.1 GB in the beginning and 7.0 GB in the end (delta: 5.8 GB). Free memory was 1.0 GB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 62.08 ms. Allocated memory is still 7.0 GB. Free memory was 4.4 GB in the beginning and 4.4 GB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 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: 0.9s, 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(&t928, ((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(&t929, ((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(&t930, ((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: 102.8s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 30.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4833 SDtfs, 7286 SDslu, 20364 SDs, 0 SdLazy, 21381 SolverSat, 459 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 438 GetRequests, 35 SyntacticMatches, 12 SemanticMatches, 391 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3651 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158625occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 56.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 164584 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1033 NumberOfCodeBlocks, 1033 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 951 ConstructedInterpolants, 0 QuantifiedInterpolants, 256299 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...